Graph-based Reduction of Program Verification Conditions - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2008

Graph-based Reduction of Program Verification Conditions

(1) , (1, 2) , (3)
1
2
3

Abstract

In the verification of C programs by deductive approaches based on automated provers, some heuristics of separation analysis are proposed to handle the most difficult problems. Unfortunately, these heuristics are not sufficient when applied on industrial C programs: some valid verification conditions cannot be automatically discharged by any automated prover 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 the combination of separated static dependency analyzes based on graph constructions and traversals. The approach is applied on a benchmark issued from industrial program verification.
Fichier principal
Vignette du fichier
RR-6702.pdf (338.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00339847 , version 1 (19-11-2008)

Identifiers

  • HAL Id : inria-00339847 , version 1

Cite

Jean-François Couchot, Alain Giorgetti, Nicolas Stouls. Graph-based Reduction of Program Verification Conditions. [Research Report] RR-6702, INRIA. 2008, pp.22. ⟨inria-00339847⟩
141 View
111 Download

Share

Gmail Facebook Twitter LinkedIn More