Parallel Recursive State Compression for Free (2011)

Title Parallel Recursive State Compression for Free
Author Laarman, Alfons; Pol, van de Jaco; Weber, Michael
Editor Groce, Alex; Musuvathi, Madanlal
Date 2011-07-14
Type Conference object
Publisher Springer
Abstract State space exploration is a basic solution to many verification problems, but is limited by time and memory usage. Due to physical limits in modern CPUs, sequential exploration algorithms do not benefit automatically from the next generation of processors anymore, hence the need for multi-core solutions. This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a tree-based multi-core compression method, which works by leveraging sharing among sub-vectors of state vectors. An algorithmic analysis of both worst-case and optimal compression ratios shows the potential to compress even large states to a small constant on average (8 bytes). Our experiments demonstrate that this holds up in practice: the median compression ratio of 279 measured experiments is within 17% of the optimum for tree compression, and five times better than the median compression ratio of SPIN's COLLAPSE compression. Our algorithms are implemented in the LTSmin tool, and our experiments show that for model checking, multi-core tree compression pays its own way: it comes virtually without overhead compared to the fastest hash table-based methods.
Persistent Identifier URN:NBN:NL:UI:28-77024
Metadata XML
Repository University of Twente

Go to page top
Go back to contents
Go back to site navigation