Safety and progress of recursive procedures

DOI10.1007/BF01211215zbMath0838.68073OpenAlexW2023754145MaRDI QIDQ1903075

Wim H. Hesselink

Publication date: 1 February 1996

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

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

zbMATH Keywords

operational semanticspredicate transformersrecursive proceduresproof rules

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theoretical basis for stepwise refinement and the programming calculus
• Data refinement by calculation
• Interpretations of recursion under unbounded nondeterminacy
• Temporal predicate transformers and fair termination
• Weakest preconditions for progress
• Nondeterminacy and recursion via stacks and games
• Proof rules for recursive procedures
• Programs, Recursion and Unbounded Choice

This page was built for publication: Safety and progress of recursive procedures