Mechanizing programming logics in higher order logic
Current trends in hardware verification and automated theorem proving
Verification of sequential and concurrent programs
Verification of sequential and concurrent programs
Methods and logics for proving programs
Handbook of theoretical computer science (vol. B)
Computation and reasoning: a type theory for computer science
Computation and reasoning: a type theory for computer science
Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
Journal of the ACM (JACM)
Ten Years of Hoare's Logic: A Survey—Part I
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving termination with multiset orderings
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Mathematical Theory of Program Correctness
Mathematical Theory of Program Correctness
Auxiliary Variables and Recursive Procedures
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Mechanical Verification of Mutually Recursive Procedures
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Hi-index | 0.00 |
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We take advantage of the computer-aided proof tool LEGO to interactively establish soundness and completeness of both Hoare Logic and the operation decomposition rules of the Vienna Development Method with respect to operational semantics. We deal with parameterless recursive procedures and local variables in the context of total correctness. In this paper, we discuss in detail the role of representations for expressions, assertions and verification calculi. To what extent is syntax relevant? One needs to carefully select an appropriate level of detail in the formalisation in order to achieve one's objectives.