Interactive Simplifier Tracing and Debugging in Isabelle

Hupel, Lars

doi:10.1007/978-3-319-08434-3_24

Cited by 6 publications

(8 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In contrast to our approach, these are built in to the theorem prover and can be used only for programs written in the tactic language, not on programs written in the term language. Isabelle provides specialized support for tracing the simplifier [Hupel 2014]. Mtac provides a primitive for tracing in the form of a print statement.…”

Section: Related Workmentioning

confidence: 99%

A metaprogramming framework for formal verification

Ebner

Ullrich²,

Roesch

et al. 2017

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We describe the metaprogramming framework currently used in Lean, an interactive theorem prover based on dependent type theory. This framework extends Lean's object language with an API to some of Lean's internal structures and procedures, and provides ways of reflecting object-level expressions into the metalanguage. We provide evidence to show that our implementation is performant, and that it provides a convenient and flexible way of writing not only small-scale interactive tactics, but also more substantial kinds of automation.bridge the gap between interactive use and automation. Lean implements a version of the Calculus of Inductive Constructions [Coquand and Huet 1988;Coquand and Paulin 1990], the details of which are described in Section 3. Its elaborator and unification algorithms are designed around the use of type classes, which support algebraic reasoning, programming abstractions, and other generally useful means of expression. Lean also has parallel compilation and checking of proofs, and provides a server mode that supports a continuous compilation and rich user interaction in editing environments such as Emacs and Visual Studio Code. It currently has a conditional term rewriter and several components commonly found in state-of-the-art Satisfiability Modulo Theories (SMT) solvers, such as forward chaining, congruence closure [Nelson and Oppen 1980], handling of associative and commutative operators, and E-matching [Detlefs et al. 2005].In Lean, definitions are compiled to bytecode that can then be evaluated in an efficient virtual machine. This is one sense in which Lean can be viewed as a programming language. (Native compilation is under development.) We obtain a metaprogramming language by exposing an API for procedures implemented natively in Lean's underlying C++ code base, thus taking us outside the axiomatic framework. Within a Lean source file, the keyword meta marks a clear distinction between definitions that make use of such extensions and those that are in the pure object language. Metadefinitions can also call themselves recursively, relaxing the termination restriction imposed by ordinary type theory. Otherwise, definitions and metadefinitions look very much the same, and can be written side-by-side in a Lean source file.There are a number of advantages to this approach. One is that users do not have to learn a new programming language to write metaprograms; they can work with the same constructs and notation used to define ordinary objects in the theorem prover's library. Another advantage is that everything in that library is available for metaprogramming purposes, including integers, lists, datatype constructors, records, and algebraic structures. Finally, metaprograms can be written and debugged in the same interactive environment, making it possible to develop the object library and supporting automation at the same time.A key application for metaprogramming is to implement tactics, which is to say, procedures which facilitate interactive theorem proving by carrying out straightf...

show abstract

Section: Related Workmentioning

confidence: 99%

A metaprogramming framework for formal verification

Ebner

Ullrich²,

Roesch

et al. 2017

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…Moreover, it unfolds only one particular branch of the proof which does not necessarily reflect the underlying proof strategy. Another tool recently developed to support debugging is a reasonably new tracing mechanism for the simp tactic in Isabelle [19]. This is implemented as a plugin for the Isabelle/jEdit Prover IDE.…”

Section: Related Workmentioning

confidence: 99%

The Tinker tool for graphical tactic development

Grov

Lin

2017

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

PSGraph (Grov et al. in LPAR. Springer, Berlin, pp 324-339, 2013) is a graphical language to support the development and maintenance of proof tactics for interactive theorem provers. By using labelled hierarchical graphs this formalisation improves upon analysis and maintenance found in traditional tactic languages. Tool support for PSGraph is achieved by Tinker (Grov et al. in UITP 2014, ENTCS, vol 167. Open Publishing Association, London, pp 23-34, 2014; Lin et al. in Tools and algorithms for the construction and analysis of systems. Springer, Berlin, pp 573-579, 2016): a theorem prover-independent system, which is connected to several different provers, with a graphical user interface including novel features to develop and debug proof tactics graphically. In this paper we provide a detailed and formal account of PSGraph and show how theorem prover independence is achieved by Tinker. We then show practical use of PSGraph and Tinker by developing several proof patterns using the language and tool.

show abstract

“…The Prover IDE takes care to forward the correct version of auxiliary file content to the prover as a blob, but without using the global file-system. 2 This extra file management is particularly relevant for development of Isabelle/HOL itself within the Prover IDE. According to usual practice of LCF-style proof assistants, the main logical environment emerges by alternating theory specifications with ML modules.…”

Section: Auxiliary Files Within the Document-modelmentioning

confidence: 99%

“…This paper is dedicated to some of its newly-introduced PIDE concepts; the extended and updated Isabelle/jEdit manual [10] provides further information for end-users. Isabelle/jEdit in Isabelle2014 also includes a new Simplifier Trace panel with an interactive view of the simplification process; this was contributed by Lars Hupel, see [2].…”

Section: Introductionmentioning

confidence: 99%