Metraipolis › archive › dc_bcae7f51cd06
Iris in Lean — arXiv:2609.24252
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.24252
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T22:41:04.452Z
- SHA-256 of the archived text
5000b42587529e3fa9d1bf5c86e3f755c5d2e23a6c036646cd1a245ef9107f67- Stable URL of this page
https://metraipolis.com/documento/dc_bcae7f51cd06
How to cite
Iris in Lean — arXiv:2609.24252 — arXiv (en), https://arxiv.org/abs/2609.24252 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bcae7f51cd06 (Metraipolis archive dc_bcae7f51cd06, sha256 5000b42587529e3fa9d1bf5c86e3f755c5d2e23a6c036646cd1a245ef9107f67)
BibTeX
@misc{dcbcae7f51cd06,
title = {Iris in Lean — arXiv:2609.24252},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.24252},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bcae7f51cd06; sha256 5000b42587529e3fa9d1bf5c86e3f755c5d2e23a6c036646cd1a245ef9107f67},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.24252. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Iris framework for concurrent separation logic has been widely used for program verification research. An important factor contributing to the framework's adoption is its high-quality mechanization in Rocq. This mechanization uses a number of Rocq features in sophisticated ways, including a carefully constructed algebraic hierarchy for modeling separation logic resources, and a proof mode for embedded separation logic proofs, which combines custom Ltac with extensible typeclasses. The library has been developed for over a decade with dozens of contributors, with an emphasis on modularity and maintainability. We explore how Lean features like flexible metaprogramming and quotient types can simplify the design and usage of Iris. Using these features, we provide a novel implementation of the Iris proof mode with improved performance, simplify the handling of equivalences through quotient types, build a variant of Diaframe proof automation, and provide convenience features like automatic construction of Iris fixed points. Building on Lean lets us integrate with the extensive Mathlib library, allowing us to re-use results from this library for program verification tasks that have heavy mathematical dependencies, as we demonstrate with an application to probabilistic program verification. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in cs.LO). Categorie arXiv: Logic in Computer Science (cs.LO) ; Programming Languages (cs.PL). Pagina del lavoro: https://arxiv.org/abs/2609.24252 — 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-09T22:24:26.646Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).