Automatic construction of verification condition generators from hoare logics

Moriconi, Mark; Schwartz, Richard L.

doi:10.1007/3-540-10843-2_30

Cited by 19 publications

(23 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Another approach to the implementation of our method is based on the meta verification condition generation (MetaVCG) [8] for building verification conditions and using PVS for its proving. Detailed information about the MetaVCG can be found in [4].…”

Section: Using Pvs To Prove Inductive Verification Conditionsmentioning

confidence: 99%

Verification of Definite Iteration Over Arrays With a Loop Exit in C Programs

Kondratyev¹,

Maryasov²,

Nepomniaschy³

2017

View full text Add to dashboard Cite

This work represents the further development of the method for definite iteration verification [6]. It extends the mixed axiomatic semantics method [1] suggested for C-light program verification. This extension includes a verification method for definite iteration over unchangeable arrays with a loop exit in C-light programs. The method includes an inference rule for the iteration without invariants, which uses a special function that expresses loop body. This rule was implemented in verification conditions generator, which is the part of our C-light verification system. To prove generated verification conditions an induction is applied which is a challenge for SMT-solvers. At proof stage the SMTsolver Z3 is used in our verification system. To overcome mentioned difficulty a rewriting strategy for verification conditions is suggested. It allows to verify the definite iteration automatically using Z3. Also the paper describes the application of the theorem prover PVS for automatic proving of such verification conditions. An example, which illustrates the application of these methods, is considered.

show abstract

Section: Using Pvs To Prove Inductive Verification Conditionsmentioning

confidence: 99%

Verification of Definite Iteration Over Arrays With a Loop Exit in C Programs

Kondratyev¹,

Maryasov²,

Nepomniaschy³

2017

View full text Add to dashboard Cite

show abstract

“…The method of metageneration proposed by Moriconi and Schwartz [7] consists of two steps. A general axiomatic definition is first transformed into a normal form which, in turn, develops into a recursively defined VCG.…”

Section: Meta Verification Condition Generationmentioning

confidence: 99%

“…Second, the constraints together with the definition of wp allow us to prove that VCG (as a proof system) is sound and complete w.r.t. the initial Hoare system in the normal form [7].…”

Section: The General Form For Rules and Its Translation Into The Normmentioning

confidence: 99%

See 1 more Smart Citation

Experiments on Self-Applicability in the C-Light Verification System. Part 2

Promsky¹

2014

bncc.cs

View full text Add to dashboard Cite

Successful development of the theoretical foundations of C program verification in the project C-light allowed us to address an interesting practical task. We would like to develop a self-applicable verification system for C programs. The first step towards this goal was a series of experiments to verify some fragments of the input analyzer/translator. Now we are ready to address the verification condition generator. As a basis of our approach, we chose the metageneration approach proposed by Moriconi and Schwartz. Metageneration allows us to build automatically a recursively defined generator from a Hoare logic and also ensures its consistency and completeness. This paper discusses the metageneration approach as well as the experiments to verify its implementation in C-light.

show abstract

“…S Finally, the deductive capacity of the system itself (as distinguished from its knowledge base) can be extended by proving and adding new proof procedures through a metatheorem capability [3]. This feature was first added to the Prover in its 1980 version.…”

mentioning

confidence: 99%