On the public citation graph

Reexecution in abstract interpretation of Prolog

https://doi.org/10.1007/bf01178260
0 signed · 43 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.1002/spe.4380230406openalex-snapshot
Generic abstract interpretation algorithms for Prolog: Two optimization techniques and their experimental evaluation
inferredcites →https://doi.org/10.1007/3-540-16492-8_95openalex-snapshot
Abstract interpretation of Prolog programs
inferredcites →https://doi.org/10.1007/3-540-55253-7_10openalex-snapshot
Detecting determinate computations by bottom-up abstract interpretation
inferredcites →https://doi.org/10.1007/3-540-56287-7_95openalex-snapshot
Improving the results of static analyses of programs by local decreasing iterations
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf01178576openalex-snapshot
Frameworks for abstract interpretation
inferredcites →https://doi.org/10.1016/0743-1066(90)90052-7openalex-snapshot
Solving large combinatorial problems in logic programming
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(92)90030-7openalex-snapshot
Abstract interpretation and application to logic programs
inferredcites →https://doi.org/10.1016/0743-1066(92)90053-6openalex-snapshot
Global flow analysis as a practical compilation tool
inferredcites →https://doi.org/10.1109/lics.1991.151656openalex-snapshot
Prop revisited: propositional formula as abstract domain for groundness analysis
inferredcites →https://doi.org/10.1145/143165.143184openalex-snapshot
Inductive definitions, semantics and abstract interpretations
inferredcites →https://doi.org/10.1145/151646.151650openalex-snapshot
A general framework for semantics-based bottom-up abstract interpretation of logic programs
inferredcites →https://doi.org/10.1145/154630.154641openalex-snapshot
Groundness analysis for Prolog
inferredcites →https://doi.org/10.1145/174625.174627openalex-snapshot
Experimental evaluation of a generic abstract interpretation algorithm for PROLOG
inferredcites →https://doi.org/10.1145/174675.177880openalex-snapshot
Combinations of abstract domains for logic programming
inferredcites →https://doi.org/10.1145/177492.177650openalex-snapshot
Denotational abstract interpretation of logic programs
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/65979.65984openalex-snapshot
Functional computations in logic 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.4380230406openalex-snapshot
Generic abstract interpretation algorithms for Prolog: Two optimization techniques and their experimental evaluation
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_39openalex-snapshot
Reexecution-Based Analysis of Logic Programs with Delay Declarations
inferred← citeshttps://doi.org/10.1007/3-540-56282-6_20openalex-snapshot
Propagation: a new operation in a framework for abstract interpretation of logic programs
inferred← citeshttps://doi.org/10.1007/3-540-58485-4_30openalex-snapshot
The costs and benefits of abstract interpretation-driven Prolog optimization
inferred← citeshttps://doi.org/10.1007/3-540-59155-9_9openalex-snapshot
Abstract interpretation and finite domain symbolic constraints
inferred← citeshttps://doi.org/10.1007/3-540-59479-5_17openalex-snapshot
A generalized semantics for concurrent constraint languages and their abstract interpretation
inferred← citeshttps://doi.org/10.1007/3-540-60299-2_21openalex-snapshot
Guarded constructive disjunction: Angel or demon?
inferred← citeshttps://doi.org/10.1007/3-540-63875-x_55openalex-snapshot
Automated verification of behavioural properties of prolog programs
inferred← citeshttps://doi.org/10.1007/978-94-011-7108-3_12openalex-snapshot
Towards a Broader Theory for Abstract Interpretation
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/bfb0032758openalex-snapshot
On the desirable link between theory and practice in abstract interpretation (extended abstract)
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00029-6openalex-snapshot
Evaluation of the domain prop
inferred← citeshttps://doi.org/10.1016/s0167-6423(99)00045-3openalex-snapshot
Combinations of abstract domains for logic programming: open product and generic pattern construction
inferred← citeshttps://doi.org/10.1016/s0743-1066(00)00006-6openalex-snapshot
A simple polynomial groundness analysis for logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00052-0openalex-snapshot
Detection and optimization of suspension-free logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10032-8openalex-snapshot
Automated verification of Prolog programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00148-3openalex-snapshot
Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations
inferred← citeshttps://doi.org/10.1017/s1471068402001114openalex-snapshot
Sequence-based abstract interpretation of Prolog
inferred← citeshttps://doi.org/10.1145/1352582.1352585openalex-snapshot
Inferring non-suspension conditions for logic programs with dynamic scheduling
inferred← citeshttps://doi.org/10.1145/174625.174627openalex-snapshot
Experimental evaluation of a generic abstract interpretation algorithm for PROLOG
inferred← citeshttps://doi.org/10.1145/174675.177880openalex-snapshot
Combinations of abstract domains for logic programming
inferred← citeshttps://doi.org/10.1145/215465.215467openalex-snapshot
A symbolic constraint solving framework for analysis of logic programs
inferred← citeshttps://doi.org/10.3233/fi-2018-1650openalex-snapshot
Reference Abstract Domains and Applications to String Analysis
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.