On the public citation graph

Intuitionistic implication in abstract interpretation

https://doi.org/10.1007/bfb0033844
0 signed · 31 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_32openalex-snapshot
Directional type checking of logic programs
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-58485-4_47openalex-snapshot
Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop
inferredcites →https://doi.org/10.1007/3-540-61055-3_34openalex-snapshot
Compositional optimization of disjunctive abstract interpretations
inferredcites →https://doi.org/10.1007/bfb0036935openalex-snapshot
Strong abstract interpretation using power domains
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/b978-0-444-88074-1.50015-9openalex-snapshot
Logic Programming
inferredcites →https://doi.org/10.1109/iccl.1994.288389openalex-snapshot
Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages)
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.1109/lics.1992.185531openalex-snapshot
Disjunctive strictness analysis
inferredcites →https://doi.org/10.1109/sfcs.1980.16openalex-snapshot
Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra
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/158511.158642openalex-snapshot
Automatic generation and management of interprocedural program analyses
inferredcites →https://doi.org/10.1145/174675.177858openalex-snapshot
Deriving algorithms from type inference systems
inferredcites →https://doi.org/10.1145/174675.177880openalex-snapshot
Combinations of abstract domains for logic programming
inferredcites →https://doi.org/10.1145/200994.200998openalex-snapshot
Improving abstract interpretations by combining domains
inferredcites →https://doi.org/10.1145/234528.234742openalex-snapshot
A unifying view of abstract domain design
inferredcites →https://doi.org/10.1145/239912.239914openalex-snapshot
Complementation in abstract interpretation
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.7551/mitpress/4301.003.0036openalex-snapshot
Functional Dependencies and Moore-Set Completions of Abstract Interpretations and Semantics

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-47764-0_9openalex-snapshot
Parameterizing a Groundness Analysis of Logic Programs
inferred← citeshttps://doi.org/10.1007/bfb0032735openalex-snapshot
Logical optimality of groundness analysis
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.1007/s100090050016openalex-snapshot
Semantics-based program analysis for logic-based languages using XSB
inferred← citeshttps://doi.org/10.1016/j.scico.2003.08.002openalex-snapshot
Abstract interpretation based verification of logic programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00316-9openalex-snapshot
Logical optimality of groundness analysis
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00112-4openalex-snapshot
Abstract Interpretation based Verification of Logic Programs
inferred← citeshttps://doi.org/10.1109/dcds.2011.5970325openalex-snapshot
SAT-based abstraction refinement for programmable logic controllers
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.