Proof of Correctness of a Processor with Reorder Buffer Using the Completion Functions Approach
Authors:
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 47-59
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A Proof of Correctness of a Processor Implementing Tomasulo’s Algorithm without a Reorder Buffer1999
- Verification of Data-Insensitive Circuits: An In-Order-Retirement Case Study1998
- Reducing Manual Abstraction in Formal Verification of Out- of- Order Execution1998
- 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
- Formal Methods in Computer-Aided Design1998
- 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