CAV
1998
Springer
13 years 11 months ago
1998
Springer
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...
CAV
1998
Springer
13 years 11 months ago
1998
Springer
We present a two-part approach for verifying out-of-order execution. First, the complexity of out-of-order issue and scheduling is handled by creating der abstraction of the out-of...
CAV
1998
Springer
13 years 11 months ago
1998
Springer
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...
CAV
1998
Springer
13 years 11 months ago
1998
Springer
An implementation of an out-of-order processing unit based on Tomasulo's algorithm is formally verified using compositional model checking techniques. This demonstrates that f...
CAV
1998
Springer
13 years 11 months ago
1998
Springer
CAV
1998
Springer
13 years 11 months ago
1998
Springer
We present a systematic approach to decompose and incrementally build the proof of correctness of pipelined microprocessors. The central idea is to construct the abstraction funct...
CAV
1998
Springer
13 years 11 months ago
1998
Springer
It has become good practice to expect authors of new model checking algorithms to provide not only rigorous evidence of the algorithms correctness, but also evidence of their pract...
CAV
1998
Springer
13 years 11 months ago
1998
Springer
Assume-guarantee reasoning has long been advertised as an important method for decomposing proof obligations in system veri cation. Re nement mappings (homomorphisms) have long bee...
CAV
1998
Springer
13 years 11 months ago
1998
Springer
CAV
1998
Springer
13 years 11 months ago
1998
Springer