Tinker, tailor, solver, proof

We introduce Tinker, a tool for designing and evaluating proof strategies based on proof-strategy graphs, a formalism previously introduced by the authors. We represent proof strategies as open-graphs, which are directed graphs with additional input/output edges. Tactics appear as nodes in a graph, and can be `piped' together by adding edges between them. Goals are added to the input edges of such a graph, and flow through the graph as the strategy is evaluated. Properties of the edges ensure that only the right `type' of goals are accepted. In this paper, we detail the Tinker tool and show how it can be integrated with two different theorem provers: Isabelle and ProofPower.

[1]  David Delahaye,et al.  A Proof Dedicated Meta-Language , 2002, LFM.

[2]  Aleks Kissinger,et al.  Open-graphs and monoidal theories† , 2010, Mathematical Structures in Computer Science.

[3]  Volker Sorge,et al.  LOmegaUI: Lovely OMEGA User Interface , 1999 .

[4]  Colin O'Halloran Automated verification of code automatically generated from Simulink® , 2012, Automated Software Engineering.

[5]  Gudmund Grov,et al.  A Graphical Language for Proof Strategies , 2013, LPAR.

[6]  Jacques D. Fleuriot,et al.  IsaPlanner: A Prototype Proof Planner in Isabelle , 2003, CADE.

[7]  Alan Bundy,et al.  Rippling - meta-level guidance for mathematical reasoning , 2005, Cambridge tracts in theoretical computer science.

[8]  Maris A. Ozols,et al.  XIsabelle: A System Description , 1997, CADE.

[9]  Richard Bornat,et al.  Jape: A Calculator for Animating Proof-on-Paper , 1997, CADE.

[10]  Helen Lowe,et al.  XBarnacle: Making Theorem Provers More Accessible , 1997, CADE.

[11]  Volker Sorge,et al.  LΩUI: Lovely ΩMEGA User Interface , 1999, Formal Aspects of Computing.

[12]  Rod M. Burstall ProveEasy: helping people learn to do proofs , 2000, Electron. Notes Theor. Comput. Sci..

[13]  Gudmund Grov,et al.  Towards Automated Proof Strategy Generalisation , 2013, ArXiv.