| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Graph Based Reduction of Program Verification Conditions
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.
Cited literature [28 references]
https://hal.inria.fr/inria-00402204
Contributor : Nicolas Stouls <>
Submitted on : Tuesday, July 7, 2009 - 8:37:06 AM
Last modification on : Friday, January 15, 2021 - 3:08:32 AM
Long-term archiving on: : Tuesday, June 15, 2010 - 7:34:42 PM
Contributor : Nicolas Stouls <>
Submitted on : Tuesday, July 7, 2009 - 8:37:06 AM
Last modification on : Friday, January 15, 2021 - 3:08:32 AM
Long-term archiving on: : Tuesday, June 15, 2010 - 7:34:42 PM
Files
afm09cgs.pdf
Files produced by the author(s)