Mechanical verification of mutually recursive procedures
From MaRDI portal
Recommendations
Cites work
- Assignment and Procedure Call Proof Rules
- Automatic program verification. I: A logical basis and its implementation
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 3723840 (Why is no real title available?)
- scientific article; zbMATH DE number 3581593 (Why is no real title available?)
- scientific article; zbMATH DE number 234014 (Why is no real title available?)
- Partial correctness: The term-wise approach
- Soundness and Completeness of an Axiom System for Program Verification
- Substitution revisited
Cited in
(8)- Secure mechanical verification of mutually recursive procedures
- Unbounded procedure summaries from bounded environments
- An algebraic treatment of procedure refinement to support mechanical verification
- Sound and complete verification condition generator for functional recursive programs
- Verification Condition Generation Via Theorem Proving
- Checking observational purity of procedures
- Frame rule for mutually recursive procedures manipulating pointers
- Proving mutual termination
This page was built for publication: Mechanical verification of mutually recursive procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647514)