On the public citation graph

Case studies in meta-level theorem proving

https://doi.org/10.1007/bfb0055152
0 signed · 33 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.1002/malq.19680140702openalex-snapshot
Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
inferredcites →https://doi.org/10.1007/3-540-07854-1_195openalex-snapshot
An algebraic approach to data types, program verification, and program synthesis
inferredcites →https://doi.org/10.1007/3-540-62688-3_44openalex-snapshot
Computational reflection in the calculus of constructions and its application to theorem proving
inferredcites →https://doi.org/10.1007/978-1-4613-8601-8openalex-snapshot
Self-Reference and Modal Logic
inferredcites →https://doi.org/10.1007/bfb0014565openalex-snapshot
Using reflection to build efficient and certified decision procedures
inferredcites →https://doi.org/10.1007/bfb0030541openalex-snapshot
Isabelle
inferredcites →https://doi.org/10.1007/bfb0054171openalex-snapshot
A verified model checker for the modal Μ-calculus in Coq
inferredcites →https://doi.org/10.1017/cbo9780511526602openalex-snapshot
Logic and Computation
inferredcites →https://doi.org/10.1109/32.345827openalex-snapshot
Formal verification for fault-tolerant architectures: prolegomena to the design of PVS
inferredcites →https://doi.org/10.1109/lics.1990.113737openalex-snapshot
The semantics of reflected proof
inferredcites →https://doi.org/10.1109/lics.1991.151645openalex-snapshot
An inverse of the evaluation functional for typed lambda -calculus
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.1145/2422.322411openalex-snapshot
Deciding Combinations of Theories
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.2307/2274450openalex-snapshot
C. Smoryński. Self-reference and modal logic. Universitext. Springer-Verlag, New York, Berlin, etc., 1985, xii + 333 pp.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10930755_17openalex-snapshot
Inductive Invariants for Nested Recursion
inferred← citeshttps://doi.org/10.1007/11541868_13openalex-snapshot
Real Number Calculations and Theorem Proving
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_29openalex-snapshot
Formal Verification of a Combination Decision Procedure
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_13openalex-snapshot
Verifying BDD Algorithms through Monadic Interpretation
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_5openalex-snapshot
Polytypic Proof Construction
inferred← citeshttps://doi.org/10.1007/3-540-48257-1_24openalex-snapshot
PVS: An Experience Report
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_38openalex-snapshot
Abstract and Model Check while You Prove
inferred← citeshttps://doi.org/10.1007/978-3-319-94821-8_13openalex-snapshot
HOL Light QE
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-79707-4_10openalex-snapshot
Machine Checked Formal Proof of a Scheduling Protocol for Smartcard Personalization
inferred← citeshttps://doi.org/10.1007/978-3-642-18070-5openalex-snapshot
Formal Verification of Object-Oriented Software
inferred← citeshttps://doi.org/10.1007/978-3-642-19829-8_11openalex-snapshot
Reasoning about Assignments in Recursive Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-32759-9_18openalex-snapshot
Correctness of Pointer Manipulating Algorithms Illustrated by a Verified BDD Construction
inferred← citeshttps://doi.org/10.1007/978-3-7091-6355-9_14openalex-snapshot
Towards Light-Weight Verification and Heavy-Weight Testing
inferred← citeshttps://doi.org/10.1007/bfb0055125openalex-snapshot
Theorem Proving in Higher Order Logics
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.1109/tc.2008.213openalex-snapshot
Verified Real Number Calculations: A Library for Interval Arithmetic
inferred← citeshttps://doi.org/10.48550/arxiv.0708.3721openalex-snapshot
Verified Real Number Calculations: A Library for Interval Arithmetic
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.