On the public citation graph
Frameworks for abstract interpretation
0 signed · 47 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-10843-2_10openalex-snapshot
Flow analysis of lambda expressions
inferredcites →https://doi.org/10.1007/3-540-16446-4_9openalex-snapshot
A relational framework for abstract interpretation
inferredcites →https://doi.org/10.1007/bf00263194openalex-snapshot
A denotational framework for data flow analysis
inferredcites →https://doi.org/10.1016/0004-3702(81)90015-1openalex-snapshot
Theorem proving with abstraction
inferredcites →https://doi.org/10.1016/0167-6423(86)90010-9openalex-snapshot
Strictness analysis for higher-order functions
inferredcites →https://doi.org/10.1016/0304-3975(84)90119-1openalex-snapshot
Enumeration of success patterns in logic programs
inferredcites →https://doi.org/10.1016/0743-1066(92)90031-wopenalex-snapshot
Bottom-up dataflow analysis of normal logic programs
inferredcites →https://doi.org/10.1016/0890-5401(88)90041-7openalex-snapshot
Strictness analysis and denotational abstract interpretation
inferredcites →https://doi.org/10.1016/0950-5849(88)90032-8openalex-snapshot
Abstract interpretation of declarative languages
inferredcites →https://doi.org/10.1016/b978-0-08-057090-7.50011-4openalex-snapshot
Information Processing
inferredcites →https://doi.org/10.1016/c2009-0-08545-6openalex-snapshot
Qualitative Reasoning About Physical Systems
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
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.1007/3-540-44577-3_10openalex-snapshot
Abstract Interpretation Based Formal Methods and Future Challenges
inferred← citeshttps://doi.org/10.1007/3-540-45635-x_17openalex-snapshot
Higher-Precision Groundness Analysis
inferred← citeshttps://doi.org/10.1007/3-540-48092-7_13openalex-snapshot
Optimization Under the Perspective of Soundness, Completeness, and Reusability
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_2openalex-snapshot
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
inferred← citeshttps://doi.org/10.1007/3-540-49059-0_25openalex-snapshot
From DFA-Frameworks to DFA-Generators: A Unifying Multiparadigm Approach
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_13openalex-snapshot
Parallelism for free: Bitvector analyses ⇒ no state explosion!
inferred← citeshttps://doi.org/10.1007/3-540-61053-7_56openalex-snapshot
Non-monotone fixpoint iterations to resolve second order effects
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73580-9_10openalex-snapshot
Relaxation of Qualitative Constraint Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-15769-1_11openalex-snapshot
Automatic Abstraction for Intervals Using Boolean Formulae
inferred← citeshttps://doi.org/10.1007/978-3-642-19718-5_6openalex-snapshot
Transfer Function Synthesis without Quantifier Elimination
inferred← citeshttps://doi.org/10.1007/bf01178260openalex-snapshot
Reexecution in abstract interpretation of Prolog
inferred← citeshttps://doi.org/10.1007/bfb0015257openalex-snapshot
Abstracting unification: A key step in the design of logic program analyses
inferred← citeshttps://doi.org/10.1007/bfb0032757openalex-snapshot
Abstract interpretation: A theory of approximate computation
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00137-0openalex-snapshot
The quotient of an abstract interpretation
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00208-9openalex-snapshot
Eliminating partially dead code in explicitly parallel programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10010-3openalex-snapshot
Polymorphic type analysis in logic programs by abstract interpretation
inferred← citeshttps://doi.org/10.1017/s1471068402001114openalex-snapshot
Sequence-based abstract interpretation of Prolog
inferred← citeshttps://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)
inferred← citeshttps://doi.org/10.1109/tools.1997.654711openalex-snapshot
SOLAT-a Simple Object-Oriented Language Analyzing Tool
inferred← citeshttps://doi.org/10.1145/177492.177650openalex-snapshot
Denotational abstract interpretation of logic programs
inferred← citeshttps://doi.org/10.1145/232706.232734openalex-snapshot
Global analysis of constraint logic programs
inferred← citeshttps://doi.org/10.1145/244795.244800openalex-snapshot
Abstract interpretation of reactive systems
inferred← citeshttps://doi.org/10.1145/301104.301106openalex-snapshot
Code motion for explicitly parallel programs
inferred← citeshttps://doi.org/10.1145/329366.301106openalex-snapshot
Code motion for explicitly parallel programs
inferred← citeshttps://doi.org/10.20868/upm.thesis.21607openalex-snapshot
Independence, Global analysis, and parallelism, in dinamically scheduled constraint logic programming.
inferred← citeshttps://doi.org/10.2168/lmcs-8(3:17)2012openalex-snapshot
Transfer Function Synthesis without Quantifier Elimination
inferred← citeshttps://doi.org/10.3166/ria.20.31-62openalex-snapshot
Abstraction de réseaux de contraintes
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9811012openalex-snapshot
Deriving Abstract Semantics for Forward Analysis of Normal Logic Programs
inferred← citeshttps://doi.org/10.4995/thesis/10251/55796openalex-snapshot
Análisis semántico y transformación de programas lógico-funcionales.
inferred← citeshttps://doi.org/10.6100/ir462072openalex-snapshot
Abstract interpretation and partition refinement for model checking
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.