The stepwise refinement method postulates a system construction route that starts with a high-level specification, goes through a number of provably correct development steps, and ends with an executable program. The contributions to this volume survey the state of the art in this extremely active research area. The world's leading specialists in concurrent program specification, verification, and the theory of their refinement present latest research results and surveys of the fields. State-based, algebraic, temporal logic oriented and category theory oriented approaches are presented. Special attention is paid to the relationship between compositionality and refinement for distributed programs. Surveys are given of results on refinement in partial-order based approaches to concurrency. A unified treatment is given of the assumption/commitment paradigm in compositional concurrent program specification and verification, and the extension of these to liveness properties. Latest results are presented on specifying and proving concurrent data bases correct, and deriving network protocols from their specifications.
Composing specifications.- Refinement calculus, part I: Sequential nondeterministic programs.- Refinement calculus, part II: Parallel and reactive programs.- MetateM: A framework for programming in temporal logic.- Constraint-oriented specification in a constructive formal description technique.- Functional specification of time sensitive communicating systems.- Modular verification of Petri Nets.- Abadi & Lamport and stark: Towards a proof theory for stuttering, dense domains and refinement mappings.- Algebraic implementation of objects over objects.- Refinement of actions in causality based models.- Transformation of combined data type and process specifications using projection algebras.- Various simulations and refinements.- On decomposing and refining specifications of distributed systems.- Verifying the correctness of AADL modules using model checking.- Specialization in logic programming: From horn clause logic to prolog and concurrent prolog.- Analysis of discrete event coordination.- Refinement and projection of relational specifications.- Compositional theories based on an operational semantics of contexts.- Multivalued possibilities mappings.- Completeness theorems for automata.- Formal verification of data type refinement - Theory and practice.- From trace specifications to process terms.- Some comments on the assumption-commitment framework for compositional verification of distributed programs.- Refinement of concurrent systems based on local state transformations.- Construction of network protocols by stepwise refinement.- A derivation of a broadcasting protocol using sequentially phased reasoning.- Verifying atomic data types.- Predicates, predicate transformers and refinement.- Foundations of compositional program refinement.
Series: Lecture Notes in Computer Science
Number Of Pages: 812
Published: 25th April 1990
Publisher: SPRINGER VERLAG GMBH
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6
Weight (kg): 1.13