Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors
We present an algorithm for existentially quantifying variables from conjunctions of linear modular equalities (LMEs), disequalities (LMDs) and inequalities (LMIs). We use sound but relatively less complete and cheaper heuristics first, and expensive but more complete techniques are used only when required. Our experiments demonstrate that our algorithm outperforms alternative quantifier elimination techniques based on bit-blasting and Omega Test. We also extend this algorithm to work with Boolean combinations of LMEs, LMDs and LMIs.
Unable to display preview. Download preview PDF.
- 2.Bjørner, N., Blass, A., Gurevich, Y., Musuvathi, M.: Modular difference logic is hard. CoRR abs/0811.0987 (2008)Google Scholar
- 3.Kroening, D., Strichman, O.: Decision procedures: an algorithmic point of view. Texts in Theoretical Computer Science. Springer (2008)Google Scholar
- 4.Chaki, S., Gurfinkel, A., Strichman, O.: Decision diagrams for linear arithmetic. In: FMCAD (2009)Google Scholar
- 5.ITC’99 benchmarks, http://www.cad.polito.it/downloads/tools/itc99.html
- 6.CUDD release 2.4.2 website, vlsi.colorado.edu/~fabio/CUDD
- 7.Enderton, H.: A mathematical introduction to logic. Academic Press (2001)Google Scholar
- 8.Pugh, W.: The Omega Test: A fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, 102–114 (1992)Google Scholar
- 13.Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers C-35(8), 677–691 (1986)Google Scholar
- 14.John, A., Chakraborty, S.: Extending quantifier elimination to linear inequalities on bit-vectors, Technical Report TR-12-35, CFDVS, IIT Bombay, http://www.cfdvs.iitb.ac.in/reports/reports/tacas2013_report.pdf