Recycling Proof Patterns in Coq: Case Studies

01/25/2013
by   Jónathan Heras, et al.
0

Development of Interactive Theorem Provers has led to the creation of big libraries and varied infrastructures for formal proofs. However, despite (or perhaps due to) their sophistication, the re-use of libraries by non-experts or across domains is a challenge. In this paper, we provide detailed case studies and evaluate the machine-learning tool ML4PG built to interactively data-mine the electronic libraries of proofs, and to provide user guidance on the basis of proof patterns found in the existing libraries.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2012

Machine Learning in Proof General: Interfacing Interfaces

We present ML4PG - a machine learning extension for Proof General. It al...
research
03/21/2021

Formal verification of Zagier's one-sentence proof

We comment on two formal proofs of Fermat's sum of two squares theorem, ...
research
07/21/2021

JEFL: Joint Embedding of Formal Proof Libraries

The heterogeneous nature of the logical foundations used in different in...
research
05/10/2020

Dynamic IFC Theorems for Free!

We show that noninterference and transparency, the key soundness theorem...
research
11/22/2017

(Auto)Focus approaches and their applications: A systematic review

Focus, a framework for formal specification and development of interacti...
research
10/02/2020

Proof Repair Across Type Equivalences

We describe a new approach to automatically repairing broken proofs in t...
research
05/05/2020

Experiences from Exporting Major Proof Assistant Libraries

The interoperability of proof assistants and the integration of their li...

Please sign up or login with your details

Forgot password? Click here to reset