Design of a proof repository architecture

Authors:
Michael Franssen;Mark van den Brand
Affiliations:
Eindhoven University of Technology, Eindhoven, The Netherlands;Eindhoven University of Technology, Eindhoven, The Netherlands
Venue:
Proceedings of the 1st Workshop on Modules and Libraries for Proof Assistants
Year:
2009

Citing 8
Cited 1

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
MBase: representing knowledge and context for the intergration of mathematical software systems

Journal of Symbolic Computation - Calculemus-99: integrating computation and deduction
Extended static checking for Java

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
PVS: A Prototype Verification System

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Simplify: a theorem prover for program checking

Journal of the ACM (JACM)
Software Refinement with Perfect Developer

SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
The design and implementation of VAMPIRE

AI Communications - CASC
E - a brainiac theorem prover

AI Communications - CASC

Towards a Maude formal environment

Formal modeling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a proof repository architecture to build a library of proofs for first-order theorems constructed by several theorem provers. The architecture is not fixed as such, but is configured by the user. It consists of three types of components, that allow us to connect theorem provers, store proofs and manage the connections between them. These components allow for many setups, like a local database of theorems, an interconnected series of databases of systems, interconnecting many theorem provers, using a theorem prover in a client-server architecture, Software As Service etc.