On the public citation graph
Abstract extensionality: on the properties of incomplete abstract interpretations
0 signed · 55 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/11523468_107openalex-snapshot
Semantic-Based Code Obfuscation by Abstract Interpretation
inferredcites →https://doi.org/10.1007/11961635_26openalex-snapshot
A Survey of Control-Flow Obfuscations
inferredcites →https://doi.org/10.1007/3-540-61739-6_53openalex-snapshot
Abstract cofibered domains: Application to the alias analysis of untyped programs
inferredcites →https://doi.org/10.1007/978-3-319-06025-5_5openalex-snapshot
Intensionality, Definability and Computation
inferredcites →https://doi.org/10.1007/978-3-319-96142-2_8openalex-snapshot
Program Analysis Is Harder Than Verification: A Computability Perspective
inferredcites →https://doi.org/10.1007/978-3-540-75496-1_20openalex-snapshot
Specifying Imperative Data Obfuscations
inferredcites →https://doi.org/10.1007/978-3-642-10672-9_24openalex-snapshot
Refining Abstract Interpretation-Based Static Analyses with Hints
inferredcites →https://doi.org/10.1007/978-3-642-31485-8_3openalex-snapshot
A Short Introduction to Implicit Computational Complexity
inferredcites →https://doi.org/10.1007/978-3-642-33125-1_11openalex-snapshot
Making Abstract Interpretation Incomplete: Modeling the Potency of Obfuscation
inferredcites →https://doi.org/10.1007/978-3-642-38856-9_14openalex-snapshot
Abstract Semantic Differencing for Numerical Programs
inferredcites →https://doi.org/10.1007/978-3-662-54458-7_32openalex-snapshot
On the Semantics of Intensionality
inferredcites →https://doi.org/10.1007/s00165-018-0462-6openalex-snapshot
Code obfuscation against abstraction refinement attacks
inferredcites →https://doi.org/10.1007/s002360000038openalex-snapshot
Computational complexity via programming languages: constant factors do matter
inferredcites →https://doi.org/10.1016/j.scico.2004.03.010openalex-snapshot
Transformation by interpreter specialisation
inferredcites →https://doi.org/10.1017/s0960129514000358openalex-snapshot
Making abstract models complete
inferredcites →https://doi.org/10.1023/a:1010095604496openalex-snapshot
Partial Evaluation of Computation Process--An Approach to a Compiler-Compiler
inferredcites →https://doi.org/10.1090/s0002-9947-1953-0053041-6openalex-snapshot
Classes of Recursively Enumerable Sets and Their Decision Problems
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1109/sefm.2008.41openalex-snapshot
Hiding Information in Completeness Holes: New Perspectives in Code Obfuscation and Watermarking
inferredcites →https://doi.org/10.1145/1328438.1328455openalex-snapshot
The intensional content of Rice's theorem
inferredcites →https://doi.org/10.1145/2103746.2103761openalex-snapshot
Obfuscation by partial evaluation of distorted interpreters
inferredcites →https://doi.org/10.1145/2160158.2160159openalex-snapshot
On the (im)possibility of obfuscating programs
inferredcites →https://doi.org/10.1145/268946.268962openalex-snapshot
Manufacturing cheap, resilient, and stealthy opaque constructs
inferredcites →https://doi.org/10.1145/333979.333989openalex-snapshot
Making abstract interpretations complete
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
inferredcites →https://doi.org/10.5860/choice.30-6217openalex-snapshot
The formal semantics of programming languages: an introduction
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-031-21037-2_2openalex-snapshot
Decoupling the Ascending and Descending Phases in Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-031-22308-2_12openalex-snapshot
Property-Driven Code Obfuscations Reinterpreting Jones-Optimality in Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-031-22308-2_16openalex-snapshot
Local Completeness Logic on Kleene Algebra with Tests
inferred← citeshttps://doi.org/10.1007/978-3-031-22308-2_9openalex-snapshot
Deciding Program Properties via Complete Abstractions on Bounded Domains
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_1openalex-snapshot
Logics for Extensional, Locally Complete Analysis via Domain Refinements
inferred← citeshttps://doi.org/10.1007/978-3-031-34827-3_2openalex-snapshot
Monoidal Computer: Computability as a Structure
inferred← citeshttps://doi.org/10.1007/978-3-031-44245-2_14openalex-snapshot
How Fitting is Your Abstract Domain?
inferred← citeshttps://doi.org/10.1007/978-3-031-44245-2_7openalex-snapshot
A Formal Framework to Measure the Incompleteness of Abstract Interpretations
inferred← citeshttps://doi.org/10.1007/978-3-031-74776-2_2openalex-snapshot
Trace Partitioning as an Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-82703-7_1openalex-snapshot
Abstract Local Completeness
inferred← citeshttps://doi.org/10.1007/978-981-19-9601-6_8openalex-snapshot
Local Completeness in Abstract Interpretation
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104953openalex-snapshot
Intensional Kleene and Rice theorems for abstract program semantics
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115452openalex-snapshot
Broadening the applicability of local completeness analysis with intensional and extensional guarantees
inferred← citeshttps://doi.org/10.1017/s0140525x22000954openalex-snapshot
Framing, equivalence, and rational inference
inferred← citeshttps://doi.org/10.1109/ase56229.2023.00069openalex-snapshot
Demystifying Template-Based Invariant Generation for Bit-Vector Programs
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470608openalex-snapshot
A Logic for Locally Complete Abstract Interpretations
inferred← citeshttps://doi.org/10.1145/3498721openalex-snapshot
Partial (In)Completeness in abstract interpretation: limiting the imprecision in program analysis
inferred← citeshttps://doi.org/10.1145/3519939.3523453openalex-snapshot
Abstract interpretation repair
inferred← citeshttps://doi.org/10.1145/3571227openalex-snapshot
Witnessability of Undecidable Problems
inferred← citeshttps://doi.org/10.1145/3582267openalex-snapshot
A Correctness and Incorrectness Program Logic
inferred← citeshttps://doi.org/10.1145/3632897openalex-snapshot
Monotonicity and the Precision of Program Analysis
inferred← citeshttps://doi.org/10.1145/3656392openalex-snapshot
Compiling with Abstract Interpretation
inferred← citeshttps://doi.org/10.1145/3747539openalex-snapshot
Call-Guarded Abstract Definitional Interpreters
inferred← citeshttps://doi.org/10.1145/3808351openalex-snapshot
Abstract Interpretation with Confidence: Quantifying the Precision of Dataflow Analysis with Probabilities
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.