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. © 2013 Springer-Verlag.
CITATION STYLE
John, A. K., & Chakraborty, S. (2013). Extending quantifier elimination to linear inequalities on bit-vectors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7795 LNCS, pp. 78–92). https://doi.org/10.1007/978-3-642-36742-7_6
Mendeley helps you to discover research relevant for your work.