Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barnat, J., Ročkai, P.: Shared hash tables in parallel model checking. Elec. Notes in Theor. Comp. Sc. 198(1), 79–91 (2008); Proc. of the 6th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2007)
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)
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)
Blom, S., van de Pol, J., Weber, M.: LTSmin: Distributed and symbolic reachability. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 354–359. Springer, Heidelberg (2010)
Holzmann, G.J., Bošnacki, D.: The design of a multicore extension of the SPIN model checker. IEEE Trans. Softw. Eng. 33(10), 659–674 (2007)
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)
Nguyen, V.Y., Ruys, T.C.: Incremental hashing for spin. In: Havelund, K., Majumdar, R., Palsberg, J. (eds.) SPIN 2008. LNCS, vol. 5156, pp. 232–249. Springer, Heidelberg (2008)
Pelánek, R.: BEEM: Benchmarks for explicit model checkers. In: Bošnački, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595, pp. 263–267. Springer, Heidelberg (2007)
Sanders, P.: Load Balancing Algorithms for Parallel Depth First Search. Ph.D. thesis, University of Karlsruhe (1997)
Zobrist, A.L.: A new hashing method with application for game playing. Tech. Rep. 88, Computer Sciences Department, University of Wisconsin (1969)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laarman, A., van de Pol, J., Weber, M. (2011). Multi-Core LTSmin: Marrying Modularity and Scalability. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds) NASA Formal Methods. NFM 2011. Lecture Notes in Computer Science, vol 6617. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20398-5_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-20398-5_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20397-8
Online ISBN: 978-3-642-20398-5
eBook Packages: Computer ScienceComputer Science (R0)