Deciding fixed and non-fixed size bit-vectors

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

Volumn 1384, Issue , 1998, Pages 336-392

  Bjørner, Nikolaj S ^a   Pichora, Mark C ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BIT VECTOR; BOOLEAN OPERATIONS; DECISION PROCEDURE; FIXED SIZE; PARAMETERIZED; STANFORD;

ARTIFICIAL INTELLIGENCE;

EID: 84947917511     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054184     Document Type: Conference Paper

References (19)

1. Baader, F., and Siekmann, J. Unification theory. In Handbook of Logic in Artificial Intelligence and Logic Programming, D. Gabbay, C. Hogger, and J. Robinson, Eds. Oxford University Press, Oxford, UK, 1993.
2. Basin, D., and Klarlund, N. Hardware verification using monadic second-order logic. In CAV'95 (1995), vol. 939 of LNCS, pp 31-41.
3. Bjørner, N. S., Browne, A., Chang, E. S., Colón, M., Kapur, A., Manna, Z., Sipma, H. B., and Uribe, T. E. STeP: Deductive-algorithmic verification of reactive and real-time systems. In CAV'96 (1996), vol. 1102 of LNCS, pp 415-418.
4. Bjørner, N. S., Stickel, M. E., and Uribe, T. E. A practical integration of first-order reasoning and decision procedures. In CADE'97 (1997), vol. 1249 of LNCS, pp 101-115.
5. Bratsch, A., Eveking, H., Färber, H.-J., and Schellin, U. LOVERT -A Logic Verifier of Register-Transfer Level Descriptions. In IMEC-IFIP (1989), L. Claesen, Ed., Elsevier.
6. Bryant, R. E. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35, 8 (1986), 677-691.
7. Bryant, R. E., and Chen, Y.-A. Verification of arithmetic circuits with binary moment diagrams. In DAC'95 (1995).
8. Comon, H., Dauchet, M., Gilleron, R., Lugiez, D., Tison, S., and Tom-masi, M. Tree Automata Techniques and Applications. Obtainable from http://13ux02.univ-lille3.fr/tata/, 1998.
9. Cooper, D. C. Theorem proving in arithmetic without multiplication. In Machine Intelligence, vol. 7. American Elsevier, 1972, pp 91-99.
10. Cyrluk, D., Lincoln, P., and Shankar, N. On Shostak's decision procedure for combinations of theories. In CADE'96 (1996), vol. 1104 of LNCS, pp 463-477.
11. Cyrluk, D., Moller, O., and Ruess, H. An efficient decision procedure for the theory of fixed-sized bit-vectors. In CAV'97 (1997), vol. 1254 of LNCS, pp 60-71.
12. Jaffar, J. Minimal and complete word unification. J. ACM 37, 1 (1990), 47-85.
13. Kamerer, J. Bus scheduler verification using STeP. Unpublished report, 1996.
14. Martelli, A., and Montanari, U. An efficient unification algorithm. ACM Trans. Prog. Lang. Sys. 4, 2 (1982), 258-282.
15. Nelson, G., and Oppen, D. C. Simplification by cooperating decision proce­dures. ACM Trans. Prog. Lang. Sys. 1, 2 (1979), 245-257.
16. Niven, I., Zuckerman, H., and Montgomery, H. An Introduction to the Theory of Numbers. John Wiley & Sons, New York, 1991.
17. Shostak, R. E. Deciding combinations of theories. J. ACM 31, 1 (1984), 12.
18. Sipma, H. B., Uribe, T. E., and Manna, Z. Deductive model checking. In CAV'96 (1996), vol. 1102 of LNCS, pp 208-219.
19. Stockmeyer, L. J., and Meyer, A. R. Word problems requiring exponential time. In Proc. Srd ACM Symp. Theory of Comp. (1973), pp 9.