Command algebras, recursion and program transformation

DOI10.1007/BF01888217zbMath0697.68023OpenAlexW1986499471MaRDI QIDQ911748

Wim H. Hesselink

Publication date: 1990

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01888217

zbMATH Keywords

program transformationrecursive proceduresweakest preconditionscommand algebrasnondeterminacy

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Proof rules for recursive procedures ⋮ ON SOME PROPERTIES OF A Γ-SEMIRING ⋮ Processes and formalisms for unbounded choice ⋮ Combining angels, demons and miracles in program specifications

Cites Work

• Data refinement by calculation
• On the consistency of Koomen's fair abstraction rule
• Predicate-transformer semantics of general recursion
• A calculus of refinements for program derivations
• Interpretations of recursion under unbounded nondeterminacy
• Ten Years of Hoare's Logic: A Survey—Part I
• Some Properties of Predicate Transformers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Command algebras, recursion and program transformation