On the public citation graph
Using reflection to build efficient and certified decision procedures
0 signed · 104 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-57826-9_134openalex-snapshot
Extending the HOL theorem prover with a computer algebra system to reason about the reals
inferredcites →https://doi.org/10.1007/bfb0105407openalex-snapshot
Stålmarck’s algorithm as a HOL derived rule
inferredcites →https://doi.org/10.1016/0004-3702(80)90015-6openalex-snapshot
Prolegomena to a theory of mechanized formal reasoning
inferredcites →https://doi.org/10.1016/0378-4754(83)90038-1openalex-snapshot
The correctness problem in computer science
inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.21236/ada087641openalex-snapshot
A Catalogue of Canonical Term Rewriting Systems.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10721959_10openalex-snapshot
Automated Proof Construction in Type Theory Using Resolution
inferred← citeshttps://doi.org/10.1007/11538363_12openalex-snapshot
On the Role of Type Decorations in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/11541868_13openalex-snapshot
Real Number Calculations and Theorem Proving
inferred← citeshttps://doi.org/10.1007/11541868_7openalex-snapshot
Proving Equalities in a Commutative Ring Done Right in Coq
inferred← citeshttps://doi.org/10.1007/11814771_36openalex-snapshot
A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime Numbers
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_11openalex-snapshot
Equational Reasoning via Partial Reflection
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_2openalex-snapshot
Programming and Computing in HOL
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_5openalex-snapshot
Recursive Families of Inductive Types
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_12openalex-snapshot
Certifying the Fast Fourier Transform with Coq
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_24openalex-snapshot
Formalizing Convex Hull Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_25openalex-snapshot
Experiments with Finite Tree Automata in Coq
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_15openalex-snapshot
Modelisation of Timed Automata in Coq
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_39openalex-snapshot
Extraction of Proofs from the Clausal Normal Form Transformation
inferred← citeshttps://doi.org/10.1007/3-540-45842-5_12openalex-snapshot
Changing Data Structures in Type Theory: A Study of Natural Numbers
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_10openalex-snapshot
Universal Algebra in Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-45237-7_9openalex-snapshot
Practical Machine-Checked Formalization of Change Impact Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-51054-1_2openalex-snapshot
A Lean Tactic for Normalising Ring Expressions with Exponents (Short Paper)
inferred← citeshttps://doi.org/10.1007/978-3-032-04167-8_20openalex-snapshot
Checking Linear Integer Arithmetic Proofs in Lambdapi
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_24openalex-snapshot
Compositional Computational Reflection
inferred← citeshttps://doi.org/10.1007/978-3-319-32582-8_8openalex-snapshot
Certification for $$\mu $$ μ -Calculus with Winning Strategies
inferred← citeshttps://doi.org/10.1007/978-3-319-43144-4_16openalex-snapshot
Equational Reasoning with Applicative Functors
inferred← citeshttps://doi.org/10.1007/978-3-319-63046-5_16openalex-snapshot
Translating Between Implicit and Explicit Versions of Proof
inferred← citeshttps://doi.org/10.1007/978-3-319-94821-8_17openalex-snapshot
Reification by Parametricity
inferred← citeshttps://doi.org/10.1007/978-3-540-30142-4_17openalex-snapshot
A Decision Procedure for Geometry in Coq
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_26openalex-snapshot
Proof Search and Proof Check for Equational and Inductive Theorems
inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7_19openalex-snapshot
Real Number Calculations and Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_2openalex-snapshot
Proving Bounds on Real-Valued Functions with Computations
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_24openalex-snapshot
Primality Proving with Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-02614-0_10openalex-snapshot
Combining Coq and Gappa for Certifying Floating-Point Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_12openalex-snapshot
Formalizing the Logic-Automaton Connection
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_24openalex-snapshot
Practical Tactics for Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_18openalex-snapshot
Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-14128-7_18openalex-snapshot
Computing in Coq with Infinite Algebraic Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-25379-9_14openalex-snapshot
Tactics for Reasoning Modulo AC in Coq
inferred← citeshttps://doi.org/10.1007/978-3-642-25379-9_26openalex-snapshot
Full Reduction at Full Throttle
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_22openalex-snapshot
GMeta: A Generic Formal Metatheory Framework for First-Order Representations
inferred← citeshttps://doi.org/10.1007/978-3-642-31374-5_2openalex-snapshot
Proof, Message and Certificate
inferred← citeshttps://doi.org/10.1007/978-3-642-39634-2_8openalex-snapshot
Lightweight Proof by Reflection Using a Posteriori Simulation of Effectful Computation
inferred← citeshttps://doi.org/10.1007/b100400openalex-snapshot
Theorem proving in higher order logics: 17th International conference, TPHOLs 2004 park city, Utah, USA, september 14-17, 2004 proceedings 13
inferred← citeshttps://doi.org/10.1007/bfb0028392openalex-snapshot
A full formalisation of π-calculus theory in the calculus of constructions
inferred← citeshttps://doi.org/10.1007/bfb0055152openalex-snapshot
Case studies in meta-level theorem proving
inferred← citeshttps://doi.org/10.1007/s10703-010-0108-7openalex-snapshot
Certifying compilers using higher-order theorem provers as certificate checkers
inferred← citeshttps://doi.org/10.1007/s10817-024-09705-6openalex-snapshot
Towards a Scalable Proof Engine: A Performant Prototype Rewriting Primitive for Coq
inferred← citeshttps://doi.org/10.1007/s12046-009-0003-3openalex-snapshot
A compact kernel for the calculus of inductive constructions
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.035openalex-snapshot
Position Paper: Thoughts on Programming with Proof Assistants
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.099openalex-snapshot
An Interactive Driver for Goal-directed Proof Strategies
inferred← citeshttps://doi.org/10.1016/j.ic.2018.03.001openalex-snapshot
Incorporating quotation and evaluation into Church's type theory
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.12.004openalex-snapshot
Dealing with algebraic expressions over a field in Coq using Maple
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00354-6openalex-snapshot
Proof by computation in the Coq system
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00366-8openalex-snapshot
Equational rules for rewriting logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00295-6openalex-snapshot
Certifying Term Rewriting Proofs in ELAN
inferred← citeshttps://doi.org/10.1017/cbo9780511770524.016openalex-snapshot
Theorem-proving support in programming language semantics
inferred← citeshttps://doi.org/10.1017/s0956796815000118openalex-snapshot
Mtac: A monad for typed tactic programming in Coq
inferred← citeshttps://doi.org/10.1017/s0960129506005809openalex-snapshot
Affine functions and series with co-inductive real numbers
inferred← citeshttps://doi.org/10.1017/s0960129514000140openalex-snapshot
A light-weight integration of automated and interactive theorem proving
inferred← citeshttps://doi.org/10.1023/a:1021939521172openalex-snapshot
Automated Proof Construction in Type Theory Using Resolution
inferred← citeshttps://doi.org/10.1023/a:1021975117537openalex-snapshot
External Rewriting for Skeptical Proof Assistants
inferred← citeshttps://doi.org/10.1109/iceccs51672.2020.00011openalex-snapshot
RL: a Language for Formal Engineering
inferred← citeshttps://doi.org/10.1109/tc.2008.213openalex-snapshot
Verified Real Number Calculations: A Library for Interval Arithmetic
inferred← citeshttps://doi.org/10.1109/tc.2010.128openalex-snapshot
Certifying the Floating-Point Implementation of an Elementary Function Using Gappa
inferred← citeshttps://doi.org/10.11185/imt.4.304openalex-snapshot
A Certified Verifier for a Fragment of Separation Logic
inferred← citeshttps://doi.org/10.1145/1250734.1250742openalex-snapshot
A certified type-preserving compiler from lambda calculus to assembly language
inferred← citeshttps://doi.org/10.1145/1644001.1644003openalex-snapshot
Certification of bounds on expressions involving rounded operators
inferred← citeshttps://doi.org/10.1145/2103621.2103690openalex-snapshot
Static and user-extensible proof checking
inferred← citeshttps://doi.org/10.1145/2500365.2500575openalex-snapshot
Typed syntactic meta-programming
inferred← citeshttps://doi.org/10.1145/2503887.2503892openalex-snapshot
A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus
inferred← citeshttps://doi.org/10.1145/3015465openalex-snapshot
Certified Roundoff Error Bounds Using Semidefinite Programming
inferred← citeshttps://doi.org/10.1145/3131851.3131872openalex-snapshot
Expressive and strongly type-safe code generation
inferred← citeshttps://doi.org/10.1145/3547628openalex-snapshot
Verified symbolic execution with Kripke specification monads (and no meta-programming)
inferred← citeshttps://doi.org/10.1145/3747506openalex-snapshot
Frex: Dependently Typed Algebraic Simplification
inferred← citeshttps://doi.org/10.1145/3776695openalex-snapshot
A Lazy, Concurrent Convertibility Checker
inferred← citeshttps://doi.org/10.1145/3798129.3806376openalex-snapshot
Determination of the Fifth Busy Beaver Value
inferred← citeshttps://doi.org/10.1561/2500000045openalex-snapshot
QED at Large: A Survey of Engineering of Formally Verified Software
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:2)2012openalex-snapshot
Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination
inferred← citeshttps://doi.org/10.2307/j.ctv36xvmkd.10openalex-snapshot
A reflection-based proof tactic for lattices in Coq
inferred← citeshttps://doi.org/10.23889/suthesis.54270openalex-snapshot
Integration of the Process Algebra CSP in Dependent Type Theory - Formalisation and Verification
inferred← citeshttps://doi.org/10.48550/arxiv.0801.0523openalex-snapshot
Certifying floating-point implementations using Gappa
inferred← citeshttps://doi.org/10.48550/arxiv.1305.6543openalex-snapshot
MirrorShard: Proof by Computational Reflection with Verified Hints
inferred← citeshttps://doi.org/10.48550/arxiv.2110.05771openalex-snapshot
Toward SMT-Based Refinement Types in Agda
inferred← citeshttps://doi.org/10.5555/1894483.1894503openalex-snapshot
Computing in coq with infinite algebraic data structures
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/4319openalex-snapshot
Formal Proofs for Nonlinear Optimization
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/4552openalex-snapshot
Mixing Computations and Proofs
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/616openalex-snapshot
User interaction widgets for interactive theorem proving
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/917openalex-snapshot
Interactive theorem provers: issues faced as a user and tackled as a developer
inferred← citeshttps://doi.org/10.70675/3a17c566z3288z4b15z8333ze08d71d24d7aopenalex-snapshot
Formalizing and Implementing a Reflexive Tactic for Automated Deduction in Coq
inferred← citeshttps://doi.org/10.70675/61bfbf53z121az472ez8c91ze9f6166c9a6aopenalex-snapshot
Applications of Foundational Proof Certificates in theorem proving
inferred← citeshttps://doi.org/10.70675/69a219a5zd6c2z401dz9dd2zfa340fb921e2openalex-snapshot
On the formalization of foundations of geometry
inferred← citeshttps://doi.org/10.70675/d201f018z3f28z4355z81c3z59eb3b371487openalex-snapshot
Formalisation tools for classical analysis : a case study in control theory
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.