Formal Reasoning using Distributed Assertions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Formal Reasoning using Distributed Assertions


When a proof system checks a formal proof, we can say that its kernel asserts that the formula is a theorem in a particular logic. We describe a general framework in which such assertions can be made globally available so that any other proof assistant willing to trust the assertion's creator can use that assertion without rechecking any associated formal proof. This framework, called DAMF, is heterogeneous and allows each participant to decide which tools and operators they are willing to trust in order to accept external assertions. This framework can also be integrated into existing proof systems by making minor changes to the input and output subsystems of the prover. DAMF achieves a high level of distributivity using such off-the-shelf technologies as IPFS, IPLD, and public key cryptography. We illustrate the framework by describing an implemented tool for validating and publishing assertion objects and a modified version of the Abella theorem prover that can use and publish such assertions.
Fichier principal
Vignette du fichier
damf.pdf (398 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04167922 , version 1 (21-07-2023)
hal-04167922 , version 2 (23-07-2023)




  • HAL Id : hal-04167922 , version 2


Farah Al Wardani, Kaustuv Chaudhuri, Dale Miller. Formal Reasoning using Distributed Assertions. FroCoS 2023 - 14th International Symposium on Frontiers of Combining Systems, Sep 2023, Prague (Czech Republic), Czech Republic. ⟨hal-04167922v2⟩
162 View
23 Download


Gmail Facebook Twitter LinkedIn More