696 search results - page 17 / 140 » Explaining abstract counterexamples |
113
Voted
CONCUR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Almost 20 years after the original conception, we revisit several fundamental questions about modal transition systems. First, we demonstrate the incompleteness of the st...
133
Voted
CAV
2004
Springer
15 years 6 months ago
2004
Springer
Predicate abstraction has been proved effective for verifying several infinite-state systems. In predicate abstraction, an abstract system is automatinstructed given a set of predi...
119
click to vote
CAV
2006
Springer
15 years 6 months ago
2006
Springer
Previous symbolic software model checkers (i.e., program analysis tools based on predicate abstraction, pushdown model checkiterative counterexample-guided abstraction refinement, ...
106
Voted
FMCAD
2006
Springer
15 years 6 months ago
2006
Springer
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
122
Voted
SPIN
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space ...