On the public citation graph

Specialisation of Prolog and FCP programs using abstract interpretation

https://doi.org/10.1007/bf03037136
0 signed · 60 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-10699-5_102openalex-snapshot
Scenarios: A model of non-determinate computation
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-82453-1_17openalex-snapshot
On the Development of Reactive Systems
inferredcites →https://doi.org/10.1007/bf03037135openalex-snapshot
Unfolding rules for GHC programs
inferredcites →https://doi.org/10.1016/0020-0190(77)90078-3openalex-snapshot
On the partial computation principle
inferredcites →https://doi.org/10.1016/s0747-7171(85)80027-4openalex-snapshot
Properties of substitutions and unifications
inferredcites →https://doi.org/10.1109/lics.1988.5130openalex-snapshot
Fully abstract denotational semantics for flat Concurrent Prolog
inferredcites →https://doi.org/10.1109/mc.1986.1663307openalex-snapshot
Concurrent Prolog: A Progress Report
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/988346.988358openalex-snapshot
An experiment in partial evaluation
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.1002/spe.4380231204openalex-snapshot
QD‐Janus: A sequential implementation of Janus in Prolog
inferred← citeshttps://doi.org/10.1007/11562931_32openalex-snapshot
A Generic Framework for the Analysis and Specialization of Logic Programs
inferred← citeshttps://doi.org/10.1007/11823230_8openalex-snapshot
Abstract Interpretation with Specialized Definitions
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-50820-1_39openalex-snapshot
An application of abstract interpretation in source level program transformation
inferred← citeshttps://doi.org/10.1007/3-540-53557-8_20openalex-snapshot
Negation in logic programming: A formalization in constructive logic
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_13openalex-snapshot
Prolog semantics for measuring space consumption
inferred← citeshttps://doi.org/10.1007/3-540-55460-2_7openalex-snapshot
Deep logic program transformation using abstract interpretation
inferred← citeshttps://doi.org/10.1007/3-540-58216-9_46openalex-snapshot
Goal dependent vs. goal independent analysis of logic programs
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-62718-9_10openalex-snapshot
Abstract specialization and its application to program parallelization
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_12openalex-snapshot
Abstract Intepretation and recursive behaviour of logic programs
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_8openalex-snapshot
Deriving Transformations of Logic Programs Using Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-642-76799-9_10openalex-snapshot
The Family of Concurrent Logic Programming Languages
inferred← citeshttps://doi.org/10.1007/bf03037145openalex-snapshot
Annotated bibliography on partial evaluation and mixed computation
inferred← citeshttps://doi.org/10.1007/bf03037167openalex-snapshot
The derivation of an algorithm for program specialisation
inferred← citeshttps://doi.org/10.1007/bf03038308openalex-snapshot
Partial deduction of logic programs wrt well-founded semantics
inferred← citeshttps://doi.org/10.1007/bfb0013839openalex-snapshot
Partial deduction of logic programs WRT well-founded semantics
inferred← citeshttps://doi.org/10.1016/0169-023x(90)90017-8openalex-snapshot
Query evaluation in recursive databases: bottom-up and top-down reconciled
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90030-7openalex-snapshot
Abstract interpretation and application to logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90031-wopenalex-snapshot
Bottom-up dataflow analysis of normal logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90033-yopenalex-snapshot
Multiple specialization using minimal-function graph semantics
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90035-2openalex-snapshot
Compile-time derivation of variable dependency using abstract interpretation
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90011-5openalex-snapshot
Abstract interpretation based on oldt resolution
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/j.scico.2004.03.010openalex-snapshot
Transformation by interpreter specialisation
inferred← citeshttps://doi.org/10.1016/j.scico.2017.01.002openalex-snapshot
Constraint specialisation in Horn clause verification
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00143-4openalex-snapshot
Exploiting goal independence in the analysis of logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00031-xopenalex-snapshot
Abstract multiple specialization and its application to program parallelization
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/s0269888900006275openalex-snapshot
Trends in applying abstract interpretation
inferred← citeshttps://doi.org/10.1023/a:1012936614361openalex-snapshot
Regular Tree Languages as an Abstract Domain in Program Specialisation
inferred← citeshttps://doi.org/10.1145/115865.115871openalex-snapshot
Toward the partial evaluation of CLP languages
inferred← citeshttps://doi.org/10.1145/115866.115871openalex-snapshot
Toward the partial evaluation of CLP languages
inferred← citeshttps://doi.org/10.1145/146585.146624openalex-snapshot
Efficient dataflow analysis of logic programs
inferred← citeshttps://doi.org/10.1145/151646.151650openalex-snapshot
A general framework for semantics-based bottom-up abstract interpretation of logic programs
inferred← citeshttps://doi.org/10.1145/154630.154640openalex-snapshot
Tutorial on specialisation of logic programs
inferred← citeshttps://doi.org/10.1145/158511.158707openalex-snapshot
Tutorial notes on partial evaluation
inferred← citeshttps://doi.org/10.1145/215465.215561openalex-snapshot
Implementation of multiple specialization in logic programs
inferred← citeshttps://doi.org/10.1145/2678015.2682544openalex-snapshot
Constraint Specialisation in Horn Clause Verification
inferred← citeshttps://doi.org/10.1145/72551.72555openalex-snapshot
The family of concurrent logic programming languages
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.5282/ubm/epub.8509openalex-snapshot
Upside-down Deduction
inferred← citeshttps://doi.org/10.9734/bjmcs/2015/14398openalex-snapshot
Information Flow in Concurrent Logic Programming
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.