Command algebras, recursion and program transformation
From MaRDI portal
Publication:911748
DOI10.1007/BF01888217zbMath0697.68023MaRDI QIDQ911748
Publication date: 1990
Published in: Formal Aspects of Computing (Search for Journal in Brave)
program transformation; recursive procedures; weakest preconditions; command algebras; nondeterminacy
68Q55: Semantics in the theory of computing
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Processes and formalisms for unbounded choice, Combining angels, demons and miracles in program specifications, Proof rules for recursive procedures