Academic
Publications
Multi-Core LTSmin: Marrying Modularity and Scalability
Multi-Core LTSmin: Marrying Modularity and Scalability   (Citations: 1)
BibTex | RIS | RefWorks Download
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.
Published in 2011.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Now that tree compression reduces the space required for state storage, we observed that the open sets of the parallel reachability algorithm can become a memory bottleneck [15]...
    • ...We measured compression ratios and performance characteristics for the models of the Beem database [19] with three tools: DiVinE 2.2, Spin 5.2.5 and our own model checker LTSmin [3,15]...

    Alfons Laarmanet al. Parallel Recursive State Compression for Free

Order by: