A theory of abstract data types for program development: bridging the gap?
Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT) on Formal Methods and Software, Vol.2: Colloquium on Software Engineering (CSE)
Locales - A Sectioning Concept for Isabelle
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Theory Interpretation in Simple Type Theory
HOA '93 Selected Papers from the First International Workshop on Higher-Order Algebra, Logic, and Term Rewriting
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Flyspeck II: the basic linear programs
Annals of Mathematics and Artificial Intelligence
Partial and Nested Recursive Function Definitions in Higher-order Logic
Journal of Automated Reasoning
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Interpretation of locales in isabelle: theories and proof contexts
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Code generation via higher-order rewrite systems
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
The isabelle collections framework
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Dense Sphere Packings: A Blueprint for Formal Proofs
Dense Sphere Packings: A Blueprint for Formal Proofs
Locales: A Module System for Mathematical Theories
Journal of Automated Reasoning
| Hi-index | 0.00 |
Due to a recent revision of Hales's proof of the Kepler Conjecture, the existing verification of the central graph enumeration procedure had to be revised because it now has to cope with more than 109 graphs. This resulted in a new and modular design. This paper primarily describes the reusable components of the new design: a while combinator for partial functions, a theory of worklist algorithms, a stepwise implementation of a data type of sets over a quasi-order with the help of tries, and a plane graph isomorphism checker. The verification turned out not to be in vain as it uncovered a bug in Hales's graph enumeration code.