Verifying advanced microarchitectures that support speculation and exceptions

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

Volumn 1855, Issue , 2000, Pages 521-537

  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

COMPUTER ARCHITECTURE; RECORDING INSTRUMENTS;

COMMUTATIVITY; INSTRUCTION FETCH; MICRO ARCHITECTURES; PROGRAM COUNTERS; RE-ORDER BUFFERS; SPECULATIVE EXECUTION;

COMPUTER AIDED ANALYSIS;

EID: 84944407953     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_39     Document Type: Conference Paper

References (16)

1. Sergey Berezin, Armin Biere, Edmund Clarke, and Yunshan Zu. Com- bining symbolic model checking with uninterpreted functions for out-of- order processor verification. In Gopalakrishnan and Windley [GW98], pages 369-386.
2. Randal Bryant, Steven German, and Miroslav Velev. Exploiting positive equality in a logic of equality with uninterpreted functions. In Halbwachs and Peled [HP99], pages 470-482.
3. Byron Cook, John Launchbury, John Matthews, and Dick Kieburtz. Formal verification of explicitly parallel microprocessors. In Pierre and Kropf [PK99], pages 23-36.
4. Ganesh Gopalakrishnan and Phillip Windley, editors. Formal Methods in Computer-Aided Design, FMCAD '98, volume 1522 of Lecture Notes in Computer Science, Palo Alto, CA, USA, November 1998. Springer-Verlag.
5. Ravi Hosabettu, Ganesh Gopalakrishnan, and Mandayam Srivas. A proof of correctness of a processor implementing Tomasulo's algorithm without a reorder buffer. In Pierre and Kropf [PK99], pages 8-22.
6. Ravi Hosabettu. The Completion Functions Approach homepage, 1999. At address http://www.cs.utah.edu/~hosabett/cfa.html.
7. Nicolas Halbwachs and Doron Peled, editors. Computer-Aided Verifi- cation, CAV '99, volume 1633 of Lecture Notes in Computer Science, Trento, Italy, July 1999. Springer-Verlag.
8. Ravi Hosabettu, Mandayam Srivas, and Ganesh Gopalakrishnan. Decom- posing the proof of correctness of pipelined microprocessors. In Hu and Vardi [HV98], pages 122-134.
9. Ravi Hosabettu, Mandayam Srivas, and Ganesh Gopalakrishnan. Proof of correctness of a processor with reorder buffer using the completion functions approach. In Halbwachs and Peled [HP99], pages 47-59.
10. 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 . Springer-Verlag.
11. Robert Jones, Jens Skakkebaek, and David Dill. Reducing manual ab- straction in formal verification of out-of-order execution. In Gopalakris- hnan and Windley [GW98], pages 2-17.
12. Ken McMillan. Verification of an implementation of Tomasulo's algo- rithm 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. Amir Pnueli and Tamarah Arons.: Verification of data-insensitive cir- cuits: An in-order-retirement case study. In Gopalakrishnan and Windley [GW98], pages 351-368.
15. Laurence Pierre and Thomas Kropf, editors. Correct Hardware Design and Verification Method, CHARME '99, volume 1703 of Lecture Notes in Computer Science, Bad Herrenalb, Germany, September 1999. Springer- Verlag.
16. J. Sawada and W.A. Hunt, Jr. Results of the verification of a comples pipelined machine model. In Pierre and Kropf [PK99], pages 313-316.