Explanation-based generalization of infeasible path - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Explanation-based generalization of infeasible path


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.
Fichier principal
Vignette du fichier
paper2010.pdf (174.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00699240 , version 1 (21-05-2012)


  • HAL Id : hal-00699240 , version 1


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⟩
178 View
260 Download


Gmail Facebook X LinkedIn More