A theoretical basis for stepwise refinement and the programming calculus

DOI10.1016/0167-6423(87)90011-6zbMath0624.68017MaRDI QIDQ578892

Joseph M. Morris

Publication date: 1987

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(87)90011-6

zbMATH Keywords

stepwise refinement; semantics; programming; specifications; partial ordering; Dijkstra's calculus

Mathematics Subject Classification ID

68N01: General topics in the theory of software

Related Items

A formal software development approach using refinement calculus, Data refinement of predicate transformers, Processes and formalisms for unbounded choice, Weakest precondition semantics for time and concurrency, Combining angels, demons and miracles in program specifications, On the lattice of specifications: Applications to a specification methodology, Mechanizing some advanced refinement concepts, Nondeterminacy and recursion via stacks and games, Normal form approach to compiler design, The lattice of data refinement, The weakest precondition calculus: Recursion and duality, A relation algebraic model of robust correctness, Procedures and atomicity refinement, Coordinating action systems, Action systems, unbounded nondeterminism, and infinite traces, Exits in the refinement calculus, Contracts, games, and refinement., Safety and progress of recursive procedures, Superposition refinement of reactive systems, Linking theories in probabilistic programming