Cited by 117Logic, programming, and type systemsFormal Methods in VerificationAdvanced Graph Theory Research

The Four Colour Theorem: Engineering of a Formal Proof

Gonthier, Georges·2008·Lecture Notes in Computer Science

Integrity signals

Registry

Crossref · 10.1007/978-3-540-87827-8_28

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Formal verification tools have enabled significant achievements, including the formal verification of the four-colour theorem and the CompCert C compiler.

    “These tools have enabled significant achievements, including the formal verification of the four-colour theorem32 and critical software such as the CompCert C compiler33.”

Cited by

Sorted by citations

Authors
Gonthier, G.
Venue
Lecture Notes in Computer Science
Published
2008
Pages
333-333
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1503170941
Cited by
117
References
0
Citations by year
2026: 1 · 2025: 6 · 2024: 4 · 2023: 8 · 2022: 2 · 2021: 4 · 2020: 7 · 2019: 7 · 2018: 13 · 2017: 7 · 2016: 9 · 2015: 10 · 2014: 7 · 2013: 11 · 2012: 4
FWCI
4.21
Type
conference paper
Language
en
Open access
closed
Locations
Lecture notes in computer science (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
Keywords
four-color theorem, machine-checked proofs, Coq, formal verification, planarity, hypermaps, Jordan curve theorem, graph coloring

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review