On the public citation graph

Combining abstract interpretation and partial evaluation (brief overview)

https://doi.org/10.1007/bfb0032761
0 signed · 33 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/3-540-57264-3_34openalex-snapshot
Occam's razor in metacomputation: the notion of a perfect process tree
inferredcites →https://doi.org/10.1007/bfb0032402openalex-snapshot
The essence of program transformation by partial evaluation and driving
inferredcites →https://doi.org/10.1016/0020-0190(89)90113-0openalex-snapshot
Partial evaluation of pattern matching in strings
inferredcites →https://doi.org/10.1016/0304-3975(82)90111-6openalex-snapshot
Mixed computation: potential applications and problems for study
inferredcites →https://doi.org/10.1016/0950-5849(88)90032-8openalex-snapshot
Abstract interpretation of declarative languages
inferredcites →https://doi.org/10.1093/oso/9780198537809.003.0005openalex-snapshot
Abstract interpretation: a semantics-based tool for program analysis
inferredcites →https://doi.org/10.1109/sfcs.1980.16openalex-snapshot
Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra
inferredcites →https://doi.org/10.1137/0206024openalex-snapshot
Fast Pattern Matching in Strings
inferredcites →https://doi.org/10.1145/182409.156781openalex-snapshot
Using Hindley-Milner type inference to optimise list representation
inferredcites →https://doi.org/10.1145/182409.182453openalex-snapshot
Unrolling lists
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/5956.5957openalex-snapshot
The concept of a supercompiler

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11417019_4openalex-snapshot
Abstract Interpretation-Based Verification of Non-functional Requirements
inferred← citeshttps://doi.org/10.1007/11823230_8openalex-snapshot
Abstract Interpretation with Specialized Definitions
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-45013-0_8openalex-snapshot
Convex Hull Abstractions in Specialization of CLP Programs
inferred← citeshttps://doi.org/10.1007/3-540-45607-4_6openalex-snapshot
Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-47018-2_11openalex-snapshot
Advanced Logic Program Specialisation
inferred← citeshttps://doi.org/10.1007/978-3-031-30820-8_27openalex-snapshot
Context-Sensitive Meta-Constraint Systems for Explainable Program Analysis
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80954-xopenalex-snapshot
A Case Study in Abstract Interpretation Based Program Transformation
inferred← citeshttps://doi.org/10.1017/s0956796802004586openalex-snapshot
Program specialization for execution monitoring
inferred← citeshttps://doi.org/10.1017/s147106840200145xopenalex-snapshot
Logic program specialisation through partial deduction: Control issues
inferred← citeshttps://doi.org/10.1023/a:1012936614361openalex-snapshot
Regular Tree Languages as an Abstract Domain in Program Specialisation
inferred← citeshttps://doi.org/10.1109/iadcc.2014.6779534openalex-snapshot
Interpretation: An illustration
inferred← citeshttps://doi.org/10.1145/2603088.2603165openalex-snapshot
Abstract interpretation
inferred← citeshttps://doi.org/10.1145/2678015.2682544openalex-snapshot
Constraint Specialisation in Horn Clause Verification
inferred← citeshttps://doi.org/10.1145/289121.289137openalex-snapshot
Extending partial deduction to tabled execution
inferred← citeshttps://doi.org/10.1145/289121.289143openalex-snapshot
Using partial evaluation to enable verification of concurrent software
inferred← citeshttps://doi.org/10.1145/3136000.3136011openalex-snapshot
A Scala framework for supercompilation
inferred← citeshttps://doi.org/10.1145/328690.328698openalex-snapshot
Using regular approximations for generalisation during partial evalution
inferred← citeshttps://doi.org/10.1145/503272.503290openalex-snapshot
Systematic design of program transformation frameworks by abstract interpretation
inferred← citeshttps://doi.org/10.1145/777388.777393openalex-snapshot
Abstract specialization and its applications
inferred← citeshttps://doi.org/10.1145/982158.982159openalex-snapshot
A framework for the integration of partial evaluation and abstract interpretation of logic programs
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.