11 search results - page 1 / 3 » Minimal Counterexample Generation for SPIN |
SPIN
2007
Springer
14 years 1 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...
SPIN
2004
Springer
14 years 7 days 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...
SPIN
2012
Springer
11 years 9 months ago
2012
Springer
Since counterexamples generated by model checking tools are only symptoms of faults in the model, a significant amount of manual work is required in order to locate the fault that...
SPIN
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
FORTE
2003
13 years 8 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...