Superlinear Speedup in Parallel State-Space Search
Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science
On-the-Fly Verification of Linear Temporal Logic
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Memory Efficient Algorithms for the Verification of Temporal Properties
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
A Time-Optimal On-the-Fly Parallel Algorithm for Model Checking of Weak LTL Properties
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Distributed explicit fair cycle detection: set based approach
SPIN'03 Proceedings of the 10th international conference on Model checking software
BEEM: benchmarks for explicit model checkers
Proceedings of the 14th international SPIN conference on Model checking software
Scalable shared memory LTL model checking
International Journal on Software Tools for Technology Transfer (STTT) - Special Section on SPIN 07
DiVinE: Parallel Distributed Model Checker
PDMC-HIBI '10 Proceedings of the 2010 Ninth International Workshop on Parallel and Distributed Methods in Verification, and Second International Workshop on High Performance Computational Systems Biology
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
Parallel recursive state compression for free
Proceedings of the 18th international SPIN conference on Model checking software
Multi-core nested depth-first search
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Parallel nested depth-first searches for LTL model checking
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
IEEE Transactions on Software Engineering
A note on on-the-fly verification algorithms
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Designing fast LTL model checking algorithms for many-core GPUs
Journal of Parallel and Distributed Computing
Multi-core reachability for timed automata
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Multi-core emptiness checking of timed Büchi automata using inclusion abstraction
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
SpinS: Extending LTSmin with Promela through SpinJa
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
This paper presents Cndfs, a tight integration of two earlier multi-core nested depth-first search (Ndfs) algorithms for LTL model checking. Cndfs combines the different strengths and avoids some weaknesses of its predecessors. We compare Cndfs to an earlier ad-hoc combination of those two algorithms and show several benefits: It has shorter and simpler code and a simpler correctness proof. It exhibits more robust performance with similar scalability, while at the same time reducing memory requirements. The algorithm has been implemented in the multi-core backend of the LTSmin model checker, which is now benchmarked for the first time on a 48 core machine (previously 16). The experiments demonstrate better scalability than other parallel LTL model checking algorithms, but we also investigate apparent bottlenecks. Finally, we noticed that the multi-core Ndfs algorithms produce shorter counterexamples, surprisingly often shorter than their BFS-based counterparts.