The foundation of a generic theorem prover
Journal of Automated Reasoning
The Development Graph Manager MAYA
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Type Classes and Overloading in Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Locales - A Sectioning Concept for Isabelle
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Management of Change in Structured Verification
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Structured induction proofs in isabelle/isar
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
A Mechanized Proof of the Basic Perturbation Lemma
Journal of Automated Reasoning
Context Aware Calculation and Deduction
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Logic-Free Reasoning in Isabelle/Isar
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
The Verisoft Approach to Systems Verification
VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Journal of Automated Reasoning
Local Theory Specifications in Isabelle/Isar
Types for Proofs and Programs
Let's Get Physical: Models and Methods for Real-World Security Protocols
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
State Spaces --- The Locale Way
Electronic Notes in Theoretical Computer Science (ENTCS)
A unified framework and a transparent name-space for the Coq module system
Proceedings of the 1st Workshop on Modules and Libraries for Proof Assistants
Constructive type classes in Isabelle
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Journal of Automated Reasoning
An approach for machine-assisted verification of Timed CSP specifications
Innovations in Systems and Software Engineering
Change management for heterogeneous development graphs
Verification, induction termination analysis
Change management for heterogeneous development graphs
Verification, induction termination analysis
Verified synthesis of knowledge-based programs in finite synchronous environments
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Animating the formalised semantics of a Java-like language
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Verified efficient enumeration of plane graphs modulo isomorphism
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
The isabelle collections framework
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Verified decision procedures for MSO on words based on derivatives of regular expressions
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Locales: A Module System for Mathematical Theories
Journal of Automated Reasoning
Efficient construction of machine-checked symbolic protocol security proofs
Journal of Computer Security
| Hi-index | 0.00 |
The generic proof assistant Isabelle provides a landscape of specification contexts that is considerably richer than that of most other provers. Theories are the level of specification where object-logics are axiomatised. Isabelle's proof language Isar enables local exploration in contexts generated in the course of natural deduction proofs. Finally, locales, which may be seen as detached proof contexts, offer an intermediate level of specification geared towards reuse. All three kinds of contexts are structured, to different extents. We analyse the “topology” of Isabelle's landscape of specification contexts, by means of development graphs, in order to establish what kinds of reuse are possible.