## Refinement Maps for Efficient Verification of Processor Models (2005)

### Cached

### Download Links

- [users.ece.gatech.edu]
- [www.cc.gatech.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | In Design Automation and Test in Europe, DATE’05 |

Citations: | 15 - 5 self |

### BibTeX

@INPROCEEDINGS{Manolios05refinementmaps,

author = {Panagiotis Manolios},

title = {Refinement Maps for Efficient Verification of Processor Models},

booktitle = {In Design Automation and Test in Europe, DATE’05},

year = {2005},

pages = {1304--1309},

publisher = {IEEE Computer Society Press}

}

### OpenURL

### Abstract

While most of the effort in improving verification times for pipeline machine verification has focused on faster decision procedures, we show that the refinement maps used also have a drastic impact on verification times. We introduce a new class of refinement maps for pipelined machine verification, and using the state-of-the-art verification tools UCLID and Siege we show that one can attain several orders of magnitude improvements in verification times over the standard flushing-based refinement maps, even enabling the verification of machines that are too complex to otherwise automatically verify. 1.

### Citations

440 | L.: The Existence of Refinement Mappings
- Abadi, Lamport
- 1991
(Show Context)
Citation Context ...rtially executed instructions are invalidated instead of being flushed, and the programmer visible components are rolled back to correspond to the last committed instruction. We use history variables =-=[1]-=- to simplify the definition of this refinement map. Also, we need an inductive invariant that we call the “Good MA” invariant, which states that the contents of the latches have to be consistent with ... |

264 |
Computer-Aided Reasoning: An Approach
- Kaufmann, Monolios, et al.
- 2000
(Show Context)
Citation Context ...e was first proposed in [9], and is based on WEB-refinement [10]. The first proofs of correctness for pipelined machines based on WEB-refinement were carried out using the ACL2 theorem proving system =-=[6, 7]-=-. The advantage of using a theory of refinement over using the Burch and Dill notion of correctness, even if augmented by a “liveness” criterion, is that deadlock may avoid detection with the Burch an... |

262 | Automatic verification of pipelined microprocessor control
- Burch, Dill
- 1994
(Show Context)
Citation Context ...now selectively review previous work on pipelined machine verification that is directly related to our work. Burch and Dill showed how to automatically compute the abstraction function using flushing =-=[4]-=- and gave a decision procedure for the logic of uninterpreted functions with equality and Boolean connectives. Another, more efficient decision procedure was given in [2]. The work was further extende... |

143 | Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions
- Bryant, Lahiri, et al.
- 2002
(Show Context)
Citation Context ...tudy. Automation is attained by expressing the WEB-refinement proof obligation in the logic of Counter arithmetic with Lambda expressions and Uninterpreted functions (CLU), which is a decidable logic =-=[3]-=-. We use the tool UCLID [8] to transform the CLU formula into a CNF (Conjunctive Normal Form) formula, which we then check with the SAT solver Siege [12]. We now selectively review previous work on pi... |

54 | M.N.: Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions
- Bryant, German, et al.
- 1999
(Show Context)
Citation Context ...ction function using flushing [4] and gave a decision procedure for the logic of uninterpreted functions with equality and Boolean connectives. Another, more efficient decision procedure was given in =-=[2]-=-. The work was further extended in [3], where a decision procedure for the CLU logic that exploits optimized encoding schemes [15] is given. The decision procedure is implemented in UCLID, which has b... |

46 | A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
- Seshia, Lahiri, et al.
- 2003
(Show Context)
Citation Context ...n connectives. Another, more efficient decision procedure was given in [2]. The work was further extended in [3], where a decision procedure for the CLU logic that exploits optimized encoding schemes =-=[15]-=- is given. The decision procedure is implemented in UCLID, which has been used to verify out-of-order microprocessors [8] and which we use to verify the models presented in this paper. The notion of c... |

43 | Modeling and verification of out-of-order microprocessors in UCLID
- Lahiri, Seshia, et al.
- 2002
(Show Context)
Citation Context ...d by expressing the WEB-refinement proof obligation in the logic of Counter arithmetic with Lambda expressions and Uninterpreted functions (CLU), which is a decidable logic [3]. We use the tool UCLID =-=[8]-=- to transform the CLU formula into a CNF (Conjunctive Normal Form) formula, which we then check with the SAT solver Siege [12]. We now selectively review previous work on pipelined machine verificatio... |

39 |
Mechanical Verification of Reactive Systems
- Manolios
- 2001
(Show Context)
Citation Context ...ng. This is accomplished by constructing a WEB-refinement proof, which implies that the pipelined machine satisfies exactly the same CTL ∗ \ X properties satisfied by the instruction set architecture =-=[10]-=-. Thus, we verify both safety and liveness properties of the pipelined machine models we study. Automation is attained by expressing the WEB-refinement proof obligation in the logic of Counter arithme... |

36 | Proof of correctness of a processor with reorder buffer using the completion functions approach
- Hosabettu, Srivas, et al.
- 1999
(Show Context)
Citation Context ...ny other liveness problem) is ruled out. In [11], it is shown how to automatically verify safety and liveness properties of pipelined machines using WEB-refinement. Theorem proving approaches include =-=[13, 14, 5]-=-.sThe paper is organized as follows. In Section 2, we provide an overview of refinement based on WEBs, the theory upon which our correctness proofs depend. In Section 3, we describe the pipelined mach... |

26 | Correctness of Pipelined Machines
- Manolios
- 2000
(Show Context)
Citation Context ... been used to verify out-of-order microprocessors [8] and which we use to verify the models presented in this paper. The notion of correctness for pipelined machines that we use was first proposed in =-=[9]-=-, and is based on WEB-refinement [10]. The first proofs of correctness for pipelined machines based on WEB-refinement were carried out using the ACL2 theorem proving system [6, 7]. The advantage of us... |

21 | Automatic verification of safety and liveness for xscale-like processor models using web refinements
- Manolios, Srinivasan
- 2004
(Show Context)
Citation Context ... is that deadlock may avoid detection with the Burch and Dill approach [9], whereas it follows directly from the WEB-refinement approach that deadlock (or any other liveness problem) is ruled out. In =-=[11]-=-, it is shown how to automatically verify safety and liveness properties of pipelined machines using WEB-refinement. Theorem proving approaches include [13, 14, 5].sThe paper is organized as follows. ... |

21 |
Formal Verification of an Advanced Pipelined Machine
- Sawada
- 1999
(Show Context)
Citation Context ...ny other liveness problem) is ruled out. In [11], it is shown how to automatically verify safety and liveness properties of pipelined machines using WEB-refinement. Theorem proving approaches include =-=[13, 14, 5]-=-.sThe paper is organized as follows. In Section 2, we provide an overview of refinement based on WEBs, the theory upon which our correctness proofs depend. In Section 3, we describe the pipelined mach... |

12 | Verification of a simple pipelined machine model
- Sawada
- 2000
(Show Context)
Citation Context ...ny other liveness problem) is ruled out. In [11], it is shown how to automatically verify safety and liveness properties of pipelined machines using WEB-refinement. Theorem proving approaches include =-=[13, 14, 5]-=-.sThe paper is organized as follows. In Section 2, we provide an overview of refinement based on WEBs, the theory upon which our correctness proofs depend. In Section 3, we describe the pipelined mach... |

11 |
Siege homepage. See URL http://www.cs.sfu.ca/ ∼loryan/personal
- Ryan
(Show Context)
Citation Context ...ted functions (CLU), which is a decidable logic [3]. We use the tool UCLID [8] to transform the CLU formula into a CNF (Conjunctive Normal Form) formula, which we then check with the SAT solver Siege =-=[12]-=-. We now selectively review previous work on pipelined machine verification that is directly related to our work. Burch and Dill showed how to automatically compute the abstraction function using flus... |