On the public citation graph

Logical optimality of groundness analysis

https://doi.org/10.1007/bfb0032735
0 signed · 30 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-58485-4_46openalex-snapshot
Boolean functions for dependency analysis: Algebraic properties and efficient representation
inferredcites →https://doi.org/10.1007/3-540-61055-3_34openalex-snapshot
Compositional optimization of disjunctive abstract interpretations
inferredcites →https://doi.org/10.1007/978-3-642-67678-9openalex-snapshot
A Compendium of Continuous Lattices
inferredcites →https://doi.org/10.1007/978-3-642-67678-9_3openalex-snapshot
Topology of Continuous Lattices: The Scott Topology
inferredcites →https://doi.org/10.1007/bfb0033844openalex-snapshot
Intuitionistic implication in abstract interpretation
inferredcites →https://doi.org/10.1016/s0304-3975(98)00007-3openalex-snapshot
The powerset operator on abstract interpretations
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/176454.176519openalex-snapshot
Precise and efficient groundness analysis for logic programs
inferredcites →https://doi.org/10.1145/177492.177650openalex-snapshot
Denotational abstract interpretation of logic programs
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
inferredcites →https://doi.org/10.1145/65979.65983openalex-snapshot
Static inference of modes and data dependencies 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.1006/inco.2000.3024openalex-snapshot
A Theory of Observables for 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-45499-3_14openalex-snapshot
Analysis of Downward Closed Properties of Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_10openalex-snapshot
Abstract Domains for Universal and Existential Properties
inferred← citeshttps://doi.org/10.1007/3-540-47764-0_9openalex-snapshot
Parameterizing a Groundness Analysis of Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-48294-6_6openalex-snapshot
Freeness Analysis Through Linear Refinement
inferred← citeshttps://doi.org/10.1007/bfb0056613openalex-snapshot
An experiment in domain refinement: Type domains and type representations for logic programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.021openalex-snapshot
Transforming semantics by abstract interpretation
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00194-7openalex-snapshot
The reduced relative power operation on abstract domains
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00112-4openalex-snapshot
Abstract Interpretation based Verification of Logic Programs
inferred← citeshttps://doi.org/10.1017/s1471068401001351openalex-snapshot
Decomposing non-redundant sharing by complementation
inferred← citeshttps://doi.org/10.1093/logcom/12.3.497openalex-snapshot
Generalizing Def and Pos to Type Analysis
inferred← citeshttps://doi.org/10.1109/tase.2014.12openalex-snapshot
Parametrizing Program Analysis
inferred← citeshttps://doi.org/10.1145/293677.293680openalex-snapshot
A logical model for relational abstract domains
inferred← citeshttps://doi.org/10.1145/328690.328699openalex-snapshot
Non pair-sharing and freeness analysis through linear refinement
inferred← citeshttps://doi.org/10.1145/328691.328699openalex-snapshot
Non pair-sharing and freeness analysis through linear refinement
inferred← citeshttps://doi.org/10.1145/503032.503040openalex-snapshot
Compositionality in the puzzle of semantics
inferred← citeshttps://doi.org/10.5281/zenodo.41652openalex-snapshot
Blind Channel Identification In Speech Using The Long-Term Average Speech Spectrum
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.