On the public citation graph

Formal specification and theorem proving breakthroughs in geometric modeling

https://doi.org/10.1007/bfb0055149
0 signed · 28 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/cgip.1994.1005openalex-snapshot
Algebraic Specification of a 3D-Modeler Based on Hypermaps
inferredcites →https://doi.org/10.1006/gmip.1994.1005openalex-snapshot
Algebraic Specification of a 3D-Modeler Based on Hypermaps
inferredcites →https://doi.org/10.1006/gmip.1996.0028openalex-snapshot
Jordan Graphs
inferredcites →https://doi.org/10.1007/3-540-15983-5_13openalex-snapshot
Constructions: A higher order proof system for mechanizing mathematics
inferredcites →https://doi.org/10.1007/3-540-56610-4_57openalex-snapshot
Algebraic specification and development in geometric modeling
inferredcites →https://doi.org/10.1007/3-540-60117-1_20openalex-snapshot
Synthesizing proofs from programs in the Calculus of Inductive Constructions
inferredcites →https://doi.org/10.1007/3-540-60275-5_77openalex-snapshot
Formalization of planar graphs
inferredcites →https://doi.org/10.1007/bf01177550openalex-snapshot
Behavioural approaches to algebraic specifications
inferredcites →https://doi.org/10.1007/bfb0037116openalex-snapshot
Inductive definitions in the system Coq rules and properties
inferredcites →https://doi.org/10.1007/s003710050095openalex-snapshot
Algebras and formal specifications in geometric modelling
inferredcites →https://doi.org/10.1016/0010-4485(91)90082-8openalex-snapshot
Topological models for boundary representation: a comparison with n- generalized maps
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50018-4openalex-snapshot
Algebraic Specification
inferredcites →https://doi.org/10.4153/cjm-1979-091-3openalex-snapshot
Combinatorial Oriented Maps

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-44755-5_24openalex-snapshot
Formalizing Convex Hull Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45410-1_16openalex-snapshot
Emphasizing Human Techniques in Automated Geometry Theorem Proving: A Practical Realization
inferred← citeshttps://doi.org/10.1007/3-540-45410-1_17openalex-snapshot
Higher-Order Intuitionistic Formalization and Proofs in Hilbert’s Elementary Geometry
inferred← citeshttps://doi.org/10.1007/3-540-45645-7_9openalex-snapshot
Geometric Modelling with CASL
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_11openalex-snapshot
Formalizing the Trading Theorem for the Classification of Surfaces
inferred← citeshttps://doi.org/10.1007/3-540-48257-1_3openalex-snapshot
Formal Program Development in Geometric Modeling
inferred← citeshttps://doi.org/10.1007/978-3-642-14052-5_16openalex-snapshot
Formal Study of Plane Delaunay Triangulation
inferred← citeshttps://doi.org/10.1007/s10472-009-9168-zopenalex-snapshot
Flyspeck II: the basic linear programs
inferred← citeshttps://doi.org/10.1007/s10817-020-09551-2openalex-snapshot
Formalization of the Poincaré Disc Model of Hyperbolic Geometry
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.04.007openalex-snapshot
Formal specification and proofs for the topology and classification of combinatorial surfaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.05.002openalex-snapshot
Formalizing the trading theorem in Coq
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.05.003openalex-snapshot
Formalizing generalized maps in Coq
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.012openalex-snapshot
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00228-xopenalex-snapshot
Formalizing mathematics in higher-order logic: A case study in geometric modelling
inferred← citeshttps://doi.org/10.70675/69a219a5zd6c2z401dz9dd2zfa340fb921e2openalex-snapshot
On the formalization of foundations of geometry
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.