On the public citation graph
Proof Generation in the Touchstone Theorem Prover
0 signed · 34 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-55602-8_217openalex-snapshot
PVS: A prototype verification system
inferredcites →https://doi.org/10.1007/3-540-58156-1_66openalex-snapshot
Elf: A meta-language for deductive systems
inferredcites →https://doi.org/10.1007/3-540-60275-5_58openalex-snapshot
Combining decision procedures in the HOL system
inferredcites →https://doi.org/10.1016/0168-0072(91)90068-wopenalex-snapshot
Uniform proofs as a foundation for logic programming
inferredcites →https://doi.org/10.1016/b978-0-444-89880-7.50008-5openalex-snapshot
A Lazy Approach to Fully-Expansive Theorem Proving
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50001-0openalex-snapshot
STUDIES IN LOGIC AND THE FOUNDATIONS OF MATHEMATICS
inferredcites →https://doi.org/10.1017/cbo9780511569807.008openalex-snapshot
Logic programming in the LF logical framework
inferredcites →https://doi.org/10.1093/logcom/1.4.497openalex-snapshot
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
inferredcites →https://doi.org/10.1137/0209063openalex-snapshot
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferredcites →https://doi.org/10.1145/322186.322198openalex-snapshot
Fast Decision Procedures Based on Congruence Closure
inferredcites →https://doi.org/10.1145/322217.322228openalex-snapshot
Variations on the Common Subexpression Problem
inferredcites →https://doi.org/10.1145/322276.322288openalex-snapshot
Deciding Linear Inequalities by Computing Loop Residues
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.2307/2964059openalex-snapshot
W. Ackermann. Solvable cases of the decision problem. Studies in logic and the foundations of mathematics. North-Holland Publishing Company, Amsterdam1954, VIII + 114 pp.
inferredcites →https://doi.org/10.48456/tr-68openalex-snapshot
HOL A machine oriented formulation of higher order logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_27openalex-snapshot
Prototyping Proof Carrying Code
inferred← citeshttps://doi.org/10.1007/11559306_9openalex-snapshot
An Efficient Decision Procedure for UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/11814771_39openalex-snapshot
Solving Sparse Linear Constraints
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_38openalex-snapshot
An Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_3openalex-snapshot
Using Decision Procedures with a Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_34openalex-snapshot
Theorem Proving Using Lazy Proof Explication
inferred← citeshttps://doi.org/10.1007/978-3-642-17796-5_2openalex-snapshot
Verification of Common Interprocedural Compiler Optimizations Using Visibly Pushdown Kleene Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-25379-9_13openalex-snapshot
Modular SMT Proofs for Fast Reflexive Checking Inside Coq
inferred← citeshttps://doi.org/10.1007/978-3-642-38856-9_19openalex-snapshot
Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-642-54108-7_16openalex-snapshot
Result Certification of Static Program Analysers with Automated Theorem Provers
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.067openalex-snapshot
Validated Proof-Producing Decision Procedures
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.11.017openalex-snapshot
Imperative LF Meta-Programming
inferred← citeshttps://doi.org/10.1109/icdcsw.2002.1030805openalex-snapshot
Adaptive applications for mobile heterogenous devices
inferred← citeshttps://doi.org/10.1145/3586029openalex-snapshot
Generating Proof Certificates for a Language-Agnostic Deductive Program Verifier
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.