Graph Based Reduction of Program Verification Conditions - Centre of Innovation in Telecommunications and Integration of services Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Graph Based Reduction of Program Verification Conditions

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

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

Citer

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⟩
220 Consultations
120 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More