A Proof of Correctness of a Processor Implementing Tomasulo’s Algorithm without a Reorder Buffer
Authors:
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 8-22
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Proof of Correctness of a Processor with Reorder Buffer Using the Completion Functions Approach1999
- Verifying Tomasulo's algorithm by refinement1999
- Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification1998
- You assume, we guarantee: Methodology and case studies1998
- Verification of an implementation of Tomasulo's algorithm by compositional model checking1998
- Processor verification with precise exceptions and speculative execution1998
- Decomposing the proof of correctness of pipelined microprocessors1998
- Validity checking for combinations of theories with equality1996
- Formal verification for fault-tolerant architectures: prolegomena to the design of PVSIEEE Transactions on Software Engineering, 1995
- Proof of correctness of data representationsActa Informatica, 1972