Deductive verification of advanced out-of-order microprocessors

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

Volumn 2725, Issue , 2003, Pages 341-354

  Lahiri, Shuvendu K ^a   Bryant, Randal E ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; RECONFIGURABLE HARDWARE;

AUTOMATIC DECISION PROCEDURES; BRANCH PREDICTION; DEDUCTIVE VERIFICATION; MODELING AND VERIFICATIONS; MODERN PROCESSORS; PROOF OBLIGATIONS; SUPERSCALAR PROCESSOR; UNINTERPRETED FUNCTIONS;

COMPUTER CIRCUITS;

EID: 35248886193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45069-6_33     Document Type: Article

References (15)

1. T. Arons and A. Pnueli. A comparison of two verification methods for speculative instruction execution. In Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS '00), LNCS 1785, 2000.
2. C. Barrett, D. Dill, and J. Levitt. Validity checking for combinations of theories with equality. In Formal Methods in Computer-Aided Design (FMCAD '96), LNCS 1166, November 1996.
3. S. Berezin, A. Biere, E. M. Clarke, and Y. Zhu. Combining symbolic model checking with uninterpreted functions for out of order microprocessor verification. In Formal Methods in Computer-Aided Design(FMCAD '98), LNCS 1522. Springer-Verlag, November 1998.
4. R. S. Boyer and J. Moore. A theorem prover for a computational logic. In 10th Conference on Automated Deduction (CADE '90), 1990.
5. R. E. Bryant, S. German, and M. N. Velev. Processor verification using efficient reductions of the logic of uninterpreted functions to prepositional logic. ACM Transactions on Computational Logic, 2(1):1-41, January 2001.
6. R. E. Bryant, S. K. Lahiri, and S. A. Seshia. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In Proc. Computer-Aided Verification (CAV'02), LNCS 2404, July 2002.
7. J. R. Burch and D. L. Dill. Automated verification of pipelined microprocessor control. In Computer-Aided Verification (CAV '94), LNCS 818, pages 68-80, June 1994.
8. Y. Gurevich. The decision problem for standard classes. The Journal of Symbolic Logic, 41(2):460-464, June 1976.
9. R. Hosabettu, G. Gopalakrishnan, and M. Srivas. Verifying advanced microarchitectures that support speculation and exceptions. In (CAV 2000), LNCS 1855, July 2000.
10. R. Jhala and K. McMillan. Microarchitecture verification by compositional model checking. In Computer-Aided Verification, LNCS 2102, July 2001.
11. S. K. Lahiri, S. A. Seshia, and R. E. Bryant. Modeling and verification of out-of-order microprocessors in UCLID. In Formal Methods in Computer-Aided Design (FMCAD '02), LNCS 2517, pages 142-159. Springer-Verlag, Nov 2002.
12. S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In 11th International Conference on Automated Deduction (CADE), June 1992.
13. J. Sawada and W. Hunt. Processor verification with precise exceptions and speculative execution. In Computer-Aided Verification (CAV '98), LNCS 1427, June 1998.
14. J. U. Skakkaebaek, R. B. Jones, and D. L. Dill. Formal verification of out-of-order execution using incremental flushing. In (CAV '98), LNCS 1427, June 1998.
15. M. N. Velev. Using rewriting rules and positive equality to formally verify wide-issue out-of-order microprocessors with a reorder buffer. In Design, Automation and Test in Europe (DATE '02), pages 28-35, March 2002.