Research Output
Developing and Debugging Proof Strategies by Tinkering
  Previously, we have developed a graphical proof strategy language, called PSGraph [4], to support the development and maintenance of large and complex proof tactics for interactive theorem provers. By using labelled hierarchical graphs this formalisation improves upon tactic composition, analysis and maintenance compared with traditional tactic languages. PSGraph has been implemented as the Tinker system, supporting the Isabelle and ProofPower theorem provers [5]. In this paper we present Tinker2, a new version of Tinker, which provides enhancements in user interaction and experience, together with: novel support for controlled inspection; debugging using breakpoints and a logging mechanism; and advanced recording, exporting and reply.

  • Date:

    09 April 2016

  • Publication Status:

    Published

  • Publisher

    Springer

  • DOI:

    10.1007/978-3-662-49674-9_37

  • Cross Ref:

    10.1007/978-3-662-49674-9_37

  • Funders:

    Engineering and Physical Sciences Research Council

Citation

Lin, Y., Le Bras, P., & Grov, G. (2016). Developing and Debugging Proof Strategies by Tinkering. In Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2016 (573-579). https://doi.org/10.1007/978-3-662-49674-9_37

Authors

Monthly Views:

Available Documents