CAV
2006
Springer
14 years 12 days ago
2006
Springer
e Abstraction and Refinement Loop Himanshu Jain1,2, Franjo Ivanci
DATE
2004
IEEE
14 years 12 days ago
2004
IEEE
The analysis of real-time properties of an embedded system usually relies on the worst-case execution times (WCET) of the tasks to be executed. In contrast to that, in real world ...
CAV
2006
Springer
2006
Springer
Playing with Verification, Planning and Aspects: Unusual Methods for Running Scenario-Based Programs
14 years 12 days ago
CAV
2006
Springer
14 years 12 days ago
2006
Springer
Example Guided Abstraction Refinement (CEGAR) [6] framework. A number of wellengineered software model-checkers are available, e.g., SLAM [1] and BLAST [12]. Why build another one?...
DATE
2004
IEEE
14 years 12 days ago
2004
IEEE
Multimedia systems play a central part in many human activities. Due to the significant advances in the VLSI technology, there is an increasing demand for portable multimedia appl...
CAV
2006
Springer
14 years 12 days ago
2006
Springer
We show how to find and fix faults in Boolean programs by extending the program to a game. In the game, the protagonist can select an alternative implementation for an incorrect st...
DATE
2004
IEEE
2004
IEEE
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements
14 years 12 days ago
We show how to automatically verify that complex XScale-like pipelined machine models satisfy the same safety and liveness properties as their corresponding instruction set archit...
CAV
2006
Springer
14 years 12 days ago
2006
Springer
We present lookahead widening, a novel technique for using existing widening and narrowing operators to improve the precision of static analysis. This technique is both self-contai...
DATE
2004
IEEE
14 years 12 days ago
2004
IEEE
Due to process variations in deep sub-micron (DSM) technologies, the effects of timing defects are difficult to capture. This paper presents a novel coverage metric for estimating...
CAV
2006
Springer
14 years 12 days ago
2006
Springer
Abstract. The problem of finding a small unsatisfiable core of an unsatisfiable CNF formula is addressed. The proposed algorithm, Trimmer, iterates over each internal node d in the...