Proof rules for recursive procedures

DOI10.1007/BF01211249zbMath0806.68081OpenAlexW2062306963MaRDI QIDQ1329196

Wim H. Hesselink

Publication date: 29 June 1994

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

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

zbMATH Keywords

recursive proceduresPascal-like languagePascal-procedures

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Safety and progress of recursive procedures

Cites Work

• A general proof rule for procedures in predicate transformer semantics
• Command algebras, recursion and program transformation
• The derivation of systolic computations
• Repetitions, known or unknown?
• On-the-fly garbage collection for several mutators
• Programs, Recursion and Unbounded Choice
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item