Proving total correctness of recursive procedures

DOI10.1016/0890-5401(90)90037-IzbMath0699.68024MaRDI QIDQ913478

Frank S. de Boer, Pierre America

Publication date: 1990

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

proof systemHoare logicrecursive proceduresprogram correctness

Mathematics Subject Classification ID

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

Related Items (4)

Verification of object-oriented programs: a transformational approach ⋮ Fifty years of Hoare's logic ⋮ Formalizing Single-Assignment Program Verification: An Adaptation-Complete Approach ⋮ Calculating sharp adaptation rules.

Cites Work

• First-order dynamic logic
• Ten Years of Hoare's Logic: A Survey—Part I
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proving total correctness of recursive procedures