Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching
IEEE Transactions on Software Engineering
An improved protocol reachability analysis technique
Software—Practice & Experience
Heuristic search in restricted memory (research note)
Artificial Intelligence
Efficient memory-bounded search methods
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Formal Methods in System Design
A new scheme for memory-efficient probabilistic verification
IFIP TC6/ 6.1 international conference on formal description techniques IX/protocol specification, testing and verification XVI on Formal description techniques IX : theory, application and tools: theory, application and tools
Model checking
Parallel state space construction for model-checking
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Exploiting Transition Locality in the Disk Based Mur phi Verifier
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
OPEN/CÆSAR: An OPen Software Architecture for Verification, Simulation, and Testing
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for 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
Bounded-memory Algorithms for Verification On-the-fly
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
A Probabilistic Approach to Automatic Verification of Concurrent Systems
APSEC '01 Proceedings of the Eighth Asia-Pacific on Software Engineering Conference
Directed explicit-state model checking in the validation of communication protocols
International Journal on Software Tools for Technology Transfer (STTT)
Distributed state space minimization
International Journal on Software Tools for Technology Transfer (STTT) - Special section on formal methods for industrial critical systems
Journal of the ACM (JACM)
Computer Architecture, Fourth Edition: A Quantitative Approach
Computer Architecture, Fourth Edition: A Quantitative Approach
Properties of state spaces and their applications
International Journal on Software Tools for Technology Transfer (STTT)
Real-Time Model Checking on Secondary Storage
Model Checking and Artificial Intelligence
Survey on Directed Model Checking
Model Checking and Artificial Intelligence
"To store or not to store" reloaded: reclaiming memory on demand
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Distributed analysis with µCRL: a compendium of case studies
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
CADP 2006: a toolbox for the construction and analysis of distributed processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Search-order independent state caching
Transactions on Petri nets and other models of concurrency IV
Large-scale Distributed Verification Using CADP: Beyond Clusters to Grids
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
In the past, several attempts have been made to deal with the state space explosion problem by equipping a depth-first search (Dfs ) algorithm with a state cache, or by avoiding collision detection, thereby keeping the state hash table at a fixed size. Most of these attempts are tailored specifically for Dfs , and are often not guaranteed to terminate and/or to exhaustively visit all the states. In this paper, we propose a general framework of hierarchical caches which can also be used by breadth-first searches (Bfs ). Our method, based on an adequate sampling of Bfs levels during the traversal, guarantees that the Bfs terminates and traverses all transitions of the state space. We define several (static or adaptive) configurations of hierarchical caches and we study experimentally their effectiveness on benchmark examples of state spaces and on several communication protocols, using a generic implementation of the cache framework that we developed within the Cadp toolbox.