Using rewriting rules and positive equality to formally verify wide-issue out-of-order microprocessors with a reorder buffer

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2002, Pages 28-35

  Velev, Miroslav N ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CORRECTNESS CRITERION; MULTIPLE INSTRUCTIONS; ORDERS OF MAGNITUDE; OUT-OF-ORDER PROCESSORS; POSITIVE EQUALITY; RE-ORDER BUFFERS; REGISTER FILES; REWRITING RULES;

CLOCKS; EXHIBITIONS;

RECORDING INSTRUMENTS;

EID: 84893735603     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2002.998246     Document Type: Conference Paper

References (34)

1. T. Arons, and A. Pnueli, "Verifying Tomasulos Algorithm by Refinement " 12th International Conference on VLSI Design (VLSI 99), June 1999, pp. 306-309.
2. T.Arons, and A.Pnueli, "A Comparison of Two Verification Methods for Speculative Instruction Execution," Tools and Algorithms for the Construction and Analysis of Systems (TACAS 00), S. Graf, and M. Schwartzbach, eds., LNCS 1785, Springer-Verlag, March-April 2000, pp. 487-502.
3. S. Berezin, E.M. Clarke, A. Biere, and Y. Zhu, "Verification of Out-Of-Order Processor Designs Using Model Checking and a Light-Weight Completion Function," Journal on Formal Methods in System Design (FMSD), 2001.
4. R.E. Bryant, S. German, and M.N. Velev, "Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic,"3 ACM Transactions on Computational Logic (TOCL), Vol. 2, No. 1 (January 2001).
5. R.E. Bryant, and M.N. Velev, "Boolean Satisfiability with Transitivity Constraints,"3 ACM Transactions on Computational Logic (TOCL), accepted to appear, 2002.
6. J.R. Burch, and D.L. Dill, "Automated Verification of Pipelined Microprocessor Control," Computer-Aided Verification (CAV 94), D.L. Dill, ed., LNCS 818, Springer-Verlag, June 1994, pp. 68-80.
7. K. Diefendorff, "Athlon Outruns Pentium III," Microprocessor Report, Vol. 13, No. 11 (August 23, 1999), pp. 1, 6-11.
8. 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.
9. L. Gwennap, "Alpha 21364 to Ease Memory Bottleneck," Microprocessor Report, Vol. 12, No. 14 (October 26, 1998), pp. 12-15.
10. J.L. Hennessy, and D.A. Patterson, Computer Architecture: A Quantitative Approach, 2nd edition, Morgan Kaufmann Publishers, San Francisco, CA, 1996.
11. T.A. Henzinger, S. Qadeer, and S.K. Rajamani, "You Assume, We Guarantee: Methodology and Case Studies," Computer-Aided Verification (CAV 98), A.J. Hu, and M.Y. Vardi, eds., LNCS 1427, Springer-Verlag, June 1998, pp. 440-451.
12. G. Hinton, D. Sager, M. Upton, D. Boggs, D. Carmean, A. Kyker, and P. Roussel, "The Microarchitecture of the Pentium® 4 Processor,"4 Intel Technology Journal, 1st Quarter, 2001.
13. R. Hosabettu, M. Srivas, and G. Gopalakrishnan, "Proof of Correctness of a Processor with Reorder Buffer Using the Completion Functions Approach," Computer-Aided Verification (CAV 99), N. Halbwachs, and D. Peled, eds., LNCS 1633, Springer-Verlag, July 1999, pp. 45-59.
14. R. Hosabettu, "Systematic Verification of Pipelined Microprocessors," Ph.D. Thesis, Department of Computer Science, University of Utah, August 2000.
15. R. Jhala, and K.L. McMillan, "Microarchitecture Verification by Compositional Model Checking," Computer-Aided Verification (CAV 01), G. Berry, H. Comon, and A. Finkel, eds., LNCS 2102, Springer-Verlag, July 2001, pp. 396-410.
16. R.B. Jones, J.U. Skakkebæk, and D.L. Dill. "Formal Verification of Outof-Order Execution with Incremental Flushing," Journal on Formal Methods in System Design (FMSD), 2001.
17. R.B. Jones, Formal Verification with Symbolic Simulation, Kluwer Academic Publishers, Boston/Dordrecht/London, 2002.
18. D. Kroening, S.M. Mueller, and W.J. Paul, "A Rigorous Correctness Proof of a Tomasulo Scheduler Supporting Precise Interrupts," Systemics, Cybernetics and Informatics (SCI 99), and Information Systems, Analysis and Synthesis (ISAS 99), August 1999.
19. J. Levitt, and K. Olukotun, "Verifying Correct Pipeline Implementation for Microprocessors," International Conference on Computer-Aided Design (ICCAD 97), November 1997, pp. 162-169.
20. J.R. Levitt. "Formal Verification Techniques for Digital Systems," Ph.D. Thesis, Department of Electrical Engineering, Stanford University, December 1998.
21. K.L. McMillan, "A Methodology for Hardware Verification Using Compositional Model Checking," Science of Computer Programming, Vol. 37, No. 1-3 (May 2000), pp. 279-309.
22. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an Efficient SAT Solver," 38th Design Automation Conference (DAC 01), June 2001, pp. 530-535.
23. J. Sawada, "Formal Verification of an Advanced Pipelined Machine," Ph.D. thesis, Department of Computer Science, University of Texas at Austin, December 1999.
24. J. Sawada, and W.A. Hunt, Jr., "Verification of FM9801: Out-of-Order Processor with Speculative Execution and Exceptions That May Execute Self-Modifying Code," Journal on Formal Methods in System Design (FMSD), 2001.
25. J.E. Smith, and A.R. Pleszkun, "Implementing Precise Interrupts in Pipelined Processors," IEEE Transactions on Computers, Vol. 37, No. 5 (May 1988), pp. 562-573.
26. G.S. Sohi, "Instruction Issue Logic for High-Performance, Interruptible, Multiple Functional Unit, Pipelined Computers," IEEE Transactions on Computers, Vol. 39, No. 3 (March 1990), pp. 349-359.
27. M.N. Velev, and R.E. Bryant, "Incorporating Timing Constraints in the Efficient Memory Model for Symbolic Ternary Simulation,"3 International Conference on Computer Design (ICCD 98), October 1998, pp. 400-406.
28. M.N. Velev, and R.E. Bryant, "Superscalar Processor Verification Using Efficient Reductions of the Logic of Equality with Uninterpreted Functions to Propositional Logic,"3 Correct Hardware Design and Verification Methods (CHARME 99), L. Pierre, and T. Kropf, eds., LNCS 1703, Springer-Verlag, September 1999, pp. 37-53.
29. M.N. Velev, and R.E. Bryant, "Formal Verification of Superscalar Microprocessors with Multicycle Functional Units, Exceptions, and Branch Prediction,"3 37th Design Automation Conference (DAC 00), June 2000, pp. 112-117.
30. M.N. Velev, "Formal Verification of VLIW Microprocessors with Speculative Execution,"3 Computer-Aided Verification (CAV 00), E.A. Emerson, and A.P. Sistla, eds., LNCS 1855, Springer-Verlag, July 2000, pp. 86-98.
31. M.N. Velev, "Automatic Abstraction of Memories in the Formal Verification of Superscalar Microprocessors,"3 Tools and Algorithms for the Construction and Analysis of Systems (TACAS 01), T. Margaria, and W. Yi, eds., LNCS 2031, Springer-Verlag, April 2001, pp. 252-267.
32. M.N. Velev, and R.E. Bryant, "Effective Use of Boolean Satisfiability Procedures in the Formal Verification of Superscalar and VLIW Microprocessors," 3 38th Design Automation Conference (DAC 01), June 2001, pp. 226-231.
33. M.N. Velev, and R.E. Bryant, "EVC: A Validity Checker for the Logic of Equality with Uninterpreted Functions and Memories, Exploiting Positive Equality and Conservative Transformations,"3 Computer-Aided Verification (CAV 01), G. Berry, H. Comon, and A. Finkel, eds., LNCS 2102, Springer-Verlag, July 2001, pp. 235-240.
34. L. Zhang, C.F. Madigan, M.W. Moskewicz, and S. Malik, "Efficient Conflict Driven Learning in a Boolean Satisfiability Solver," International Conference on Computer-Aided Design (ICCAD 01), November 2001.