Formal Verification of a Geometry Algorithm: A Quest for Abstract Views and Symmetry in Coq Proofs

Yves Bertot 1
1 MARELLE - Mathematical, Reasoning and Software
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : This extended abstract is about an effort to build a formal description of a triangulation algorithm starting with a naive description of the algorithm where triangles, edges, and triangulations are simply given as sets and the most complex notions are those of boundary and separating edges. When performing proofs about this algorithm, questions of symmetry appear and this exposition attempts to give an account of how these symmetries can be handled. All this work relies on formal developments made with Coq and the mathematical components library.
Liste complète des métadonnées

https://hal.inria.fr/hal-01866271
Contributor : Yves Bertot <>
Submitted on : Monday, September 3, 2018 - 11:11:59 AM
Last modification on : Wednesday, September 12, 2018 - 3:49:26 PM
Document(s) archivé(s) le : Tuesday, December 4, 2018 - 4:17:53 PM

Files

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01866271, version 1
  • ARXIV : 1809.00559

Collections

Citation

Yves Bertot. Formal Verification of a Geometry Algorithm: A Quest for Abstract Views and Symmetry in Coq Proofs. ICTAC 2018 - International Colloquium on Theoretical of Computing, Oct 2018, Stellenbosch, South Africa. ⟨hal-01866271⟩

Share

Metrics

Record views

54

Files downloads

77