|
3
|
Formalizing Plane Graph Theory -- Towards a Formalized Proof of the Kepler Conjecture
– Gertrud Josefine Bauer
- 2006
|
|
5
|
Bounds for local density of sphere packings and the Kepler conjecture, Discrete Comput
– Jeffrey C. Lagarias
|
|
4
|
A proof of the dodecahedral conjecture
– Thomas C. Hales, Sean Mclaughlin
- 1998
|
|
2
|
Flyspeck in a Semantic Wiki Collaborating on a Large Scale Formalization of the Kepler Conjecture
– Christoph Lange, Sean Mclaughlin, Florian Rabe
|
|
78
|
A proof of the Kepler conjecture
– Thomas C. Hales
- 1994
|
|
|
Verification formelle pour . . .
– Ioana Pasca
|
|
12
|
Computer Assisted Proof of Optimal Approximability Results
– Uri Zwick
- 2002
|
|
3
|
Proof Assistants: history, ideas and future
– H. Geuvers, Gl Nijmegen
|
|
2
|
An interpretation of isabelle/hol in hol light
– Sean Mclaughlin
|
|
|
α Code generation from Isabelle/HOL theories
– Florian Haftmann
|
|
|
A Solution to the PoplMark Challenge in Isabelle/HOL
– Stefan Berghofer, Technische Universität München
|
|
|
for Higher-Order Procedural Variables
– Tristan Crolard, Emmanuel Polonowski, T. Crolard, E. Polonowski
- 2009
|
|
6
|
Proof synthesis and reflection for linear arithmetic. Submitted
– Amine Chaieb, Tobias Nipkow, Technische Universität München
- 2006
|
|
7
|
Verifying mixed real-integer quantifier elimination
– Amine Chaieb
- 2006
|
|
17
|
Certifying machine code safety: Shallow versus deep embedding
– Martin Wildmoser, Tobias Nipkow, Technische Universität München
- 2004
|
|
12
|
Verified Bytecode Subroutines
– G. Klein, M. Wildmoser
- 2003
|
|
6
|
Structure of a proof-producing compiler for a subset of higher order logic
– Guodong Li, Scott Owens, Konrad Slind
- 2007
|
|
10
|
Verifying and reflecting quantifier elimination for Presburger arithmetic
– Amine Chaieb, Tobias Nipkow
- 2005
|
|
|
Noname manuscript No. (will be inserted by the editor) A Solution to the PoplMark Challenge using de Bruijn indices in Isabelle/HOL
– Stefan Berghofer
|
