Exploiting positive equality in a logic of equality with uninterpreted functions

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

Volumn 1633, Issue , 1999, Pages 470-482

  Bryant, Randal E ^a   German, Steven ^b   Velev, Miroslav N ^c  

^a Carnegie Mellon University   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; FORMAL LOGIC; PIPELINES;

ASSOCIATED FUNCTIONS; BRANCH INSTRUCTIONS; CORRECTNESS CONDITIONS; LOGIC OF EQUALITIES; PIPELINED PROCESSOR; PROPOSITIONAL LOGIC; PROPOSITIONAL VARIABLES; UNINTERPRETED FUNCTIONS;

COMPUTER CIRCUITS;

EID: 84957091519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48683-6_40     Document Type: Conference Paper

References (10)

1. [Ack54] W. Ackermann, Solvable Cases of the Decision Problem, North-Holland, Am sterdam, 1954.
2. [BBCZ98] S. Berezin, A. Biere, E. M. Clarke, and Y. Zhu, "Combining symbolic model checking with uninterpreted functions for out of order processor verification," Formal Methods in Computer-Aided Design FMCAD '98, G. Gopalakrishnan and P. Windley, eds., LNCS 1522, Springer-Verlag, November, 1998, pp. 187-201.
3. [BGV99] R. E. Bryant, S. German, and M. N. Velev, "Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic," Technical report CMU-CS-99-115, Carnegie Mellon University, 1999. Available as: http://www.cs.cmu.edu/~bryant/pubdir/cmu-cs-99-115.ps.
4. [BD94] J. R. Burch, and D. L. Dill, "Automated verification of pipelined microproces sor control," Computer-Aided Verification CAV '94, D. L. Dill, ed., LNCS 818, Springer-Verlag, June, 1994, pp. 68-80.
5. [DPR98] W. Damm,A. Pnueli, and S. Ruah, "Herbrand automata for hardware verification," 9th International Conference on Concurrency Theory CONCUR '98, Springer-Verlag, September, 1998.
6. [GSZAS98] A. Goel, K. Sajid, H. Zhou, A. Aziz, and V. Singhal, "BDD based procedures for a theory of equality with uninterpreted functions," Computer-Aided Verification CAV '98, A. J. Hu and M.Y. Vardi, eds., LNCS 1427, Springer-Verlag, June, 1998, pp. 244-255.
7. [HKGB97] R. Hojati, A. Kuehlmann, S. German, and R. K. Brayton, "Validity checking in the theory of equality with uinterpreted functions using finite instantiations," Unpublished paper presented at the International Workshop on Logic Synthesis, 1997.
8. [N080] G. Nelson, and D. C. Oppen, "Fast decision procedures based on the congruence closure," J. ACM, Vol. 27, No. 2 (1980), pp. 356-364.
9. [PRSS99] A. Pnueli, Y. Rodeh, O. Shtrichman, and M. Siegel, "Deciding equality formulas by small-domain instantiations," Computer-Aided Verification CAV '99, this proceedings, 1999.
10. [VB98] M. N. Velev, and R.E. Bryant, "Bit-level abstraction in the verification of pipelined microprocessors by correspondence checking." Formal Methods in Computer-Aided Design FMCAD '98, G. Gopalakrishnan and P. Windley, eds., LNCS 1522, Springer-Verlag, November, 1998, pp. 18-35.