Home > Publications
Home University of Twente
Prospective Students
Intranet (internal)

EEMCS EPrints Service

20004 Multi-Core LTSmin: Marrying Modularity and Scalability
Home Policy Brochure Browse Search User Area Contact Help

Laarman, A.W. and van de Pol, J.C. and Weber, Michael (2011) Multi-Core LTSmin: Marrying Modularity and Scalability. In: Proceedings of the Third International Symposium on NASA Formal Methods, NFM 2011, 18-20 Apr 2011, Pasadena, CA, USA. pp. 506-511. Lecture Notes in Computer Science 6617. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-20397-8

Full text available as:


208 Kb
Open Access

Official URL:

Exported to Metis


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.

Item Type:Conference or Workshop Paper (Full Paper, Talk)
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, multi-core, parallel, compression, tree-based algorithm, incremental hashing
ID Code:20004
Deposited On:11 May 2011
More Information:statisticsmetis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item