Английская Википедия:Isabelle (proof assistant)
Шаблон:Short description Шаблон:Infobox software
The IsabelleШаблон:Efn automated theorem prover is a higher-order logic (HOL) theorem prover, written in Standard ML and Scala. As an LCF-style theorem prover, it is based on a small logical core (kernel) to increase the trustworthiness of proofs without requiring Шаблон:Emdash yet supporting Шаблон:Emdash explicit proof objects.
Isabelle is available inside a flexible system framework allowing for logically safe extensions, which comprise both theories as well as implementations for code-generation, documentation, and specific support for a variety of formal methods. It can be seen as an IDE for formal methods. In recent years, a substantial number of theories and system extensions have been collected in the Isabelle Archive of Formal Proofs (Isabelle AFP)[1]
Isabelle was named by Lawrence Paulson after Gérard Huet's daughter.[2]
The Isabelle theorem prover is free software, released under the revised BSD license.
Features
Isabelle is generic: it provides a meta-logic (a weak type theory), which is used to encode object logics like first-order logic (FOL), higher-order logic (HOL) or Zermelo–Fraenkel set theory (ZFC). The most widely used object logic is Isabelle/HOL, although significant set theory developments were completed in Isabelle/ZF. Isabelle's main proof method is a higher-order version of resolution, based on higher-order unification.
Though interactive, Isabelle features efficient automatic reasoning tools, such as a term rewriting engine and a tableaux prover, various decision procedures, and, through the Sledgehammer proof-automation interface, external satisfiability modulo theories (SMT) solvers (including CVC4) and resolution-based automated theorem provers (ATPs), including E, SPASS, and Vampire (the MetisШаблон:Efn proof method reconstructs resolution proofs generated by these ATPs).[3] It also features two model finders (counterexample generators): Nitpick[4] and Nunchaku.[5]
Isabelle features locales which are modules that structure large proofs. A locale fixes types, constants, and assumptions within a specified scope[4] so that they do not have to be repeated for every lemma.
Isar ("intelligible semi-automated reasoning") is Isabelle's formal proof language. It is inspired by the Mizar system.[4]
Example proof
Isabelle allows proofs to be written in two different styles, the procedural and the declarative. Procedural proofs specify a series of tactics (theorem proving functions/procedures) to apply. While reflecting the procedure that a human mathematician might apply to proving a result, they are typically hard to read as they do not describe the outcome of these steps. Declarative proofs (supported by Isabelle's proof language, Isar), on the other hand, specify the actual mathematical operations to be performed, and are therefore more easily read and checked by humans.
The procedural style has been deprecated in recent versions of Isabelle.Шаблон:Citation needed
For example, a declarative proof by contradiction in Isar that the square root of two is not rational can be written as follows.
theorem sqrt2_not_rational: Шаблон:Olive proof let ?x = Шаблон:Olive Шаблон:Blue Шаблон:Olive then Шаблон:Blue m n :: nat Шаблон:Green sqrt_rat: Шаблон:Olive Шаблон:Green lowest_terms: Шаблон:Olive by (rule Rats_abs_nat_div_natE) hence Шаблон:Olive by (auto simp add: power2_eq_square) hence eq: Шаблон:Olive using of_nat_eq_iff power2_eq_square by fastforce hence Шаблон:Olive by simp hence Шаблон:Olive by simp have Шаблон:Olive proof - from Шаблон:Olive Шаблон:Blue k Шаблон:Green "m = 2 * k" .. with eq have Шаблон:Olive by simp hence Шаблон:Olive by simp Шаблон:Blue Шаблон:Olive by simp qed with Шаблон:Olive have Шаблон:Olive by (rule gcd_greatest) with lowest_terms have Шаблон:Olive by simp Шаблон:Blue False using odd_one by blast qed
Applications
Isabelle has been used to aid formal methods for the specification, development and verification of software and hardware systems.
Isabelle has been used to formalize numerous theorems from mathematics and computer science, like Gödel's completeness theorem, Gödel's theorem about the consistency of the axiom of choice, the prime number theorem, correctness of security protocols, and properties of programming language semantics. Many of the formal proofs are, as mentioned, maintained in the Archive of Formal Proofs, which contains (as of 2019) at least 500 articles with over 2 million lines of proof in total.[6]
- In 2009, the L4.verified project at NICTA produced the first formal proof of functional correctness of a general-purpose operating system kernel:[7] the seL4 (secure embedded L4) microkernel. The proof is constructed and checked in Isabelle/HOL and comprises over 200,000 lines of proof script to verify 7,500 lines of C. The verification covers code, design, and implementation, and the main theorem states that the C code correctly implements the formal specification of the kernel. The proof uncovered 144 bugs in an early version of the C code of the seL4 kernel, and about 150 issues in each of design and specification.
- The definition of the programming language Lightweight Java was proven type-sound in Isabelle.[8]
Larry Paulson keeps a list of research projects that use Isabelle.[9]
Alternatives
Several languages and systems provide similar functionality:
- Agda, written in Haskell
- Coq, written in OCaml
- Lean, written in C++
- LEGO, written in Standard ML of New Jersey
- Mizar system, written in Free Pascal
- Metamath, written in ANSI C
- Prover9, written in C, with a GUI written in Python
- Twelf, written in Standard ML
Notes
References
Further reading
- Lawrence C. Paulson, "The Foundation of a Generic Theorem Prover", Journal of Automated Reasoning, Volume 5, Issue 3 (September 1989), pages: 363–397, Шаблон:Issn.
- Lawrence C. Paulson and Tobias Nipkow, "Isabelle Tutorial and User's Manual", 1990.
- M. A. Ozols, K. A. Eastaughffe, and A. Cant, "DOVE: A Tool for Design Oriented Verification and Evaluation", Proceedings of AMAST 97, M. Johnson, editor, Sydney, Australia. Lecture Notes in Computer Science (LNCS) Vol. 1349, Springer Verlag, 1997.
- Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel, "Isabelle/HOL – A Proof Assistant for Higher-Order Logic", 2020.
External links
- ↑ Шаблон:Cite web
- ↑ Шаблон:Cite web
- ↑ Jasmin Christian Blanchette, Lukas Bulwahn, Tobias Nipkow, "Automatic Proof and Disproof in Isabelle/HOL", in: Cesare Tinelli, Viorica Sofronie-Stokkermans (eds.), International Symposium on Frontiers of Combining Systems – FroCoS 2011, Springer, 2011.
- ↑ 4,0 4,1 4,2 Jasmin Christian Blanchette, Mathias Fleury, Peter Lammich & Christoph Weidenbach, "A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality", Journal of Automated Reasoning 61:333–365 (2018).
- ↑ Andrew Reynolds, Jasmin Christian Blanchette, Simon Cruanes, Cesare Tinelli, "Model Finding for Recursive Functions in SMT", in: Nicola Olivetti, Ashish Tiwari (eds.), 8th International Joint Conference on Automated Reasoning, Springer, 2016.
- ↑ Шаблон:Cite web
- ↑ Шаблон:Cite conference
- ↑ Шаблон:Cite journal
- ↑ Шаблон:Cite web
