A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Verification of an implementation of Tomasulo's algorithm by compositional model checking
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
An implementation of an out-of-order processing unit based on Tomasulo's algorithm is formally verified using compositional model checking techniques. ...
A proof of Tomasulo's algorithm is outlined, based on refinement maps, and relying on the novel features of the compositional system. ...
Verification by model checking The actual verification of each specification component p is done by symbolic model checking [BCM+92, McM93] . This topic is mainly beyond the scope of this article. ...
doi:10.1007/bfb0028738
fatcat:vs6dw5da6fcwxlzl3qfe7j4sje
Circular Compositional Reasoning about Liveness
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The method is illustrated using Tomasulo's algorithm for out-of-order instruction execution. An implementation is proved live for arbitrary resources using compositional model checking. ...
The apparent circularity of such arguments can be resolved by induction over time. However, previous methods for such circular compositional proofs apply only to safety properties. ...
Verifying a Version of Tomasulo's Algorithm As an example, we now consider how the circular compositional approach can be used to prove liveness of an implementation of Tomasulo's algorithm. ...
doi:10.1007/3-540-48153-2_30
fatcat:b4t4le5bfbhttdj53iw3myg3li
Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a new approach to the verification of hardware systems with data dependencies using temporal logic symbolic model checking. ...
As a benchmark we take Tomasulo's algorithm [HP96] for out-of-order instruction scheduling. Our approach is similar to the idea of uninterpreted function symbols [BD94]. ...
Finally, it is very important to combine our method with compositional approaches like those of McMillan's [McM98] . Figure 1 : 1 A model of an implementation of Tomasulo's Algorithm. ...
doi:10.1007/3-540-49519-3_24
fatcat:u2wt3cs2z5bsvbfecqsq33freq
Verification of Infinite State Systems by Compositional Model Checking
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The method is illustrated by application to an implementation of Tomasulo's algorithm, for arbitrary or infinite word size, register file size, number of reservation stations and number of execution units ...
This supports the verification by model checking of systems with unbounded resources and uninterpreted functions. ...
Introduction Compositional model checking reduces the verification of a large system to a number of smaller verification problems that can be handled by model checking. ...
doi:10.1007/3-540-48153-2_17
fatcat:k23fmaehnrewnjfdjj2t7hpiie
A Proof of Correctness of a Processor Implementing Tomasulo's Algorithm without a Reorder Buffer
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we extend the completion functions approach when this is not true and demonstrate it on an implementation of Tomasulo's algorithm without a reorder buffer. ...
The approach leads to an elegant decomposition of the proof of the correctness criterion, does not involve the construction of an explicit intermediate abstraction, makes heavy use of an automatic case-analysis ...
A model checking based verification of Tomasulo's algorithm is carried out in [McM98] . ...
doi:10.1007/3-540-48153-2_3
fatcat:avmcubpmg5hlvo5m3tamqvv4dm
Model-Checking Speculation-Dependent Security Properties: Abstracting and Reducing Processor Models for Sound and Complete Verification
2019
Electronics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We show preliminary experimental results to support our claim, performing Bounded Model-Checking with a state-of-the-art model checker. ...
Following related formal verification approaches, we simplify the model under consideration by abstraction and refinement steps. ...
McMillan [26] verified Tomasulo's algorithm for out-of-order execution, tackling scalability by compositional model-checking. ...
doi:10.3390/electronics8091057
fatcat:qobprib4lregbdi6fboehguhb4
A methodology for hardware verification using compositional model checking
2000
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Application of the methodology is illustrated using an implementation of Tomasulo's algorithm, a packet bu ering device and a cache coherence protocol as examples. ...
A methodology for system-level hardware veriÿcation based on compositional model checking is described. ...
This is illustrated by the example of adding a re-order bu er to an implementation of Tomasulo's algorithm, while reusing without modiÿcation the original proof. ...
doi:10.1016/s0167-6423(99)00030-1
fatcat:c5ozmapcjrf37bqagxx56hs7iy
Proof of Correctness of a Processor with Reorder Buffer Using the Completion Functions Approach
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we show that this "instruction-centric" view of the completion functions approach leads to an elegant decomposition of the proof for an out-of-order execution processor with a reorder buffer ...
The proof does not involve the construction of an explicit intermediate abstraction, makes heavy use of strategies based on decision procedures and rewriting, and addresses both safety and liveness issues ...
Acknowledgments: We would like to thank Abdel Mokkedem and John Rushby for their feedbacks on the earlier drafts of this paper. ...
doi:10.1007/3-540-48683-6_7
fatcat:4dhys6xqendjtcvqaedpuaxy5m
Proving the Correctness of a Complete Microprocessor
[chapter]
2000
Informatik aktuell
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
The paper describes a formal definition of a "correct" microprocessor. This correctness criterion is proven for an implementation using formal methods. ...
This paper presents status results of a microprocessor verification project. ...
McMillan [7] partly automates the proof by refinement of Tomasulo's algorithm presented in [8] with the help of compositional model checking. ...
doi:10.1007/978-3-642-58322-3_24
dblp:conf/gi/0002K00
fatcat:smalpfclhja3xpng7l4ikozhnm
Word-Level Sequential Memory Abstraction for Model Checking
2008
2008 Formal Methods in Computer-Aided Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
bit-level model checker as a back-end decision procedure, and that our algorithms fit seamlessly into a standard transformational verification paradigm. ...
Verifying such systems is challenging, and users often get little traction when applying model checking to decide full or partial end-to-end correctness of such designs. ...
of Tomasulo's algorithm [12] into refinement checking of several abstract models that each only models a small number of memory slots. ...
doi:10.1109/fmcad.2008.ecp.20
dblp:conf/fmcad/Bjesse08
fatcat:nuvm6s52sjaornq4rosobl4yeq
Deductive Verification of Advanced Out-of-Order Microprocessors
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The paper describes the challenges in modeling and verification with the addition of different design features. ...
This paper demonstrates the modeling and deductive verification of out-of-order microprocessors of varying complexities using a logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions ...
These include the use of symbolic model checking [3] , compositional model checking [10] , deductive verification methods based on theorem proving [1, 9, 13] and symbolic simulation with decision procedures ...
doi:10.1007/978-3-540-45069-6_33
fatcat:wv224c2umrb3zl2qcxkzhbyvy4
Breaking up is hard to do
2008
ACM Transactions on Software Engineering and Methodology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Finite-state verification techniques are often hampered by the state-explosion problem. ...
Using recent advances for automatically generating assumptions, we undertook a study to determine if assume-guarantee reasoning provides an advantage over monolithic verification. ...
Symbolic Model Checking. Kluwer Academic Publishers. MCMILLAN, K. L. 1998. Verification of an implementation of Tomasulo's algorithm by compositional model checking. See Hu and Vardi [1998], 110-121. ...
doi:10.1145/1348250.1348253
fatcat:45j5a42mt5aq3hrlicpbsnzmkq
Algebraic Models of Superscalar Microprocessor Implementations: a Case Study
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
As well as being complex to construct and check, such an initialisation function will consume considerable resources in automated verification attempts because of the need to check State AC (λ( − −− → ...
Instructions can execute out-of-order and are committed in-order. Thornton's algorithm is used to resolve dependencies instead of the more complex Tomasulo's algorithm (Weiss and Smith [1984] ). ...
The topmost reorder buffer entry is committed and an attempt is made to commit the next result. The commit function is bounded by the size of the reorder buffer. ...
doi:10.1007/3-540-49254-2_5
fatcat:g7acpni2nzhtvgifwsrdmc5ft4
Automatic Testing for the Correctness and Equivalence of Loopfree Microprograms
1974
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This representation will account for a composite of features common to a large variety of contemporary machines. ...
In the Appendix are shown two examples of straight line microprograms (for simplicity), to which the developed model is applied. ...
Fig. 24 . 24 Application of output extraction algorithm.
Fig. 28 . 28 Operation of the verification algorithm. ...
doi:10.1109/t-c.1974.224033
fatcat:sul3g3yk4ja5jpvjyio4taaqyq
Optimistic parallelism requires abstractions
2007
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation - PLDI '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
These insights have informed our design of the Galois system, an object-based optimistic parallelization system for irregular applications. ...
libraries, and (3) a runtime scheme for detecting and recovering from potentially unsafe accesses to shared memory made by an optimistic computation. ...
Finally, we would like to thank Tim Harris for being a good shepherd on behalf of the PLDI program committee. ...
doi:10.1145/1250734.1250759
dblp:conf/pldi/KulkarniPWRBC07
fatcat:r3vothk2pfhbbnw43lyeque754
« Previous
Showing results 1 — 15 out of 29 results