A framework for microprocessor correctness statements

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

Volumn 2144, Issue , 2001, Pages 433-448

  Aagaard, Mark D ^a   Cook, Byron ^b   Day, Nancy A ^a   Jones, Robert B ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b Prover Technology   (United States)

^c INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; SPECIFICATIONS;

CLASSICAL APPROACH; INSTRUCTION SET ARCHITECTURE; OUT OF ORDER; STATE MACHINE;

COMPUTER ARCHITECTURE;

EID: 84947229460     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44798-9_33     Document Type: Conference Paper

References (33)

1. M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 2(82):253–284, 1991.
2. T. Arons and A. Pnueli. Verifying Tomasulo’s algorithm by refinement. In Int’l Conference on VLSI Design, pp 92–99, 1999.
3. T. Arons and A. Pnueli. A comparison of two verification methods for speculative instruction execution with exceptions. In TACAS, vol 1785 of LNCS, pp 487–502. Springer, 2000.
4. Arvind and X. Shen. Using term rewriting systems to design and verify processors. IEEE Micro, 19(3):36–46, 1999.
5. D. Beatty and R. Bryant. Formally verifying a microprocessor using a simulation methodology. In DAC, pp 596–602, 1994.
6. S. Berezin, A. Biere, E. Clarke, and Y. Zhu. Combining symbolic model checking with uninterpreted functions for out-of-order processor verification. In FMCAD, vol 1522 of LNCS, pp 369–386. Springer, 1998.
7. J. Burch and D. Dill. Automatic verification of pipelined microprocessor control. In CAV, vol 818 of LNCS, pp 68–80. Springer, 1994.
8. S. Bose and A. Fisher. Verifying pipelined hardware using symbolic logic simulation. In ICCD, pp 217–221, 1989.
9. R. Bryant, S. German, and M. Velev. Processor verification using efficient decision procedures for a logic of uninterpreted functions. In TABLEAUX, vol 1617 of LNAI, pp 1–13. Springer, June 1999.
10. J. Burch. Techniques for verifying superscalar microprocessors. In DAC, pp 552–557, 1996.
11. W. Damm and A. Pnueli. Verifying out-of-order executions. In CHARME, pp 23–47. Chapman and Hall, 1997.
12. A. Fox and N. Harman. An algebraic model of correctness for superscaler microprocessors. In Prospects for Hardware Foundations, vol 1546 of LNCS, pp 138–183. Springer, 1998.
13. R. Hosabettu, G. Gopalakrishnan, and M. Srivas. Verifying advanced microarchitectures that support speculation and exceptions. In CAV, vol 1855 of LNCS, pp 521–537. Springer, 2000.
14. T. Henzinger, S. Qadeer, and S. Rajamani. You assume, we guarantee: Methodology and case studies. In CAV, vol 1427 of LNCS, pp 440–451. Springer, 1998.
15. R. Hosabettu, M. Srivas, and G. Gopalakrishnan. Decomposing the proof of correctness of pipelined microprocessors. In CAV, vol 1427 of LNCS, pp 122–134. Springer, 1998.
16. R. Hosabettu, M. Srivas, and G. Gopalakrishnan. Proof of correctness of a processor with reorder buffer using the completion functions approach. In CAV, vol 1633 of LNCS, pp 47–59. Springer, 1999.
17. R. Jones, J. Skakkebæk, and D. Dill. Reducing manual abstraction in formal verification of out-of-order execution. In FMCAD, vol 1522 of LNCS, pp 2–17. Springer, 1998.
18. P. Manolios. Correctness of pipelined machines. In FMCAD, vol 1954 of LNCS, pp 161–178. Springer, 2000.
19. K. McMillan. Verification of an implementation of Tomasulo’s algorithm by compositional model checking. In CAV, vol 1427 of LNCS, pp 110–121. Springer, 1998.
20. R. Milner. An algebraic definition of simulation between programs. In Proc. Of 2nd Int’l Joint Conf. on Artificial Intelligence, pp 481–489. The British Comp. Soc., 1971.
21. R. Nalumasu and G. Gopalakrishnan. Deriving efficient cache coherence protocols through refinement. In Formal Methods for Parallel Programming: Theory and Applications (FMPPTA’98), 1998.
22. A. Pnueli and T. Arons. Verification of data-insensitive circuits: An in-orderretirement case study. In FMCAD, vol 1522 of LNCS, pp 351–368. Springer, 1998.
23. S. Park and D. Dill. Protocol verification by aggregation of distributed transactions. In CAV, vol 1102 of LNCS, pp 300–310. Springer, 1996.
24. V. Patankar, A. Jain, and R. E. Bryant. Formal verification of anARM processor. In Int’l Conf. on VLSI Design, pp 282–287. IEEE; NewYork, NY, January 1999.
25. S. Qadeer. Algorithms and Methodology for Scalable Model Checking. PhD thesis, Elec. Eng. and Comp. Sci., University of California at Berkeley, 1999.
26. X. Shen and Arvind Amethodology for designing correct cache coherence protocols for DSM systems. Technical Report CSG Memo 398 (A), MIT, June 1997.
27. M. Srivas and M. Bickford. Formal verification of a pipelined microprocessor. IEEE Trans. on Software Engineering, pp 52–64, September 1990.
28. J. Sawada and W. Hunt. Trace table based approach for pipelined microprocessor verification. In CAV, vol 1254 of LNCS, pp 364–375. Springer, 1997.
29. J. Sawada and W. Hunt. Processor verification with precise exceptions and speculative execution. In CAV, vol 1427 of LNCS, pp 135–146. Springer, 1998.
30. J. Sawada and W. Hunt. Results of the verification of a complex pipelined machine model. In CHARME, vol 1703 of LNCS, pp 313–316. Springer, 1999.
31. J. Skakkebæk, R. Jones, and D. Dill. Formal verification of out-of-order execution using incremental flushing. In CAV, vol 1427 of LNCS, pp 98–109. Springer, 1998.
32. M. K. Srivas and S. P. Miller. Applying formal verification to a commercial microprocessor. In CHDL, pp 493–502, August 1995.
33. P. Windley and M. Coe. A correctness model for pipelined microprocessors. In Theorem Provers in Circuit Design, pp 32–51. Springer, 1994.