On the public citation graph

Deriving linear size relations for logic programs by abstract interpretation

https://doi.org/10.1007/bf03038311
0 signed · 35 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-52837-7openalex-snapshot
Termination Proofs for Logic Programs
inferredcites →https://doi.org/10.1007/3-540-55844-6_143openalex-snapshot
Derivation of linear size relations by abstract interpretation
inferredcites →https://doi.org/10.1007/978-1-4471-3560-9_12openalex-snapshot
Automatic Termination Analysis
inferredcites →https://doi.org/10.1007/978-3-642-85983-0_9openalex-snapshot
Abstract Interpretation for (Constraint) Logic Programming
inferredcites →https://doi.org/10.1007/bf00268497openalex-snapshot
Affine relationships among variables of a program
inferredcites →https://doi.org/10.1007/bf01530930openalex-snapshot
Deriving constraints among argument sizes in logic programs
inferredcites →https://doi.org/10.1007/bfb0013540openalex-snapshot
Improving the efficiency of constraint logic programming languages by deriving specialized versions
inferredcites →https://doi.org/10.1016/0304-3975(89)90070-4openalex-snapshot
Declarative modeling of the operational behavior of logic languages
inferredcites →https://doi.org/10.1016/0304-3975(92)00019-nopenalex-snapshot
Norms on terms and their use in proving universal termination of a logic program
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)90032-xopenalex-snapshot
Deriving descriptions of possible values of program variables by means of abstract interpretation
inferredcites →https://doi.org/10.1016/0743-1066(94)90027-2openalex-snapshot
Termination of logic programs: the never-ending story
inferredcites →https://doi.org/10.1145/113413.113434openalex-snapshot
Inference of inequality constraints in logic programs (extended abstracts)
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/298514.298541openalex-snapshot
Deriving constraints among argument sizes in logic programs (extended abstract)
inferredcites →https://doi.org/10.1145/42282.42285openalex-snapshot
Efficient tests for top-down termination of logical rules
inferredcites →https://doi.org/10.1145/512760.512770openalex-snapshot
Automatic discovery of linear restraints among variables of a program
inferredcites →https://doi.org/10.1145/93542.93564openalex-snapshot
Task granularity analysis in logic programs
inferredcites →https://doi.org/10.1145/93548.93564openalex-snapshot
Task granularity analysis 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.1007/11547662_23openalex-snapshot
Exploiting Sparsity in Polyhedral Analysis
inferred← citeshttps://doi.org/10.1007/3-540-44404-1_23openalex-snapshot
An Abstract Interpretation Approach to Termination of Logic Programs
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-45653-8_47openalex-snapshot
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_9openalex-snapshot
Combining Norms to Prove Termination
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10025-0openalex-snapshot
Termination of well-moded programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00006-0openalex-snapshot
A semantic basis for the termination analysis of logic programs
inferred← citeshttps://doi.org/10.1017/s1471068404002236openalex-snapshot
Inferring termination conditions for logic programs using backwards analysis
inferred← citeshttps://doi.org/10.1145/1216374.1216378openalex-snapshot
Termination analysis of logic programs through combination of type-based norms
inferred← citeshttps://doi.org/10.1145/330643.330645openalex-snapshot
Constraint-based termination analysis of logic programs
inferred← citeshttps://doi.org/10.1145/773184.773193openalex-snapshot
Termination of well-typed logic programs
inferred← citeshttps://doi.org/10.1145/937555.937556openalex-snapshot
A dynamic approach to characterizing termination of general logic programs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0006031openalex-snapshot
Verifying Termination of General Logic Programs with Concrete Queries
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0312023openalex-snapshot
Inferring Termination Conditions for Logic Programs using Backwards Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0512055openalex-snapshot
Termination Analysis of General Logic Programs for Moded Queries: A Dynamic Approach
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.