The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interpolants in rational and real linear arithmetic. We focus on subsets of integer linear arithmetic. Our main results are polynomial time algorithms for obtaining interpolants for conjunctions of linear diophantine equations, linear modular equations (linear congruences), and linear diophantine disequations. We show the utility of the proposed interpolation algorithms for discovering modular/divisibility predicates in a counterexample guided abstraction refinement (CEGAR) framework. This has enabled verification of simple programs that cannot be checked using existing CEGAR based model checkers. © 2008 Springer-Verlag.
CITATION STYLE
Jain, H., Clarke, E., & Grumberg, O. (2008). Efficient craig interpolation for linear diophantine (dis)equations and linear modular equations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5123 LNCS, pp. 254–267). Springer Verlag. https://doi.org/10.1007/978-3-540-70545-1_24
Mendeley helps you to discover research relevant for your work.