On the public citation graph
Completeness in abstract interpretation: A domain perspective
0 signed · 61 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-51486-4_95openalex-snapshot
Optimal data flow analysis via observational equivalence
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-60922-9_41openalex-snapshot
“Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
inferredcites →https://doi.org/10.1007/3-540-63165-8_230openalex-snapshot
Refining and compressing abstract domains
inferredcites →https://doi.org/10.1007/bf01236765openalex-snapshot
Weak relative pseudo-complements of closure operators
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/s0167-6423(96)00039-1openalex-snapshot
Two classes of Boolean functions for dependency analysis
inferredcites →https://doi.org/10.1016/s0167-6423(97)00034-8openalex-snapshot
Optimal domains for disjunctive abstract interpretation
inferredcites →https://doi.org/10.1016/s0304-3975(98)00007-3openalex-snapshot
The powerset operator on abstract interpretations
inferredcites →https://doi.org/10.1051/ita/1992260504031openalex-snapshot
Compositional characterization of observable program properties
inferredcites →https://doi.org/10.1109/iccl.1992.185465openalex-snapshot
On the power of abstract interpretation
inferredcites →https://doi.org/10.1109/iccl.1994.288389openalex-snapshot
Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages)
inferredcites →https://doi.org/10.1145/143165.143184openalex-snapshot
Inductive definitions, semantics and abstract interpretations
inferredcites →https://doi.org/10.1145/151646.151650openalex-snapshot
A general framework for semantics-based bottom-up abstract interpretation of logic programs
inferredcites →https://doi.org/10.1145/154630.154648openalex-snapshot
Completeness and predicate-based abstract interpretation
inferredcites →https://doi.org/10.1145/176454.176519openalex-snapshot
Precise and efficient groundness analysis for logic programs
inferredcites →https://doi.org/10.1145/234528.234742openalex-snapshot
A unifying view of abstract domain design
inferredcites →https://doi.org/10.1145/239912.239914openalex-snapshot
Complementation in abstract interpretation
inferredcites →https://doi.org/10.1145/258128.258212openalex-snapshot
On the power and limitations of strictness analysis
inferredcites →https://doi.org/10.1145/263699.263744openalex-snapshot
Types as abstract interpretations
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
inferredcites →https://doi.org/10.7488/era/4239openalex-snapshot
Abstract interpretation and optimising transformations for applicative programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11417170_30openalex-snapshot
Higher-Order Abstract Non-interference
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-45142-0_9openalex-snapshot
Measuring the Precision of Abstract Interpretations
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-48294-6_5openalex-snapshot
Decomposing Non-redundant Sharing by Complementation
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_13openalex-snapshot
Building Complete Abstract Interpretations in a Linear Logic-Based Setting
inferred← citeshttps://doi.org/10.1007/978-3-030-65474-0_14openalex-snapshot
On Multi-language Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_13openalex-snapshot
Affine Loop Invariant Generation via Matrix Algebra
inferred← citeshttps://doi.org/10.1007/978-3-031-64626-3_19openalex-snapshot
Empirically Scalable Invariant Generation Leveraging Divide-and-Conquer with Pruning
inferred← citeshttps://doi.org/10.1007/978-3-319-58469-0_30openalex-snapshot
Data Minimisation: A Language-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-27864-1_15openalex-snapshot
Abstract Interpretation of Combinational Asynchronous Circuits
inferred← citeshttps://doi.org/10.1007/978-981-19-9601-6_6openalex-snapshot
Completeness in Static Analysis by Abstract Interpretation: A Personal Point of View
inferred← citeshttps://doi.org/10.1007/978-981-19-9601-6_8openalex-snapshot
Local Completeness in Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/bfb0032733openalex-snapshot
Set-sharing is redundant for pair-sharing
inferred← citeshttps://doi.org/10.1007/bfb0055786openalex-snapshot
Complete abstract interpretations made constructive
inferred← citeshttps://doi.org/10.1007/bfb0056610openalex-snapshot
Derivation of proof methods by abstract interpretation
inferred← citeshttps://doi.org/10.1007/s10703-022-00405-8openalex-snapshot
On multi-language abstraction: Towards a static analysis of multi-language programs
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/j.scico.2006.03.007openalex-snapshot
Abstract interpretation of combinational asynchronous circuits
inferred← citeshttps://doi.org/10.1016/j.scico.2025.103361openalex-snapshot
Optimization of Farkas' Lemma-based linear invariant generation using divide-and-conquer with pruning
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00312-1openalex-snapshot
Set-sharing is redundant for pair-sharing
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00313-3openalex-snapshot
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00316-9openalex-snapshot
Logical optimality of groundness analysis
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00194-7openalex-snapshot
The reduced relative power operation on abstract domains
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)00150-1openalex-snapshot
On the Relations between Disjunctive and Linear Logic Programming
inferred← citeshttps://doi.org/10.1017/s1471068401001351openalex-snapshot
Decomposing non-redundant sharing by complementation
inferred← citeshttps://doi.org/10.1017/s1471068402001254openalex-snapshot
An effective fixpoint semantics for linear logic programs
inferred← citeshttps://doi.org/10.1109/ase56229.2023.00069openalex-snapshot
Demystifying Template-Based Invariant Generation for Bit-Vector Programs
inferred← citeshttps://doi.org/10.1145/1042038.1042040openalex-snapshot
Making abstract domains condensing
inferred← citeshttps://doi.org/10.1145/293677.293680openalex-snapshot
A logical model for relational abstract domains
inferred← citeshttps://doi.org/10.1145/3385412.3385969openalex-snapshot
Polynomial invariant generation for non-deterministic recursive programs
inferred← citeshttps://doi.org/10.1145/3453483.3454076openalex-snapshot
Polynomial reachability witnesses via Stellensätze
inferred← citeshttps://doi.org/10.1145/3563295openalex-snapshot
Scalable linear invariant generation with Farkas’ lemma
inferred← citeshttps://doi.org/10.1145/3582267openalex-snapshot
A Correctness and Incorrectness Program Logic
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0101025openalex-snapshot
Decomposing Non-Redundant Sharing by Complementation
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.