Tarmo: A Framework for Parallelized Bounded Model Checking
Siert Wieringa (Helsinki University of Technology TKK), Matti, Niemenmaa (Helsinki University of Technology TKK), Keijo Heljanko (Helsinki, University of Technology TKK)

TL;DR
Tarmo is a flexible parallel framework for Bounded Model Checking that efficiently utilizes shared memory and clusters, supporting full PLTL properties and improving performance over traditional single-threaded methods.
Contribution
We introduce Tarmo, a generic parallel BMC framework compatible with incremental SAT encoding, enabling efficient distributed and shared memory verification for safety and liveness properties.
Findings
Shared memory variants outperform single-threaded approaches.
Framework effectively scales in cluster environments.
Supports full PLTL property checking.
Abstract
This paper investigates approaches to parallelizing Bounded Model Checking (BMC) for shared memory environments as well as for clusters of workstations. We present a generic framework for parallelized BMC named Tarmo. Our framework can be used with any incremental SAT encoding for BMC but for the results in this paper we use only the current state-of-the-art encoding for full PLTL. Using this encoding allows us to check both safety and liveness properties, contrary to an earlier work on distributing BMC that is limited to safety properties only. Despite our focus on BMC after it has been translated to SAT, existing distributed SAT solvers are not well suited for our application. This is because solving a BMC problem is not solving a set of independent SAT instances but rather involves solving multiple related SAT instances, encoded incrementally, where the satisfiability of each…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
