technical reportWe offer a solution to the problem of verifying formal memory models of processors by combining the strengths of model-checking and a formal testing procedure for parallel machines. We characterize the formal basis for abstracting the tests into test automata and associated memory rule safety properties whose violations pinpoint the ordering rule being violated. Our experimental results on Verilog models of a commercial split transaction bus demonstrates the ability of our method to effectively debug design models during early stages of their development
AbstractIn large component-based systems, the applicability of formal verification techniques to che...
The high complexity of modern hardware and software systems necessitates the use of formal methods f...
The complexity of the instruction set of modern microprocessors often leads to faults in the microin...
technical reportWe offer a solution to the problem of verifying formal memory models of processors b...
technical reportThe need to formally verify hardware and software systems before they are deployed t...
Designs of hardware and software systems have grown in complexity to meet the demand for improved pe...
International audienceIn this paper we report about a case study on the functional verification of a...
Turing Lecture from the winners of the 2007 ACM A.M. Turing Award.In 1981, Edmund M. Clarke and E. A...
The increasing availability of information technology in today’s life is a challenge for users as we...
In microprocessors, achieving an efficient utilization of the execution units is a key factor in imp...
Abstract—Many designs intermingle large memories with wide data paths and nontrivial control. Verify...
With increasing design complexity, verification becomes a more and more important aspect of the desi...
The design of concurrent algorithms tends to be a long and difficult process. Increasing the number ...
Most modern multiprocessors offer weak memory behavior to improve their performance in terms of thro...
In the age of submicron technology a single chip may contain tens or even hundreds of millions trans...
AbstractIn large component-based systems, the applicability of formal verification techniques to che...
The high complexity of modern hardware and software systems necessitates the use of formal methods f...
The complexity of the instruction set of modern microprocessors often leads to faults in the microin...
technical reportWe offer a solution to the problem of verifying formal memory models of processors b...
technical reportThe need to formally verify hardware and software systems before they are deployed t...
Designs of hardware and software systems have grown in complexity to meet the demand for improved pe...
International audienceIn this paper we report about a case study on the functional verification of a...
Turing Lecture from the winners of the 2007 ACM A.M. Turing Award.In 1981, Edmund M. Clarke and E. A...
The increasing availability of information technology in today’s life is a challenge for users as we...
In microprocessors, achieving an efficient utilization of the execution units is a key factor in imp...
Abstract—Many designs intermingle large memories with wide data paths and nontrivial control. Verify...
With increasing design complexity, verification becomes a more and more important aspect of the desi...
The design of concurrent algorithms tends to be a long and difficult process. Increasing the number ...
Most modern multiprocessors offer weak memory behavior to improve their performance in terms of thro...
In the age of submicron technology a single chip may contain tens or even hundreds of millions trans...
AbstractIn large component-based systems, the applicability of formal verification techniques to che...
The high complexity of modern hardware and software systems necessitates the use of formal methods f...
The complexity of the instruction set of modern microprocessors often leads to faults in the microin...