Metraipolis › archive › dc_f4a75b756ff1
Synthesizing Proofs Using Proof Sharding and Exploration — arXiv:2609.28535
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.28535
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:01:55.471Z
- SHA-256 of the archived text
8e26db49c2db354f5aa5261b66791142dbb0f2a1b6bbd693b23adf471d537bb4- Stable URL of this page
https://metraipolis.com/documento/dc_f4a75b756ff1
How to cite
Synthesizing Proofs Using Proof Sharding and Exploration — arXiv:2609.28535 — arXiv (en), https://arxiv.org/abs/2609.28535 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f4a75b756ff1 (Metraipolis archive dc_f4a75b756ff1, sha256 8e26db49c2db354f5aa5261b66791142dbb0f2a1b6bbd693b23adf471d537bb4)
BibTeX
@misc{dcf4a75b756ff1,
title = {Synthesizing Proofs Using Proof Sharding and Exploration — arXiv:2609.28535},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.28535},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f4a75b756ff1; sha256 8e26db49c2db354f5aa5261b66791142dbb0f2a1b6bbd693b23adf471d537bb4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.28535. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Distributed systems are hard to implement correctly, and subtle bugs can go undetected using traditional testing. Formal verification offers an alternative for proving the correctness of complex distributed systems. Despite previous efforts to automate and facilitate formal verification, it is still hard to integrate formal verification in software development. Programmers need to query the theorem prover repeatedly to find the correct proof of their system. This cycle of going back and forth with the theorem prover involves a lot of human intervention and is a barrier to adopting formal verification in software development. In this paper, we address the challenges of scaling formal verification in practice by reducing the human intervention required to find the correctness proof of a distributed system. We propose ProofSaX, an automated tool that shards large verification tasks and explores the proof search space for each shard independently to synthesize correctness proofs. We use controlled exploration when adding possible proof annotations to handle the search-space explosion problem. We evaluate ProofSaX on a variety of safety proofs for distributed systems. We show that ProofSaX can find the last proof annotation in 86 out of 103 proof-completion tasks, with runtimes ranging from one minute to two hours. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-25 in cs.SE). Categorie arXiv: Programming Languages (cs.PL) ; Software Engineering (cs.SE). Pagina del lavoro: https://arxiv.org/abs/2609.28535 — 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-08T05:25:51.986Z dalla pagina https://arxiv.org/catchup/cs.SE/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).