The B Language and Method: A Guide to Practical Formal Development: Formal Approaches to Computing and Information Technology (FACIT)
Autor Kevin Lanoen Limba Engleză Paperback – 14 mai 1996
Preț: 323.13 lei
Preț vechi: 403.91 lei
-20% Nou
Puncte Express: 485
Preț estimativ în valută:
61.84€ • 64.24$ • 51.37£
61.84€ • 64.24$ • 51.37£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540760337
ISBN-10: 3540760334
Pagini: 244
Ilustrații: VIII, 232 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.35 kg
Ediția:Softcover reprint of the original 1st ed. 1996
Editura: SPRINGER LONDON
Colecția Springer
Seria Formal Approaches to Computing and Information Technology (FACIT)
Locul publicării:London, United Kingdom
ISBN-10: 3540760334
Pagini: 244
Ilustrații: VIII, 232 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.35 kg
Ediția:Softcover reprint of the original 1st ed. 1996
Editura: SPRINGER LONDON
Colecția Springer
Seria Formal Approaches to Computing and Information Technology (FACIT)
Locul publicării:London, United Kingdom
Public țintă
GraduateCuprins
1 Introduction.- 1.1 Formal Methods.- 1.2 The History of B.- 1.3 The Relationship of B to Other Formal Methods.- 1.4 Summary.- 2 The Foundations of B AMN.- 2.1 Mathematical Notation.- 2.2 Defining Operations.- 2.3 Abstract Machines.- 2.4 Machine Composition Mechanisms.- 2.5 Refinement.- 2.6 Implementation.- 2.7 Summary.- 2.8 Exercises 1.- 3 Analysis and Specification.- 3.1 Requirements Analysis.- 3.2 Specification Development.- 3.3 Animation.- 3.4 Proof of Internal Consistency Obligations.- 3.5 Ship Loading Case Study — Specification.- 3.6 Renaming.- 3.7 Aggregation.- 3.8 Summary.- 3.9 Exercises 2.- 4 Design and Implementation.- 4.1 The Layered Development Paradigm.- 4.2 Refinement Examples.- 4.3 Proofs of Refinement.- 4.4 Decomposing Implementations.- 4.5 Ship Loading Case Study — Implementation.- 4.6 Summary.- 4.7 Exercises 3.- 5 Case Studies.- 5.1 Personnel System Development.- 5.2 Mine Pump Control.- 5.3 Vending Machine.- 6 Conclusions.- A Exercise Solutions.- A.1 Exercises 1.- A.2 Exercises 2.- A.3 Exercises 3.- B Properties of Weakest Preconditions.- B.1 Termination and Feasibility.- B.2 Set-theoretic Semantics.- B.3 Refinement.- B.4 Well-formedness Obligations.- B.5 Normal Forms.- B.6 Rules for ?.- B.7 Definition of :=.- C Proof Techniques.