On the public citation graph
Proof style
0 signed · 42 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-15983-5_12openalex-snapshot
Proof theory and the synthesis of programs: Potential and limitations
inferredcites →https://doi.org/10.1007/3-540-57826-9_157openalex-snapshot
On the style of mechanical proving
inferredcites →https://doi.org/10.1007/3-540-60579-7_8openalex-snapshot
On extensibility of proof checkers
inferredcites →https://doi.org/10.1007/bf00244273openalex-snapshot
Writing programs that construct proofs
inferredcites →https://doi.org/10.1007/bfb0060623openalex-snapshot
The mathematical language AUTOMATH, its usage, and some of its extensions
inferredcites →https://doi.org/10.1093/comjnl/38.2.91openalex-snapshot
Tracking design changes with formal machine-checked proof
inferredcites →https://doi.org/10.1093/oso/9780198538509.003.0001openalex-snapshot
Logic, Computers, Turing, and von Neumannt
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.2949openalex-snapshot
Code‐level model checking in the software development workflow at Amazon Web Services
inferred← citeshttps://doi.org/10.1006/jsco.2001.0455openalex-snapshot
Electronic Communication of Mathematics and the Interaction of Computer Algebra Systems and Proof Assistants
inferred← citeshttps://doi.org/10.1007/10721959_1openalex-snapshot
High-Level Verification Using Theorem Proving and Formalized Mathematics
inferred← citeshttps://doi.org/10.1007/11757283_8openalex-snapshot
Floating-Point Verification Using Theorem Proving
inferred← citeshttps://doi.org/10.1007/3-540-44404-1_7openalex-snapshot
A Tactic Language for the System Coq
inferred← citeshttps://doi.org/10.1007/3-540-48737-9_4openalex-snapshot
Machine-Checking the Java Specification: Proving Type-Safety
inferred← citeshttps://doi.org/10.1007/978-3-030-75267-5_3openalex-snapshot
On the Conciliation of Traditional and Computer-Assisted Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-77879-8_4openalex-snapshot
Dynamic Proof Presentation
inferred← citeshttps://doi.org/10.1007/978-3-540-73433-8_24openalex-snapshot
A Short Survey of Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_13openalex-snapshot
Improving the Usability of HOL Through Controlled Automation Tactics
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_13openalex-snapshot
Merging Procedural and Declarative Proof
inferred← citeshttps://doi.org/10.1007/978-3-642-14052-5_9openalex-snapshot
A Tactic Language for Declarative Proofs
inferred← citeshttps://doi.org/10.1007/s10817-010-9198-6openalex-snapshot
A Certified Proof of the Cartan Fixed Point Theorems
inferred← citeshttps://doi.org/10.1007/s11229-022-03678-yopenalex-snapshot
Computer verification for historians of philosophy
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50004-6openalex-snapshot
History of Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1017/s0960129514000437openalex-snapshot
Formalization of real analysis: a survey of proof assistants and libraries
inferred← citeshttps://doi.org/10.1109/lics.2003.1210044openalex-snapshot
Formal verification at Intel
inferred← citeshttps://doi.org/10.1145/1838599.1838623openalex-snapshot
Recent developments in mega's proof search programming language
inferred← citeshttps://doi.org/10.1145/268946.268960openalex-snapshot
Javalight is type-safe---definitely
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:30)2012openalex-snapshot
A Synthesis of the Procedural and Declarative Styles of Interactive Theorem Proving
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/616openalex-snapshot
User interaction widgets for interactive theorem proving
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.