Abstract. A diverse collection of correctness statements have been proposed and used in microprocessor verification efforts. Correctness statements have evolved from criteria that match a single step of the implementation against the specifi-cation to seemingly looser, multi-step, criteria. In this paper, we formally verify conditions under which two categories of multi-step correctness statements log
Computer systems are frequently used in our day to day activities. The failure of these systems in s...
The Completion Functions Approach was proposed in [HSG98] as a systematic way to decompose the proof...
We compare SAT-checkers and decision diagrams on the evaluation of Boolean formulas produced in the...
Developing multithreaded programs has been difficult, especially when dealing with non-deterministic...
MSSP is a new execution paradigm that achieves high performance by removing correctness constraints ...
Abstract. This paper presents status results of a microprocessor verification project. The authors v...
For software development projects with very high correctness requirements (including safety requirem...
We study the applicability of the logic of Positive Equality with Uninterpreted Functions (PEUF) [2]...
Abstract—Microarchitectural refinements are often required to meet performance, area, or timing cons...
We study the applicability of the logic of Positive Equality with Uninterpreted Functions (PEUF) [2...
AbstractWe compare SAT-checkers and decision diagrams on the evaluation of Boolean formulae produced...
Modern processors have relatively simple specificationsbased on their instruction set architectures....
Abstract. The problem of verifying multi-threaded execution against the memory consistency model of ...
AbstractPrimitives are basic means provided by a microkernel to implementors of operating system ser...
Verification of chip multiprocessor memory systems re-mains challenging. While formal methods have b...
Computer systems are frequently used in our day to day activities. The failure of these systems in s...
The Completion Functions Approach was proposed in [HSG98] as a systematic way to decompose the proof...
We compare SAT-checkers and decision diagrams on the evaluation of Boolean formulas produced in the...
Developing multithreaded programs has been difficult, especially when dealing with non-deterministic...
MSSP is a new execution paradigm that achieves high performance by removing correctness constraints ...
Abstract. This paper presents status results of a microprocessor verification project. The authors v...
For software development projects with very high correctness requirements (including safety requirem...
We study the applicability of the logic of Positive Equality with Uninterpreted Functions (PEUF) [2]...
Abstract—Microarchitectural refinements are often required to meet performance, area, or timing cons...
We study the applicability of the logic of Positive Equality with Uninterpreted Functions (PEUF) [2...
AbstractWe compare SAT-checkers and decision diagrams on the evaluation of Boolean formulae produced...
Modern processors have relatively simple specificationsbased on their instruction set architectures....
Abstract. The problem of verifying multi-threaded execution against the memory consistency model of ...
AbstractPrimitives are basic means provided by a microkernel to implementors of operating system ser...
Verification of chip multiprocessor memory systems re-mains challenging. While formal methods have b...
Computer systems are frequently used in our day to day activities. The failure of these systems in s...
The Completion Functions Approach was proposed in [HSG98] as a systematic way to decompose the proof...
We compare SAT-checkers and decision diagrams on the evaluation of Boolean formulas produced in the...