Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching
IEEE Transactions on Software Engineering
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
A Sweep-Line Method for State Space Exploration
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Exploiting Transition Locality in Automatic Verification
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
On-Line Model Checking for Finite Linear Temporal Logic Specifications
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
A Generalised Sweep-Line Method for Safety Properties
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Bounded-memory Algorithms for Verification On-the-fly
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Parallelizing the Murphi Verifier
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Directed explicit-state model checking in the validation of communication protocols
International Journal on Software Tools for Technology Transfer (STTT)
Hierarchical Adaptive State Space Caching Based on Level Sampling
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
ASAP: An Extensible Platform for State Space Analysis
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Coloured Petri Nets: Modelling and Validation of Concurrent Systems
Coloured Petri Nets: Modelling and Validation of Concurrent Systems
The ComBack method: extending hash compaction with backtracking
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
BEEM: benchmarks for explicit model checkers
Proceedings of the 14th international SPIN conference on Model checking software
DiVinE: a tool for distributed verification
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Time-Efficient model checking with magnetic disk
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Memory efficient state space storage in explicit software model checking
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Partial-Order reduction for general state exploring algorithms
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
On commutativity based edge lean search
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hybrid on-the-fly LTL model checking with the sweep-line method
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
A Sweep-Line Method for Büchi Automata-based Model Checking
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.01 |
State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search to ensure termination. We propose and experimentally evaluate an extension of the state caching method for general state exploring algorithms that are independent of the search order (i.e., search algorithms that partition the state space into closed (visited) states, open (to visit) states and unmet states).