On the public citation graph

Comparing Completeness Properties of Static Analyses and Their Logics

0 signed · 44 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.1007/10722167_15openalex-snapshot
Counterexample-Guided Abstraction Refinement
inferredcites →https://doi.org/10.1007/11609773_22openalex-snapshot
Strong Preservation of Temporal Fixpoint-Based Operators by Abstract Interpretation
inferredcites →https://doi.org/10.1007/11823230_9openalex-snapshot
Underapproximating Predicate Transformers
inferredcites →https://doi.org/10.1007/11924661_12openalex-snapshot
Comparing Completeness Properties of Static Analyses and Their Logics
inferredcites →https://doi.org/10.1007/3-540-17162-2_130openalex-snapshot
Galois connections and computer science applications
inferredcites →https://doi.org/10.1007/3-540-45319-9_19openalex-snapshot
Boolean and Cartesian Abstraction for Model Checking C Programs
inferredcites →https://doi.org/10.1007/3-540-46002-0_12openalex-snapshot
Relative Completeness of Abstraction Refinement for Software Model Checking
inferredcites →https://doi.org/10.1007/3-540-47764-0_20openalex-snapshot
Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking
inferredcites →https://doi.org/10.1007/3-540-60045-0_58openalex-snapshot
Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form
inferredcites →https://doi.org/10.1007/3-540-60360-3_32openalex-snapshot
Optimality in abstractions of model checking
inferredcites →https://doi.org/10.1007/3-540-61474-5_69openalex-snapshot
Verifying invariants using theorem proving
inferredcites →https://doi.org/10.1007/978-3-540-24725-8_3openalex-snapshot
Strong Preservation as Completeness in Abstract Interpretation
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_10openalex-snapshot
An Abstract Interpretation-Based Refinement Algorithm for Strong Preservation
inferredcites →https://doi.org/10.1007/978-3-540-45099-3_20openalex-snapshot
Model Checking Guided Abstraction and Analysis
inferredcites →https://doi.org/10.1007/bf01384313openalex-snapshot
Property preserving abstractions for the verification of concurrent systems
inferredcites →https://doi.org/10.1017/cbo9780511809088openalex-snapshot
Introduction to Lattices and Order
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.2004.1319628openalex-snapshot
The existence of finite abstractions for branching time model checking
inferredcites →https://doi.org/10.1109/lics.2004.42openalex-snapshot
The existence of finite abstractions for branching time model checking
inferredcites →https://doi.org/10.1145/154630.154648openalex-snapshot
Completeness and predicate-based abstract interpretation
inferredcites →https://doi.org/10.1145/186025.186051openalex-snapshot
Model checking and abstraction
inferredcites →https://doi.org/10.1145/244795.244800openalex-snapshot
Abstract interpretation of reactive systems
inferredcites →https://doi.org/10.1145/325694.325699openalex-snapshot
Temporal abstract interpretation
inferredcites →https://doi.org/10.1145/333979.333989openalex-snapshot
Making abstract interpretations complete
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/514188.514190openalex-snapshot
Parametric shape analysis via 3-valued logic
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
inferredcites →https://doi.org/10.6100/ir462072openalex-snapshot
Abstract interpretation and partition refinement for model checking

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-540-78163-9_23openalex-snapshot
Internal and External Logics of Abstract Interpretations
inferred← citeshttps://doi.org/10.1007/978-3-642-02261-6_9openalex-snapshot
Observational Completeness on Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-642-03237-0_20openalex-snapshot
Abstract Interpretation from a Topological Perspective
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.027openalex-snapshot
What You Lose is What You Leak: Information Leakage in Declassification Policies
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.042openalex-snapshot
Extracting Program Logics From Abstract Interpretations Defined by Logical Relations
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.082openalex-snapshot
Abstract Interpretation From a Denotational-semantics Perspective
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.10.009openalex-snapshot
Summarized Dimensions Revisited
inferred← citeshttps://doi.org/10.1016/j.ic.2008.07.004openalex-snapshot
3-Valued abstraction: More precision at less cost
inferred← citeshttps://doi.org/10.1016/j.scico.2014.03.005openalex-snapshot
Deriving a complete type inference for Hindley–Milner and vector sizes using expansion
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.002openalex-snapshot
Inverse-limit and topological aspects of abstract interpretation
inferred← citeshttps://doi.org/10.1017/s096012951100020xopenalex-snapshot
Modelling declassification policies using abstract domain completeness
inferred← citeshttps://doi.org/10.1109/lics.2006.5openalex-snapshot
3-Valued Abstraction: More Precision at Less Cost
inferred← citeshttps://doi.org/10.1145/2426890.2426895openalex-snapshot
Deriving a complete type inference for hindley-milner and vector sizes using expansion
inferred← citeshttps://doi.org/10.1145/2594291.2594313openalex-snapshot
Optimal inference of fields in row-polymorphic records
inferred← citeshttps://doi.org/10.1145/2666356.2594313openalex-snapshot
Optimal inference of fields in row-polymorphic records
showing the first 15 of 16 · page through all 16
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.