Graph Based Reduction of Program Verification Conditions
Logic in Computer Science
2011-05-24 v1
Abstract
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.
Cite
@article{arxiv.0907.1357,
title = {Graph Based Reduction of Program Verification Conditions},
author = {Jean-François Couchot and Alain Giorgetti and Nicolas Stouls},
journal= {arXiv preprint arXiv:0907.1357},
year = {2011}
}