Sciweavers

VMCAI
2007
Springer

Constraint Solving for Interpolation

13 years 9 months ago
Constraint Solving for Interpolation
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good’ and ‘bad’ states. The existing algorithms for interpolant generation are proof-based: They require explicit construction of proofs, from which interpolants can be computed. Construction of such proofs is a difficult task. We propose an algorithm for the generation of interpolants for the combined theory of linear arithmetic and uninterpreted function symbols that does not require a priori constructed proofs to derive interpolants. It uses a reduction of the problem to constraint solving in linear arithmetic, which allows application of existing highly optimized Linear Programming solvers in black-box fashion. We provide experimental evidence of the practical applicability of our algorithm.
Andrey Rybalchenko, Viorica Sofronie-Stokkermans
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where VMCAI
Authors Andrey Rybalchenko, Viorica Sofronie-Stokkermans
Comments (0)