Parallelism in processor architecture and design imposes a verification challenge as the exponential growth in the number of execution combinations becomes unwieldy. In this paper we report on the verification of a Very Large Instruction Word processor. The verification team used a sophisticated test program generator that modeled the parallel aspects as sequential constraints, and augmented the tool with manually written test templates. The system created large numbers of legal stimuli, however the quality of the tests was proved insufficient by several post silicon bugs. We analyze this experience and suggest an alternative, parallel generation technique. We show through experiments the feasibility of the new technique and its superior qu...
We study the applicability of the logic of Positive Equality with Uninterpreted Functions (PEUF) [2]...
We report on our experience with a new test generation language for processor verification. The veri...
Software is large, complex, and error-prone. According to the US National Institute of Standards and...
Parallelism in processor architecture and design imposes a verification challenge as the exponential...
Parallelism in processor architecture and design imposes a verification challenge as the exponential...
VLIW processors are attractive for many embedded applications, but VLIW code scheduling, whether by...
Abstract—Customization of a (generic) processor to a partic-ular application makes it possible to ac...
We report on our experience with a new test generation language for processor verification. The veri...
This thesis is about scalable formal verification techniques for software. A verification technique ...
Abstract. The problem of verifying multi-threaded execution against the memory consistency model of ...
The model-checking problem is the question whether a given system model satisfies a property. The pr...
Functional verification is “the” major designphase bottleneck for silicon productivity. Since functi...
technical reportWe offer a solution to the problem of verifying formal memory models of processors b...
In the ever-developing world of technology, more and more situations arise where the life of many pe...
This paper reports on the VerCors tool set for verifying parallel and concurrent software. Its main ...
We study the applicability of the logic of Positive Equality with Uninterpreted Functions (PEUF) [2]...
We report on our experience with a new test generation language for processor verification. The veri...
Software is large, complex, and error-prone. According to the US National Institute of Standards and...
Parallelism in processor architecture and design imposes a verification challenge as the exponential...
Parallelism in processor architecture and design imposes a verification challenge as the exponential...
VLIW processors are attractive for many embedded applications, but VLIW code scheduling, whether by...
Abstract—Customization of a (generic) processor to a partic-ular application makes it possible to ac...
We report on our experience with a new test generation language for processor verification. The veri...
This thesis is about scalable formal verification techniques for software. A verification technique ...
Abstract. The problem of verifying multi-threaded execution against the memory consistency model of ...
The model-checking problem is the question whether a given system model satisfies a property. The pr...
Functional verification is “the” major designphase bottleneck for silicon productivity. Since functi...
technical reportWe offer a solution to the problem of verifying formal memory models of processors b...
In the ever-developing world of technology, more and more situations arise where the life of many pe...
This paper reports on the VerCors tool set for verifying parallel and concurrent software. Its main ...
We study the applicability of the logic of Positive Equality with Uninterpreted Functions (PEUF) [2]...
We report on our experience with a new test generation language for processor verification. The veri...
Software is large, complex, and error-prone. According to the US National Institute of Standards and...