Formal Reasoning Using Distributed Assertions
Open Access
- 13 September 2023
- book chapter
- Published by Springer Nature
- p. 176-194
Abstract
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.Keywords
This publication has 29 references indexed in Scilit:
- Nominal abstractionInformation and Computation, 2011
- Dafny: An Automatic Program Verifier for Functional Correctness2010
- The TPTP Problem Library and Associated InfrastructureJournal of Automated Reasoning, 2009
- Variations in Access Control LogicLecture Notes in Computer Science, 2008
- A proof theory for generic judgmentsACM Transactions on Computational Logic, 2005
- An Evidential Tool BusLecture Notes in Computer Science, 2005
- Mathematical Libraries as Proof Assistant Environments2004
- Nominal logic, a first order theory of names and bindingInformation and Computation, 2003
- The Semantic WebScientific American, 2001
- System Description: Twelf — A Meta-Logical Framework for Deductive Systems1999