Multi-Core LTSmin: Marrying Modularity and Scalability
The LTSmin toolset provides multiple generation and on-the-fly analysis algorithms for large graphs (state spaces), typically generated from concise behavioral specifications (models) of systems. LTSmin supports a variety of input languages, but its key feature is modularity: language frontends, optimization layers, and algorithmic backends are completely decoupled, without sacrificing performance. To complement our existing symbolic and distributed model checking algorithms, we added a multi-core backend for checking safety properties, with several new features to improve efficiency and memory usage: low-overhead load balancing, incremental hashing and scalable state compression.
Unable to display preview. Download preview PDF.
- 2.Blom, S., van de Pol, J., Weber, M.: Bridging the gap between enumerative and symbolic model checkers. Tech. Rep. TR-CTIT-09-30, Centre for Telematics and Information Technology, University of Twente, Enschede (2009)Google Scholar
- 3.Blom, S., Lisser, B., van de Pol, J., Weber, M.: A database approach to distributed state space generation. In: Sixth Intl. Workshop on Par. and Distr. Methods in verifiCation, PDMC, pp. 17–32. CTIT, Enschede (2007)Google Scholar
- 6.Laarman, A.W., van de Pol, J.C., Weber, M.: Boosting multi-core reachability performance with shared hash tables. In: Sharygina, N., Bloem, R. (eds.) Proceedings of the 10th International Conference on Formal Methods in Computer-Aided Design, Lugano, Swiss. IEEE Computer Society, USA (2010)Google Scholar
- 9.Sanders, P.: Load Balancing Algorithms for Parallel Depth First Search. Ph.D. thesis, University of Karlsruhe (1997)Google Scholar
- 10.Zobrist, A.L.: A new hashing method with application for game playing. Tech. Rep. 88, Computer Sciences Department, University of Wisconsin (1969)Google Scholar