On the public citation graph

Programming Language Implementation and Logic Programming

0 signed · 11 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 points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-59293-8_218openalex-snapshot
Reasoning with executable specifications
inferred← citeshttps://doi.org/10.1007/3-540-63237-9_18openalex-snapshot
Context patterns in Haskell
inferred← citeshttps://doi.org/10.1007/978-1-4615-3752-6_10openalex-snapshot
An Extended Prolog Instruction Set for RISC Processors
inferred← citeshttps://doi.org/10.1007/bfb0055440openalex-snapshot
Context patterns, part II
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00006-eopenalex-snapshot
A mathematical definition of full Prolog
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90055-8openalex-snapshot
Bottom-up abstract interpretation of logic programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.046openalex-snapshot
Verified Compilation and the B Method: A Proposal and a First Appraisal
inferred← citeshttps://doi.org/10.1109/iccl.1992.185463openalex-snapshot
A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations
inferred← citeshttps://doi.org/10.1145/286936.286945openalex-snapshot
Dynamic class loading in the Java virtual machine
inferred← citeshttps://doi.org/10.1145/286942.286945openalex-snapshot
Dynamic class loading in the Java virtual machine
inferred← citeshttps://doi.org/10.1145/3011069openalex-snapshot
A Temporal Logic Approach to Binding-Time 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.