A formal proof or derivation is a finite sequence of sentences (called well-formed formulas in the case of a formal language), each of which is anâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2015

Highly Cited

2015

- Thomas C. Hales, Mark Adams, +19 authors Roland Zumkeller
- ArXiv
- 2015

This article describes a formal proof of the Kepler conjecture on dense sphere packings in a combination of the HOL Light andâ€¦Â (More)

Is this relevant?

2011

2011

- Iain Whiteside, David Aspinall, Lucas Dixon, Gudmund Grov
- Calculemus/MKM
- 2011

We propose proof script refactorings as a robust tool for constructing, restructuring, and maintaining formal proof developmentsâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Gerwin Klein, Kevin Elphinstone, +10 authors Simon Winwood
- SOSP
- 2009

Complete formal verification is the only known way to guarantee that a system is free of programming errors.
We present ourâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Georges Gonthier
- 2008

The Tale of a Brainteaser Francis Guthrie certainly did it, when he coined his innocent little coloring puzzle in 1852. Heâ€¦Â (More)

Is this relevant?

2008

2008

- Thomas C. Hales
- 2008

D aily, we confront the errors of computers. They crash, hang, succumb to viruses, run buggy software, and harbor spyware. Ourâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Achim D. Brucker, Burkhart Wolff
- FASE
- 2008

We present the theorem proving environment HOL-OCL that is integrated in a Model-driven Engineering (MDE) framework. HOL-OCLâ€¦Â (More)

Is this relevant?

2004

2004

- Nuno AmÃ¡lio, Susan Stepney, Fiona A. C. Polack
- ICFEM
- 2004

We present a practical approach to a formal analysis of UMLbased models. This is achieved by an underlying formal representationâ€¦Â (More)

Is this relevant?

2003

2003

- Freek Wiedijk
- TYPES
- 2003

We define the notion of formal proof sketch for the mathematical language Mizar. We show by examples that formal proof sketchesâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Markus Wenzel
- 2002

The basic motivation of this work is to make formal theory developments with machine-checked proofs accessible to a broaderâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Markus Wenzel
- TPHOLs
- 1999

We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). Itâ€¦Â (More)

Is this relevant?