Laarman, A.W. and van de Pol, J.C. and Weber, Michael
Parallel Recursive State Compression for Free.
Technical Report arXiv:1104.3119,
ArXiv, Ithaca, NY.
ISSN not assigned
Full text available as:
Official URL: http://arxiv.org/abs/1104.3119
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.
|Item Type:||Internal Report (Technical Report )|
|Research Group:||EWI-FMT: Formal Methods and Tools|
|Research Program:||CTIT-DSN: Dependable Systems and Networks|
|Research Project:||CEDICT: 3TU Center of Excellence for ICT|
|Uncontrolled Keywords:||model checking, parallel, multi-core, state space compression, tree-based algorithm, incremental algorithm|
|Deposited On:||16 May 2011|
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item