Title: A machine-checked soundness proof for an efficient verification condition generator
Authors: Vogels, Frédéric
Jacobs, Bart
Piessens, Frank #
Issue Date: Mar-2010
Publisher: ACM
Host Document: Symposium on Applied Computing 2010 vol:3 pages:2517-2522
Conference: SAC edition:25 location:Sierre, Switzerland date:22-26 March 2010
Abstract: Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properties by specifying them in a program logic, then generating VCs, and finally feeding these VCs to a theorem prover, is several decades old. It is the underlying technology for state-of-the-art program verifiers such as the Spec] programming system, or ESC/Java. The classic way of computing VCs is by means of Dijkstra's weakest precondition calculus. However, modern verification condition generators (VCgens), including Spec# and ESC/Java's VCgens, are based on an optimized version of this algorithm, that avoids an exponential growth of the VCs in the length of the program to be verified. For this optimized VCgen algorithm, only informal soundness arguments are available. The main contribution of this paper is a fully formal, machine-checked proof of the
soundness of such an efficient VCgen algorithm.
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
# (joint) last author

Files in This Item:
File Description Status SizeFormat
paper.pdf Published 236KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.