On the public citation graph
Derivation of proof methods by abstract interpretation
0 signed · 38 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-50940-2_30openalex-snapshot
Verifying correctness of logic programs
inferredcites →https://doi.org/10.1007/3-540-58431-5_20openalex-snapshot
A logic for variable aliasing in logic programs
inferredcites →https://doi.org/10.1007/3-540-61735-3_14openalex-snapshot
Prime factorizations of abstract domains using first-order logic
inferredcites →https://doi.org/10.1007/3-540-62503-8_2openalex-snapshot
Proving properties of logic programs by abstract diagnosis
inferredcites →https://doi.org/10.1007/bf01213601openalex-snapshot
Reasoning about Prolog programs: From modes through types to assertions
inferredcites →https://doi.org/10.1007/bfb0000474openalex-snapshot
Completeness in abstract interpretation: A domain perspective
inferredcites →https://doi.org/10.1016/0304-3975(88)90099-0openalex-snapshot
Inductive assertion method for logic programs
inferredcites →https://doi.org/10.1016/0304-3975(89)90070-4openalex-snapshot
Declarative modeling of the operational behavior of logic languages
inferredcites →https://doi.org/10.1016/0304-3975(93)90107-5openalex-snapshot
Proof methods of declarative properties of definite programs
inferredcites →https://doi.org/10.1016/s0304-3975(00)00313-3openalex-snapshot
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
inferredcites →https://doi.org/10.1016/s0304-3975(97)00174-6openalex-snapshot
Compositionality properties of SLD-derivations
inferredcites →https://doi.org/10.1016/s0304-3975(98)00231-xopenalex-snapshot
Design of abstract domains using first-order logic
inferredcites →https://doi.org/10.1016/s0743-1066(96)00144-6openalex-snapshot
Directional types and the annotation method
inferredcites →https://doi.org/10.1016/s1571-0661(05)80168-9openalex-snapshot
Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation (Extended Abstract)
inferredcites →https://doi.org/10.1093/logcom/2.4.511openalex-snapshot
Abstract Interpretation Frameworks
inferredcites →https://doi.org/10.1145/143165.143184openalex-snapshot
Inductive definitions, semantics and abstract interpretations
inferredcites →https://doi.org/10.1145/155090.155095openalex-snapshot
Abstract debugging of higher-order imperative languages
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2000.3024openalex-snapshot
A Theory of Observables for Logic Programs
inferred← citeshttps://doi.org/10.1007/10704567_19openalex-snapshot
On the Verification of Finite Failure
inferred← citeshttps://doi.org/10.1007/10705424_9openalex-snapshot
Automatic Verification Based on Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/3-540-44577-3_10openalex-snapshot
Abstract Interpretation Based Formal Methods and Future Challenges
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_41openalex-snapshot
How to Transform an Analyzer into a Verifier
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_16openalex-snapshot
An Experiment in Type Inference and Verification by Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_11openalex-snapshot
A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.06.001openalex-snapshot
On the verification of finite failure
inferred← citeshttps://doi.org/10.1016/j.scico.2003.08.002openalex-snapshot
Abstract interpretation based verification of logic programs
inferred← citeshttps://doi.org/10.1016/s0167-6423(00)00017-4openalex-snapshot
A first-order language for expressing sharing and type properties of logic programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00112-4openalex-snapshot
Abstract Interpretation based Verification of Logic Programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00153-7openalex-snapshot
Logic programs as specifications in the inductive verification of logic programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80036-2openalex-snapshot
Assertion based Inductive Verification Methods for Logic Programs
inferred← citeshttps://doi.org/10.3233/fi-2014-1106openalex-snapshot
An Abstract Interpretation Framework for Type and Effect Systems
inferred← citeshttps://doi.org/10.5281/zenodo.182982openalex-snapshot
FIGURE 8 in Taxonomy of European Damaeidae (Acari: Oribatida) I. Kunstidamaeus Miko, 2006, with comments on Damaeus sensu lato
inferred← citeshttps://doi.org/10.5281/zenodo.26331openalex-snapshot
Hercynia, A New Genus Of Myrmicine Ants.
inferred← citeshttps://doi.org/10.5281/zenodo.41652openalex-snapshot
Blind Channel Identification In Speech Using The Long-Term Average Speech Spectrum
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.