On the public citation graph
The derivation of an algorithm for program specialisation
0 signed · 72 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-16492-8_66openalex-snapshot
OLD resolution with tabulation
inferredcites →https://doi.org/10.1007/3-540-16492-8_95openalex-snapshot
Abstract interpretation of Prolog programs
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf03037136openalex-snapshot
Specialisation of Prolog and FCP programs using abstract interpretation
inferredcites →https://doi.org/10.1007/bf03037145openalex-snapshot
Annotated bibliography on partial evaluation and mixed computation
inferredcites →https://doi.org/10.1016/0743-1066(91)80001-topenalex-snapshot
A practical framework for theabstract interpretation of logic programs
inferredcites →https://doi.org/10.1016/0743-1066(91)90027-mopenalex-snapshot
Partial evaluation in logic programming
inferredcites →https://doi.org/10.1016/0950-5849(88)90032-8openalex-snapshot
Abstract interpretation of declarative languages
inferredcites →https://doi.org/10.1145/512644.512672openalex-snapshot
Data flow analysis of applicative programs using minimal function graphs
inferredcites →https://doi.org/10.1145/582153.582181openalex-snapshot
Partial evaluation as a means for inferencing data structures in an applicative language
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10720327_5openalex-snapshot
Infinite State Model Checking by Abstract Interpretation and Program Specialisation
inferred← citeshttps://doi.org/10.1007/10720327_7openalex-snapshot
Imperative Program Specialisation: An Approach Using CLP
inferred← citeshttps://doi.org/10.1007/11680093_6openalex-snapshot
Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_17openalex-snapshot
Homeomorphic Embedding for Online Termination of Symbolic Methods
inferred← citeshttps://doi.org/10.1007/3-540-47018-2_11openalex-snapshot
Advanced Logic Program Specialisation
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_15openalex-snapshot
Analysis of Imperative Programs through Analysis of Constraint Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_109openalex-snapshot
A technique for recursive invariance detection and selective program specialization
inferred← citeshttps://doi.org/10.1007/3-540-55460-2_18openalex-snapshot
On abstracting the procedural behaviour of logic programs
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_89openalex-snapshot
Higher-order chaotic iteration sequences
inferred← citeshttps://doi.org/10.1007/3-540-58485-4_50openalex-snapshot
Finding fixpoints in finite function spaces using neededness analysis and chaotic iteration
inferred← citeshttps://doi.org/10.1007/3-540-58792-6_3openalex-snapshot
Using call/exit analysis for logic program transformation
inferred← citeshttps://doi.org/10.1007/3-540-60939-3_1openalex-snapshot
Ecological partial deduction: Preserving characteristic trees without constraints
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_12openalex-snapshot
Efficiently generating efficient generating extensions in prolog
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_13openalex-snapshot
Global control for partial deduction through characteristic atoms and global trees
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_18openalex-snapshot
A comparative revisitation of some program transformation techniques
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_7openalex-snapshot
Regular approximation of computation paths in logic and functional languages
inferred← citeshttps://doi.org/10.1007/3-540-62718-9_10openalex-snapshot
Abstract specialization and its application to program parallelization
inferred← citeshttps://doi.org/10.1007/3-540-62718-9_16openalex-snapshot
Specialising meta-level compositions of logic programs
inferred← citeshttps://doi.org/10.1007/3-540-62718-9_5openalex-snapshot
Conjunctive partial deduction in practice
inferred← citeshttps://doi.org/10.1007/978-1-4471-3234-9_17openalex-snapshot
Memoing with Abstract Answers and Delphi Lemmas
inferred← citeshttps://doi.org/10.1007/978-1-4471-3234-9_18openalex-snapshot
Using Abstract Interpretation for Goal Replacement
inferred← citeshttps://doi.org/10.1007/978-1-4471-3494-7_15openalex-snapshot
Specialisation of a Unification Algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4471-3560-9_16openalex-snapshot
Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-1-4471-3560-9_8openalex-snapshot
Deriving Transformations of Logic Programs Using Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_6openalex-snapshot
Forward Slicing by Conjunctive Partial Deduction and Argument Filtering
inferred← citeshttps://doi.org/10.1007/978-3-642-12592-8_12openalex-snapshot
Towards Just-In-Time Partial Evaluation of Prolog
inferred← citeshttps://doi.org/10.1007/bf03037314openalex-snapshot
A program specialiser for meta-level compositions of logic programs
inferred← citeshttps://doi.org/10.1007/bf03037483openalex-snapshot
Constrained partial deduction and the preservation of characteristic trees
inferred← citeshttps://doi.org/10.1007/bf03037527openalex-snapshot
A general criterion for avoiding infinite unfolding during partial deduction
inferred← citeshttps://doi.org/10.1007/bfb0053561openalex-snapshot
A polyvariant binding-time analysis for off-line partial deduction
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90028-0openalex-snapshot
Transformation of logic programs: Foundations and techniques
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90039-6openalex-snapshot
Partial deduction of updateable definite logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00149-2openalex-snapshot
Automatic finite unfolding using well-founded measures
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.01.008openalex-snapshot
A Study on the Practicality of Poly-Controlled Partial Evaluation
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00105-7openalex-snapshot
On Delphi lemmas and other memoing techniques for deterministic logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10012-7openalex-snapshot
Creating specialised integrity checks through partial evaluation of meta-interpreters
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00030-8openalex-snapshot
Conjunctive partial deduction: foundations, control, algorithms, and experiments
inferred← citeshttps://doi.org/10.1016/s0747-7171(06)80003-9openalex-snapshot
Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation
inferred← citeshttps://doi.org/10.1017/s0956796800001167openalex-snapshot
On the generation of specializers
inferred← citeshttps://doi.org/10.1017/s147106840200145xopenalex-snapshot
Logic program specialisation through partial deduction: Control issues
inferred← citeshttps://doi.org/10.1017/s1471068403001662openalex-snapshot
Offline specialisation in Prolog using a hand-written compiler generator
inferred← citeshttps://doi.org/10.1017/s1471068421000600openalex-snapshot
Symbolic Specialization of Rewriting Logic Theories withPresto
inferred← citeshttps://doi.org/10.1142/s0218213016500019openalex-snapshot
Mode Analysis During Program Development
inferred← citeshttps://doi.org/10.1145/1069774.1069777openalex-snapshot
Self-tuning resource aware specialisation for prolog
inferred← citeshttps://doi.org/10.1145/1111542.1111557openalex-snapshot
The Ecce and Logen partial evaluators and their web interfaces
inferred← citeshttps://doi.org/10.1145/115865.115871openalex-snapshot
Toward the partial evaluation of CLP languages
inferred← citeshttps://doi.org/10.1145/1389449.1389459openalex-snapshot
Call pattern analysis for functional logic programs
inferred← citeshttps://doi.org/10.1145/154630.154640openalex-snapshot
Tutorial on specialisation of logic programs
inferred← citeshttps://doi.org/10.1145/215465.215561openalex-snapshot
Implementation of multiple specialization in logic programs
inferred← citeshttps://doi.org/10.1145/215465.215598openalex-snapshot
Towards creating specialised integrity checks through partial evaluation of meta-interpreters
inferred← citeshttps://doi.org/10.1145/271510.271525openalex-snapshot
Controlling generalization and polyvariance in partial deduction of normal logic programs
inferred← citeshttps://doi.org/10.1145/289121.289125openalex-snapshot
Some achievements and prospects in partial deduction
inferred← citeshttps://doi.org/10.1145/289121.289133openalex-snapshot
The role of trace abstractions in program specialization algorithms
inferred← citeshttps://doi.org/10.1145/3131851.3131863openalex-snapshot
Selective unification in constraint logic programming
inferred← citeshttps://doi.org/10.1145/777388.777393openalex-snapshot
Abstract specialization and its applications
inferred← citeshttps://doi.org/10.1145/966049.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
inferred← citeshttps://doi.org/10.20868/upm.thesis.329openalex-snapshot
Poly-controlled partial evaluation and its application to resource-aware program specialization
inferred← citeshttps://doi.org/10.25549/usctheses-c20-172609openalex-snapshot
Abstract interpretation for the compile-time optimization of logic programs
inferred← citeshttps://doi.org/10.4204/eptcs.129.7openalex-snapshot
Abstract Interpretation as a Programming Language
inferred← citeshttps://doi.org/10.7551/mitpress/4298.003.0059openalex-snapshot
Ensuring Global Termination of Partial Deduction While Allowing Flexible Polyvariance
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.