12 search results - page 1 / 3 » Minimizing Counterexample of ACTL Property |
CHARME
2005
Springer
14 years 2 months ago
2005
Springer
SPIN
2004
Springer
14 years 1 months ago
2004
Springer
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
ATVA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
SPIN
2007
Springer
14 years 2 months ago
2007
Springer
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
FORTE
2003
13 years 10 months ago
2003
We present a new, on-the-fly algorithm that given a push-down model representing a sequential program with (recursive) procedure calls and an extended finite-state automaton repr...