Iris Project | A Higher-Order Concurrent Separation Logic Framework,
implemented and verified in the Rocq Prover
iris-project.orgIris Project
Recent searches
Search options
#formalverification
2 posts2 participants0 posts today
Can LLMs enable verification in mainstream programming? ~ Aleksandr Shefer et als. https://arxiv.org/abs/2503.14183 #LLMs #Programming #FormalVerification
arXiv.orgCan LLMs Enable Verification in Mainstream Programming?Although formal methods are capable of producing reliable software, they have seen minimal adoption in everyday programming. Automatic code generation using large language models is becoming increasingly widespread, but it rarely considers producing strong correctness guarantees. In this study, we explore the ability of LLMs to produce verified code in three verification languages (Dafny, Nagini, and Verus). To do so, we use manually curated datasets derived from the state-ofthe-art Python benchmark, HumanEval. We also assess what types of information are sufficient to achieve good-quality results.
Revisiting an early critique of formal verification. ~ Lawrence Paulson. https://lawrencecpaulson.github.io/2025/03/14/revisiting_demillo.html #ITP #Math #FormalVerification
lawrencecpaulson.github.ioRevisiting an early critique of formal verification
Can proof assistants verify multi-agent systems? ~ Julian Alfredo Mendez, Timotheus Kampik. https://arxiv.org/abs/2503.06812 #MAS #FormalVerification #LeanProver #Scala
arXiv.orgCan Proof Assistants Verify Multi-Agent Systems?This paper presents the Soda language for verifying multi-agent systems. Soda is a high-level functional and object-oriented language that supports the compilation of its code not only to Scala, a strongly statically typed high-level programming language, but also to Lean, a proof assistant and programming language. Given these capabilities, Soda can implement multi-agent systems, or parts thereof, that can then be integrated into a mainstream software ecosystem on the one hand and formally verified with state-of-the-art tools on the other hand. We provide a brief and informal introduction to Soda and the aforementioned interoperability capabilities, as well as a simple demonstration of how interaction protocols can be designed and verified with Soda. In the course of the demonstration, we highlight challenges with respect to real-world applicability.
AI and the Future of Mathematical Proofs: A New Era of Collaboration and Innovation
As AI continues to evolve, the intersection of mathematics and machine learning is poised to revolutionize how proofs are generated and verified. With the advent of interactive theorem provers and adv...
