85 search results - page 6 / 17 » Partial-Order Reduction in Symbolic State Space Exploration |
81
Voted
SPIN
2009
Springer
15 years 4 months ago
2009
Springer
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
88
Voted
CAV
2005
Springer
15 years 3 months ago
2005
Springer
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
81
Voted
EURODAC
1994
IEEE
15 years 2 months ago
1994
IEEE
Symbolic state space exploration techniques for Finite State Machines (FSMs) are a major recent result in CAD for VLSI. Most of them are exact and based on forward traversal, but ...
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper describes a probabilistic approach to state space search. The presented method applies a ranking of the design states according to their probability of reaching a given...
CAV
2005
Springer
15 years 3 months ago
2005
Springer
We consider in the current paper the issue of exploiting the structural form of Esterel programs [BG92] to partition the algorithmic RSS (reachable state space) fix-point construc...