Solving Bit-Vector Equations
This paper is concerned with solving equations on fixed and non-fixed size bit-vector terms. We define an equational transformation system for solving equations on terms where all sizes of bit-vectors and extraction positions are known. This transformation system suggests a generalization for dealing with bit-vectors of unknown size and unknown extraction positions. Both solvers adhere to the principle of splitting bitvectors only on demand, thereby making them quite effective in practice.
KeywordsDecision Procedure Transformation System Extraction Position Integer Constraint Word Equation
Unable to display preview. Download preview PDF.
- BDL98.C.W. Barrett, D.L. Dill, and J.R. Levitt. A Decision Procedure for Bit-Vector Arithmetic. In Proceedings of the 35th Design Automation Conference, June 1998. San Francisco, CA.Google Scholar
- BP98.N.S. BjØrner and M.C. Pichora. Deciding Fixed and Non-Fixed Size Bit-Vectors. volume 1384 of Lecture Notes in Computer Science LNCS, pages 376–392, Heidelberg-New York-Berlin, April 1998. Springer.Google Scholar
- CLS96.D. Cyrluk, P. Lincoln, and N. Shankar. On Shostak’s Decision Procedure for Combinations of Theories. In A. cRobbie and J. K. Slaney, editors, Proceedings of the Thirteenth International Conference on Automated Deduction (CADE-96), volume 1104 of LNAI, pages 463–477, Berlin;Heidelberg;New York, 1996. Springer.Google Scholar
- CMR96.D. Cyrluk, M.O. Möller, and H. Rue\ An Efficient Decision Procedure for a Theory of Fixed-Size Bitvectors with Composition and Extraction. Ulmer Informatik-Berichte 96-08, FakultÄt für Informatik, UniversitÄt Ulm, 1996.Google Scholar
- CMR97.D. Cyrluk, M.O. Möller, and H. Rueff. An Efficient Decision Procedure for the Theory of Fixed-Sized Bit-Vectors. In O. Grumberg, editor, Computer Aided Verification. 9th International Conference (CAV97). Haifa, Israel, June 22–25, 1997: Proceedings, volume 1254 of Lecture Notes in Computer Science LNCS, pages 60–71, Berlin-Heidelberg-New York, 1997. Springer.Google Scholar
- DMV95.A. Degtyarev, Yu. Matiyasevich, and A. Voronkov. Simultaneous Rigid E-Unification is not so Simple. UPMAIL Technical Report 104, Uppsala University, Computing Science Department, 1995.Google Scholar
- Lip78.L. Lipshitz. The Diophantine Problem for Addition and Divisibility. Transactions of the American Mathematical Society, 235:271–283, January 1978.Google Scholar
- Mak92.G. S. Makanin. Investigations on equations in a free group. In K.U. Schulz, editor, Proceedings of Word Equations and Related Topics (IWWERT’ 90), volume 572 of LNCS, pages 1–11, Berlin;Heidelberg;New York, 1992. Springer.Google Scholar
- Möl98.M.O. Möller. Solving Bit-Vector Equations A Decision Procedure for Hardware Verification, 1998. Diploma Thesis, available from http://www.informatik.uni-ulm.de/~ki,Bitvector
- PR98.W. Plandowski and W. Rytter. Application of Lempel-Ziv Encodings to the Solution of Words Equations. In Proceedings of the 25th International Colloquium on Automata, Languages and Programming, ICALP’98, pages 731–742, July 1998. Aalborg, Denmark.Google Scholar
- Sho84.R.E. Shostak. Deciding Combinations of Theories. Journal of the ACM, 31(1):1–12, January 1984.Google Scholar
- SM95.M.K. Srivas and S.P. Miller. Formal Verification of the AAMP5 Microprocessor. In M.G. Hinchey and J.P. Bowen, editors, Applications of Formal Methods, International Series in Computer Science, chapter 7, pages 125–180. Prentice Hall, Hemel Hempstead, UK, 1995.Google Scholar