A mechanically verified verification condition generator | Zendy

Peter V. Homeier | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A mechanically verified verification condition generator

Author(s) -

Peter V. Homeier

Publication year - 1995

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/38.2.131

Subject(s) - soundness , computer science , correctness , axiom , programming language , generator (circuit theory) , automated theorem proving , semantics (computer science) , hol , proof assistant , operational semantics , theoretical computer science , algorithm , mathematics , mathematical proof , power (physics) , physics , geometry , quantum mechanics

Verification Condition Generator (VCG) tools have bee, effective in simplifying the task of proving programs correct. However, in the past these VCG tools have in general not themselves been mechanically proven, so any proof using and depending on these VCGs might not be sound. In our work, we define and rigorously prove correct a VCG tool within the HOL theorem proving system, for a standard while-loop language, with one new feature not usually treated: expressions with side effects. Starting from a structural operational semantics of this programming language, we prove as theorem the axioms and rules of inference of a Hoare style axiomatic semantics, verifying their soundness. This axiomatic semantics is then used to define and prove correct a VCG tool for this language. Finally, this verified VCG is applied to an example program to verify its correctness.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research