Isar
Theorem proving system supporting both interactive proof development and some degree of automation have become quite successful in sizable applications in recent years (e.g. Isabelle/Bali or VerifiCard). Typical examples of this kind of semi-automated reasoning systems include Coq, PVS, HOL, and Isabelle. Despite this success in actually formalizing parts of mathematics and computer science, there are still obstacles in addressing a broad range of people. Paradoxically, none of the existing semi-automated reasoning systems have an adequate primary notion of proof that is amenable to human understanding (for communication, or just maintenance). The Intelligible semi-automated reasoning (Isar) approach to readable formal proof documents sets out to bridge the semantic gap between internal notions of proof given by state-of-the-art interactive theorem proving systems and an appropriate level of abstraction for user-level work. The Isar formal proof language has been designed to satisfy quite contradictory requirements, being both ’declarative’ and immediately ’executable’, by virtue of the Isar/VM interpreter. Compared to existing declarative theorem proving systems (like Mizar), Isar avoids several shortcomings: it is based on a few basic principles only, it is quite independent of the underlying logic, and integrates a broad range of automated proof methods. Interactive proof development is supported directly as well. The Isabelle system offers Isar as an alternative proof language interface layer, beyond traditional tactic scripts. The Isabelle/Isar system provides an interpreter for the Isar formal proof document language. Isabelle/Isar input consists either of proper document constructors, or improper auxiliary commands (for diagnostics, exploration etc.). Proof texts consisting of proper document constructors only admit a purely static reading, thus being intelligible later without requiring dynamic replay that is so typical for traditional proof scripts. Any of the Isabelle/Isar commands may be executed in single-steps, so basically the interpreter has a proof text debugger already built-in. The Isar subsystem is tightly integrated into the Isabelle/Pure meta-logic implementation. Theories, theorems, proof procedures etc. may be used interchangeably between Isabelle-classic proof scripts and Isabelle/Isar documents. Isar is as generic as Isabelle, able to support a wide range of object-logics. The current end-user setup is mainly for Isabelle/HOL. Together with the Isabelle/Isar instantiation of Proof General, a generic (X)Emacs interface for interactive proof assistants, we arrive at a reasonable environment for live proof document editing. Thus proof texts may be developed incrementally by issuing proper document constructors, including forward and backward tracing of partial documents; intermediate states may be inspected by diagnostic commands.
Keywords for this software
References in zbMATH (referenced in 95 articles , 1 standard article )
Showing results 1 to 20 of 95.
Sorted by year (- Maletzky, Alexander; Windsteiger, Wolfgang: The formalization of Vickrey auctions: a comparison of two approaches in Isabelle and Theorema (2017)
- Arthan, Rob: On definitions of constants and types in HOL (2016)
- Bengtson, Jesper; Parrow, Joachim; Weber, Tjark: Psi-calculi in Isabelle (2016)
- Esparza, Javier; Křetínský, Jan; Sickert, Salomon: From LTL to deterministic automata. A safraless compositional approach (2016)
- Naumowicz, Adam; Piliszek, Radosław: Accessing the Mizar library with a weakly strict Mizar parser (2016)
- Grabowski, Adam (ed.); Korniłowicz, Artur (ed.); Naumowicz, Adam (ed.): Four decades of Mizar. Foreword (2015)
- Li, Yongjian; Pang, Jun: Formalizing provable anonymity in Isabelle/HOL (2015)
- Marić, Filip; Petrović, Danijela: Formalizing complex plane geometry (2015)
- Pąk, Karol: Improving legibility of formal proofs based on the close reference principle is NP-hard (2015)
- Stojanović {\Dj}urđević, Sana; Narboux, Julien; Janičić, Predrag: Automated generation of machine verifiable and readable proofs: a case study of Tarski’s geometry (2015)
- Bella, Giampaolo: Inductive study of confidentiality: for everyone (2014) ioport
- Omodeo, Eugenio G.; Tomescu, Alexandru I.: Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (2014)
- Stannett, Mike; Németi, István: Using Isabelle/HOL to verify first-order relativity theory (2014)
- Li, Yongjian; Pang, Jun: An inductive approach to strand spaces (2013)
- Felty, Amy; Momigliano, Alberto: Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax (2012)
- Gonthier, Georges; Tassi, Enrico: A language of patterns for subterm selection (2012)
- Horozal, Fulya; Kohlhase, Michael; Rabe, Florian: Extending MKM formats at the statement level (2012)
- Nipkow, Tobias: Teaching semantics with a proof assistant: no more LSD trip proofs (2012)
- Sonnex, William; Drossopoulou, Sophia; Eisenbach, Susan: Zeno: an automated prover for properties of recursive data structures (2012)
- Wiedijk, Freek: A synthesis of the procedural and declarative styles of interactive theorem proving (2012)