Abstract
Recently, constraint-programming techniques have been used to generate test data and to verify the conformity of a program with its specification. Constraint generated for these tasks may involve integer ranging on all machine-integers, thus, the constraint-based modeling of the program and its specification is a critical issue. In this paper we investigate different models. We show that a straightforward translation of a program and its specification in a system of guarded constraints is ineffective. We outline the key role of Boolean abstractions and explore different search strategies on standard benchmarks. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Collavizza, H., & Rueher, M. (2007). Exploring different constraint-based modelings for program verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4741 LNCS, pp. 49–63). Springer Verlag. https://doi.org/10.1007/978-3-540-74970-7_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
