Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2017

Highly Cited

2017

This article describes a formal proof of the Kepler conjecture on dense sphere packings in a combination of the HOL Light and… Expand

Highly Cited

2009

Highly Cited

2009

Complete formal verification is the only known way to guarantee that a system is free of programming errors.
We present our… Expand

Highly Cited

2008

Highly Cited

2008

The Tale of a Brainteaser Francis Guthrie certainly did it, when he coined his innocent little coloring puzzle in 1852. He… Expand

Review

2007

Review

2007

The 150 year old Four Colour Theorem is the first famous result with a proof that requires large computer calculations. Such… Expand

Highly Cited

2004

Highly Cited

2004

Formal proofs in mathematics and computer science are being studied because these objects can be verified by a very simple… Expand

Highly Cited

2002

Highly Cited

2002

The basic motivation of this work is to make formal theory developments with machine-checked proofs accessible to a broader… Expand

Highly Cited

1999

Highly Cited

1999

We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It… Expand

Highly Cited

1994

Highly Cited

1994

We present a new approach to proving type soundness for Hindley/Milner-style polymorphic type systems. The keys to our approach… Expand

Highly Cited

1984

Highly Cited

1984

Abstract A qualitative physics predicts and explains the behavior of mechanisms in qualitative terms. The goals for the… Expand

Highly Cited

1975

Highly Cited

1975

So-called “guarded commands” are introduced as a building block for alternative and repetitive constructs that allow… Expand