Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Stubborn set methods for process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Parallel state space construction for model-checking
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Is There a Best Symbolic Cycle-Detection Algorithm?
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Ten Years of Partial Order Reduction
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Parallel State Space Exploration for GSPN Models
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Distributing Timed Model Checking - How the Search Order Matters
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Distributed State Space Generation of Discrete-State Stochastic Models
INFORMS Journal on Computing
From Distributed Memory Cycle Detection to Parallel LTL Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed explicit fair cycle detection: set based approach
SPIN'03 Proceedings of the 10th international conference on Model checking software
Scalable multi-core LTL model-checking
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
Proceedings of the IEEE/ACM international conference on Automated software engineering
Multi-core LTSmin: marrying modularity and scalability
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Boosting multi-core reachability performance with shared hash tables
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Multi-core reachability for timed automata
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
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. Since usage of shared state storage allows for techniques unavailable in distributed memory, these are evaluated, both theoretically and practically, in a prototype implementation. Experimental data is presented to assess practical utility of those techniques, compared to static partitioning of state space, more traditional in distributed memory algorithms.