85 search results - page 10 / 17 » Partial-Order Reduction in Symbolic State Space Exploration |
SPIN
2009
Springer
15 years 4 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 ...
75
Voted
APN
2007
Springer
15 years 4 months ago
2007
Springer
This paper presents the ComBack method for explicit state space exploration. The ComBack method extends the well-known hash compaction method such that full coverage of the state s...
106
Voted
FMCAD
1998
Springer
15 years 2 months ago
1998
Springer
We present a new approach to the verification of hardware systems with data dependencies using temporal logic symbolic model checking. As a benchmark we take Tomasulo's algori...
107
Voted
FMSD
2007
14 years 10 months ago
2007
Symbolic techniques based on Binary Decision Diagrams (BDDs) are widely employed for reasoning about temporal properties of hardware circuits and synchronous controllers. However, ...
APN
2003
Springer
15 years 3 months ago
2003
Springer
Model checking by exhaustive state space enumeration is one of the most developed analysis methods for distributed event systems. Its main problem—the size of the state spaces—...