Improved Multi-Core Nested Depth-First Search

Share/Save/Bookmark

Evangelista, Sami and Laarman, Alfons and Petrucci, Laure and Pol, Jaco van de (2012) Improved Multi-Core Nested Depth-First Search. In: 10th International Symposium on Automated Technology for Verification and Analysis, ATVA 2012, 3-6 October 2012, Thiruvananthapuram (Trivandrum), Kerala.

open access
[img]
Preview
PDF
342kB
Abstract: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 stable performance and 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.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/80818
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page