Preservation of proof obligations for hybrid verification methods - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Preservation of proof obligations for hybrid verification methods


Program verification environments increasingly rely on hybrid methods that combine static analyses and verification condition generation. While such verification environments operate on source programs, it is often preferable to achieve guarantees about executable code. We show that, for a hybrid verification method based on numerical static analysis and verification condition generation, compilation preserves proof obligations and therefore it is possible to transfer evidence from source to compiled programs. Our result relies on the preservation of the solutions of analysis by compilation; this is achieved by relying on a bytecode analysis that performs symbolic execution of stack expressions in order to overcome the loss of precision incurred by performing static analyses on compiled (rather than source) code. Finally, we show that hybrid verification methods are sound by proving that every program provable by hybrid methods is also provable (at a higher cost) by standard methods.
Fichier principal
Vignette du fichier
main.pdf (193.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00332718 , version 1 (21-10-2008)


  • HAL Id : inria-00332718 , version 1


Gilles Barthe, César Kunz, David Pichardie, Julian Samborski-Forlese. Preservation of proof obligations for hybrid verification methods. 6th IEEE International Conferences on Software Engineering and Formal Methods (SEFM'08), 2008, Cape Town, South Africa. ⟨inria-00332718⟩
117 View
48 Download


Gmail Facebook X LinkedIn More