Countable nondeterminism and random assignment
Journal of the ACM (JACM)
Proving total correctness of recursive procedures
Information and Computation
Ten Years of Hoare's Logic: A Survey—Part I
ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming
Communications of the ACM
Calculating sharp adaptation rules
Information Processing Letters - Special issue in honor of Edsger W. Dijkstra
Mechanical Verification of Total Correctness through Diversion Verification Conditions
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Auxiliary Variables and Recursive Procedures
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Winskel is (Almost) Right: Towards a Mechanized Semantics Textbook
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Hoare Logic for Mutual Recursion and Local Variables
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Mechanical Verification of Mutually Recursive Procedures
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Rule-Based Operational Semantics for an Imperative Language
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
Completeness of ASM Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Propositional Dynamic Logic for Recursive Procedures
VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
Verifying distributed systems: the operational approach
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Certification Using the Mobius Base Logic
Formal Methods for Components and Objects
Frame rule for mutually recursive procedures manipulating pointers
Theoretical Computer Science
A theory of indirection via approximation
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verifying smart card applications: an ASM approach
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
A logical mix of approximation and separation
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Completeness of fair ASM refinement
Science of Computer Programming
Semantics and proof rules of invariant based programs
Proceedings of the 2011 ACM Symposium on Applied Computing
Hoare logic for higher order store using simple semantics
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Certification of safe polynomial memory bounds
FM'11 Proceedings of the 17th international conference on Formal methods
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Mobile resource guarantees for smart devices
CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
A bytecode logic for JML and types
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Local Reasoning for Global Invariants, Part II: Dynamic Boundaries
Journal of the ACM (JACM)
| Hi-index | 0.00 |
This paper presents sound and complete Hoare logics for partial and total correctness of recursive parameterless procedures in the context of unbounded nondeterminism. For total correctness, the literature so far has either restricted recursive procedures to be deterministic or has studied unbounded nondeterminism onlyi n conjunction with loops rather than procedures. We consider both single procedures and systems of mutuallyrecu rsive procedures. All proofs have been checked with the theorem prover Isabelle/HOL.