Abstract
An innovative attempt to integrate formal program development in geometric modeling is reported through the axiomatization of model of the combinatorial maps in the Calculus of Inductive Constructions. A hierarchical specification of ordered sorts is validated in the Coq prover by inductive proofs, and the automatic extraction of a prototype. Classical difficulties — like cohabitation of hierarchized objects, smooth handling of subtyping, and completion of partial relations — are addressed both from theorem proving and prototyping viewpoint.
This work is supported by the GDR-PRC of Programmation, and the GDR-PRC of Algorithmique, Modles et Infographie (MENRT, CNRS, France).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.A. Bergstra, J. Herig, et al. Algebraic Specification. ACM Press, 1988.
Y. Bertrand and J.-F. Dufourd. Algebraic Specification of a 3D-Modeler Based on Hypermaps. Graphical Models and Image Processing, 56(1):29–60, 1994.
J.-F. Dufourd. Algebras and Formal Specifications in Geometric Modeling. In The Visual Computer, pages 131–154. Spinger-Verlag, 1997.
J.A. Goguen et al. Introducing OBJ3. In Applications of Algebraic Specifications Using OBJ. Cambridge University Press, 1992.
F. Puitg and J.-F. Dufourd. Formal Specifications and Theorem Proving Breakthroughs in Geometric Modelling. In Theorem Proving in Higher Order Logics, Canberra (Australia), September 1998. Springer-Verlag, LNCS. http://dpt-info.u-strasbg.fr/~puitg/tphol98/main.html.
P. Lienhardt. Topological Models for Boundary Representation: A Survey. In Computer Aided Design, volume 23(1), pages 59–81. 1991.
A. Jacques. Constellations et Graphes Topologiques. In Combinatorial Theory and Applications, pages 657–673. Budapest (Hungary), 1970.
W. Tutte. Combinatorial Oriented Maps. In Canadian Journal of Mathematics, volume XXXI(2), pages 986–1004. 1979.
A. Jacques. Sur le Genre d’une Paire de Substitutions. Notes des membres et correspondants, volume 267, pages 625–627, 1968.
R. Cori. Un Code pour les Graphes Planaires et ses Applications. Socit Math. de France, Paris, Astérisque 27, 1975.
F. Puitg and J.-F. Dufourd. Combinatorial Maps and Planarity: Formal Specifications and Proofs in the Calculus of Inductive Constructions. Tech. Rep. 98/05 (100 pages), LSIIT, Strasbourg (France), 1998. http://dpt-info.u-strasbg.fr/~puitg/rr98/main.html.
C. Paulin-Mohring. Inductive Definitions in the System Coq — Rules and Properties. In Typed Lambda-calculi and Applications. LNCS 664, 1993.
C. Cornes et al. The Coq Proof Assistant Reference Manual V6.1. INRIA-Rocquencourt, CNRS-ENS Lyon (France), December 1996.
C. Parent. Synthesizing Proofs from Programs in the Calculus of Inductive Constructions. In Mathematics of Program Construction. LNCS 947, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Puitg, F., Dufourd, JF. (1999). Formal Program Development in Geometric Modeling. In: Hutter, D., Stephan, W., Traverso, P., Ullmann, M. (eds) Applied Formal Methods — FM-Trends 98. FM-Trends 1998. Lecture Notes in Computer Science, vol 1641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48257-1_3
Download citation
DOI: https://doi.org/10.1007/3-540-48257-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66462-8
Online ISBN: 978-3-540-48257-4
eBook Packages: Springer Book Archive