Metraipolis › archive › dc_64d36b047402

Beyond Lemma Sharing -- Novel Parallelization Strategies for Property Directed Reachability — arXiv:2609.05426

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.05426
License (as archived)
CC0-1.0
Archived
2026-10-16T13:07:03.970Z
SHA-256 of the archived text
447b9cf4d8a906412bf5d0c844be6b034aa892e849204a3b6dde53d4a1eaabac
Stable URL of this page
https://metraipolis.com/documento/dc_64d36b047402

How to cite

Beyond Lemma Sharing -- Novel Parallelization Strategies for Property Directed Reachability — arXiv:2609.05426 — arXiv (en), https://arxiv.org/abs/2609.05426 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_64d36b047402 (Metraipolis archive dc_64d36b047402, sha256 447b9cf4d8a906412bf5d0c844be6b034aa892e849204a3b6dde53d4a1eaabac)
BibTeX
@misc{dc64d36b047402,
  title = {Beyond Lemma Sharing -- Novel Parallelization Strategies for Property Directed Reachability — arXiv:2609.05426},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.05426},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_64d36b047402; sha256 447b9cf4d8a906412bf5d0c844be6b034aa892e849204a3b6dde53d4a1eaabac},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05426. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Property Directed Reachability (PDR) is a commonly used technique for automated hardware model checking, yet efficiently parallelizing it remains a significant challenge. Existing approaches, such as lemma sharing, often suffer from limited scalability as processor counts increase. In this work, we present two novel sharing-based parallelization strategies, preemptive propagation and ARPOS, and compare their performance with classical lemma sharing. To this end, we develop an asynchronous MPI-based message passing framework for the state-of-the-art rIC3 hardware model checker. Experimental results on the 2025 Hardware Model Checking competition benchmark demonstrate that our preemptive propagation strategy yields a significant performance boost over classical lemma sharing.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-09 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Logic in Computer Science (cs.LO); Programming Languages (cs.PL).
Pagina del lavoro: https://arxiv.org/abs/2609.05426 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T13:02:21.539Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).