Skip to Main content Skip to Navigation
Conference papers

Explanation-based generalization of infeasible path

Mickaël Delahaye 1 Bernard Botella 1 Arnaud Gotlieb 2
2 CELTIQUE - Software certification with semantic analysis
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : Recent code-based test input generators based on dynamic symbolic execution increase path coverage by solving path condition with a constraint or an SMT solver. When the solver considers path condition produced from an infeasible path, it tries to show unsatisfiability, which is a useless timeconsuming process. In this paper, we propose a new method that takes opportunity of the detection of a single infeasible path to generalize to a (possibly infinite) family of infeasible paths, which will not have to be considered in further path conditions solving. The method exploits non-intrusive constraint-based explanations, a technique developed in Constraint Programming to explain unsatisfiability. Experimental results obtained with our prototype tool IPEG show that, whatever is the underlying constraint solving procedure (IC, Colibri and the SMT solver Z3), this approach can save considerable computational time.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-00699240
Contributor : Arnaud Gotlieb <>
Submitted on : Monday, May 21, 2012 - 11:09:24 AM
Last modification on : Friday, July 10, 2020 - 4:26:07 PM
Long-term archiving on: : Friday, November 30, 2012 - 11:57:10 AM

File

paper2010.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00699240, version 1

Citation

Mickaël Delahaye, Bernard Botella, Arnaud Gotlieb. Explanation-based generalization of infeasible path. 3rd IEEE International Conference on Software Testing, Validation and Verification (ICST'10), Apr 2010, Paris, France. ⟨hal-00699240⟩

Share

Metrics

Record views

449

Files downloads

434