CAV
2006
Springer
13 years 8 months ago
2006
Springer
niques for Fast Predicate Abstraction Shuvendu K. Lahiri , Robert Nieuwenhuis , and Albert Oliveras Abstract. Predicate abstraction is a technique for automatically exfinite-state ...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
We present an approach for applying symmetry reduction techniques to probabilistic model checking, a formal verification method for the quantitative analysis of systems with stocha...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for system synthesis, litt...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
CAV
2006
Springer
13 years 8 months ago
2006
Springer
e Abstraction and Refinement Loop Himanshu Jain1,2, Franjo Ivanci
CAV
2006
Springer
2006
Springer
Playing with Verification, Planning and Aspects: Unusual Methods for Running Scenario-Based Programs
13 years 8 months ago
CAV
2006
Springer
13 years 8 months 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?...
CAV
2006
Springer
13 years 8 months 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...
CAV
2006
Springer
13 years 8 months 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...
CAV
2006
Springer
13 years 8 months 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...