Graph Based Reduction of Program Verification Conditions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Graph Based Reduction of Program Verification Conditions


Increasing the automaticity of proofs in deductive verification of C programs is a challenging task. When applied to industrial C programs known heuristics to generate simpler verification conditions are not efficient enough. This is mainly due to their size and a high number of irrelevant hypotheses. This work presents a strategy to reduce program verification conditions by selecting their relevant hypotheses. The relevance of a hypothesis is determined by the combination of a syntactic analysis and two graph traversals. The first graph is labeled by constants and the second one by the predicates in the axioms. The approach is applied on a benchmark arising in industrial program verification.
Fichier principal
Vignette du fichier
afm09cgs.pdf (214.09 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00402204 , version 1 (07-07-2009)


  • HAL Id : inria-00402204 , version 1
  • ARXIV : 0907.1357


Jean-François Couchot, Alain Giorgetti, Nicolas Stouls. Graph Based Reduction of Program Verification Conditions. Automated Formal Methods (AFM'09), colocated with CAV'09, Hassen Saïdi and N. Shankar, Jun 2009, Grenoble, France. pp.40--47. ⟨inria-00402204⟩
217 View
116 Download



Gmail Facebook X LinkedIn More