Formalizing Single-Assignment Program Verification: An Adaptation-Complete Approach
From MaRDI portal
Recommendations
- A unified approach of program verification
- Extraction and verification of programs by analysis of formal proofs
- Parameterized verification with automatically computed inductive assertions
- Towards mechanized program verification with separation logic
- Automating relatively complete verification of higher-order functional programs
Cites work
- An axiomatic basis for computer programming
- Avoiding exponential explosion: generating compact verification conditions
- Efficient weakest preconditions
- Forward with Hoare
- Hoare logic and auxiliary variables
- scientific article; zbMATH DE number 3351184 (Why is no real title available?)
- Predicate calculus and program semantics
- Proving total correctness of recursive procedures
- Soundness and Completeness of an Axiom System for Program Verification
- Ten Years of Hoare's Logic: A Survey—Part I
- The KRAKATOA tool for certification of JAVA/JAVACARD programs annotated in JML
- Tools and Algorithms for the Construction and Analysis of Systems
- Why3 -- where programs meet provers
Cited in
(3)
This page was built for publication: Formalizing Single-Assignment Program Verification: An Adaptation-Complete Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802468)