52 search results - page 2 / 11 » Explicit State Model Checking with Hopper |
SPIN
2005
Springer
13 years 11 months ago
2005
Springer
CAV
2005
Springer
13 years 11 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 ...
ATVA
2011
Springer
12 years 5 months ago
2011
Springer
We present the Self-Loop Aggregation Product (SLAP), a new hybrid technique that replaces the synchronized product used in the automata-theoretic approach for LTL model checking. T...
STTT
2008
13 years 5 months ago
2008
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
ENTCS
2008
13 years 4 months ago
2008
In light of recent shift towards shared-memory systems in parallel explicit model checking, we explore relative advantages and disadvantages of shared versus private hash tables. ...