Formal Proof in Coq and Derivation of a Program in C++ to Compute Convex Hulls
Résumé
This article presents a generic method to build programs in computational geometry from their specifications. It focuses on a case study namely computing incrementally the convex hull of a set of points in the plane. Our program to compute convex hulls is specified and proved correct using the Coq proof assistant. A concrete implementation in Ocaml is then automatically extracted and an efficient C++ program is derived (by hand) from the specification.
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...