Solving bit-vector equations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1522, Issue , 1998, Pages 36-48

  Oliver Moller M ^a   Rueß, Harald ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; EXTRACTION; FORMAL METHODS;

BIT VECTOR; BITVECTORS; FIXED SIZE; ON DEMANDS; TRANSFORMATION SYSTEMS;

VECTORS;

EID: 84948954122     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (13)

1. 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.
2. 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.
3. D. Cyrluk, P. Lincoln, and N. Shankar. On Shostak's Decision Procedure for Combinations of Theories. In M. A. McRobbie 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.
4. 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.
5. D. Cyrluk, M.O. Möller, and H. Rueß. 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.
6. 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.
7. L. Lipshitz. The Diophantine Problem for Addition and Divisibility. Transactions of the American Mathematical Society, 235:271-283, January 1978.
8. L. Lipshitz. Some Remarks on the Diophantine Problem for Addition and Divisibility. Bull. Soc. Math. Belg. Sér. B, 33(1):41-52, 1981.
9. 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.
10. 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}
11. 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.
12. R.E. Shostak. Deciding Combinations of Theories. Journal of the ACM, 31(1):1-12, January 1984.
13. 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.