A proof of correctness of a processor implementing Tomasulo’s algorithm without a reorder buffer

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

Volumn 1703, Issue , 1999, Pages 8-22

  Hosabettu, Ravi ^a   Gopalakrishnan, Ganesh ^a   Srivas, Mandayam ^b  

^a UNIVERSITY OF UTAH   (United States)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; DESIGN; RECONFIGURABLE HARDWARE; RECORDING INSTRUMENTS;

ABSTRACTION FUNCTIONS; CASE ANALYSIS; CORRECTNESS CRITERION; DECISION PROCEDURE; PROGRAM ORDER; PROOF OF CORRECTNESS; RE-ORDER BUFFERS; S-ALGORITHMS;

HARDWARE;

EID: 84958594221     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48153-2_3     Document Type: Conference Paper

References (14)

1. T. Arons and A. Pnueli. Verifying Tomasulo’s algorithm by refinement. Technical report, Weizmann Institute, 1998.
2. Sergey Berezin, Armin Biere, Edmund Clarke, and Yunshan Zu. Combining symbolic model checking with uninterpreted functions for out-of-order processor verification. In Ganesh Gopalakrishnan and Phillip Windley, editors, Formal Methods in Computer-Aided Design, FMCAD’98, volume 1522 of Lecture Notes in Computer Science, pages 369–386, Palo Alto, CA, USA, November 1998. Springer-Verlag.
3. Clark Barrett, David Dill, and Jeremy Levitt. Validity checking for combinations of theories with equality. In Mandayam Srivas and Albert Camilleri, editors, Formal Methods in Computer-Aided Design, FMCAD’96, volume 1166 of Lecture Notes in Computer Science, pages 187–201, Palo Alto, CA, November 1996. Springer-Verlag.
4. D. Cyrluk, S. Rajan, N. Shankar, and M. K. Srivas. Effective theorem proving for hardware verification. In Ramayya Kumar and Thomas Kropf, editors, Theorem Provers in Circuit Design, TPCD’94, volume 910 of Lecture Notes in Computer Science, pages 203–222, Bad Herrenalb, Germany, September 1994. Springer-Verlag.
5. C.A.R. Hoare. Proof of correctness of data representations. In Acta Informatica, volume 1, pages 271–281, 1972.
6. Ravi Hosabettu. The Completion Functions Approach homepage, 1999. At address http://www.cs.utah.edu/˜hosabett/cfa.html.
7. John L. Hennessy and David A. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, San Mateo, CA, 1990.
8. Thomas Henzinger, Shaz Qadeer, and Sriram Rajamani. You assume, we guarantee: Methodology and case studies. In Hu and Vardi [HV98], pages 440–451.
9. Ravi Hosabettu, Mandayam Srivas, and Ganesh Gopalakrishnan. Decomposing the proof of correctness of pipelined microprocessors. In Hu and Vardi [HV98], pages 122–134.
10. Ravi Hosabettu, Mandayam Srivas, and Ganesh Gopalakrishnan. Proof of correctness of a processor with reorder buffer using the completion functions approach. 1999. Accepted for publication in the Conference on Computer Aided Verification, Trento, Italy.
11. Alan J. Hu and Moshe Y. Vardi, editors. Computer-Aided Verification, CAV’98, volume 1427 of Lecture Notes in Computer Science, Vancouver, BC, Canada, June/July 1998. Springer-Verlag.
12. Ken McMillan. Verification of an implementation of Tomasulo’s algorithm by compositional model checking. In Hu and Vardi [HV98], pages 110–121.
13. Sam Owre, John Rushby, Natarajan Shankar, and Friedrich von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107–125, February 1995.
14. J. Sawada and W. A. Hunt, Jr. Processor verification with precise exceptions and speculative execution. In Hu and Vardi [HV98], pages 135–146.