On the public citation graph
Set-based analysis for logic programming and tree automata
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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-55844-6_142openalex-snapshot
Comparing the Galois connection and widening/narrowing approaches to abstract interpretation
inferredcites →https://doi.org/10.1007/978-1-4471-3196-0_7openalex-snapshot
An Operational Model of Strictness Properties and its Abstractions
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1016/0004-3702(84)90017-1openalex-snapshot
A polymorphic type system for prolog
inferredcites →https://doi.org/10.1016/0743-1066(92)90030-7openalex-snapshot
Abstract interpretation and application to logic programs
inferredcites →https://doi.org/10.1093/logcom/2.4.511openalex-snapshot
Abstract Interpretation Frameworks
inferredcites →https://doi.org/10.1109/iccl.1992.185476openalex-snapshot
Experimental evaluation of a generic abstract interpretation algorithm for Prolog
inferredcites →https://doi.org/10.1109/lics.1991.151654openalex-snapshot
Logic programs as types for logic programs
inferredcites →https://doi.org/10.1109/lics.1992.185544openalex-snapshot
An engine for logic program analysis
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/182409.182495openalex-snapshot
Set-based analysis of ML programs
inferredcites →https://doi.org/10.1145/182590.182495openalex-snapshot
Set-based analysis of ML programs
inferredcites →https://doi.org/10.1145/224164.224199openalex-snapshot
Formal language, grammar and set-constraint-based program analysis by abstract interpretation
inferredcites →https://doi.org/10.1145/96709.96729openalex-snapshot
A finite presentation theorem for approximating logic programs
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0058openalex-snapshot
Fast and Precise Regular Approximations of 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.2001.2952openalex-snapshot
Set Constraints with Intersection
inferred← citeshttps://doi.org/10.1007/11814771_45openalex-snapshot
Tree Automata with Equality Constraints Modulo Equational Theories
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_5openalex-snapshot
Directional Type Checking for Logic Programs: Beyond Discriminative Types
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_17openalex-snapshot
Directional Type Inference for Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-98869-2_2openalex-snapshot
Data Type Inference for Logic Programming
inferred← citeshttps://doi.org/10.1016/j.jlap.2007.10.006openalex-snapshot
Tree automata with equality constraints modulo equational theories
inferred← citeshttps://doi.org/10.1017/s1471068402001473openalex-snapshot
Using parametric set constraints for locating errors in CLP programs
inferred← citeshttps://doi.org/10.1017/s1471068424000206openalex-snapshot
Combining Type Checking and Set Constraint Solving to Improve Automated Software Verification
inferred← citeshttps://doi.org/10.1023/a:1009826603139openalex-snapshot
Generalized Definite Set Constraints
inferred← citeshttps://doi.org/10.1080/00207160.2012.762451openalex-snapshot
Parameterized complexity of basic decision problems for tree automata
inferred← citeshttps://doi.org/10.22028/d291-25722openalex-snapshot
Set based failure diagnosis for concurrent constraint 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.