On the public citation graph
A characterization of attribute evaluation in passes
0 signed · 28 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/bf00264495openalex-snapshot
A characterization of attribute evaluation in passes
inferredcites →https://doi.org/10.1007/bf01692511openalex-snapshot
Semantics of context-free languages
inferredcites →https://doi.org/10.1016/0020-0190(77)90036-9openalex-snapshot
An optimization of the alternating semantic evaluator
inferredcites →https://doi.org/10.1016/s0019-9958(81)90466-6openalex-snapshot
Passes and paths of attribute grammars
inferredcites →https://doi.org/10.1137/0210060openalex-snapshot
Minimizing the Number of Evaluation Passes for Attribute Grammars
inferredcites →https://doi.org/10.1145/359997.359999openalex-snapshot
Semantic evaluation from left to right
inferredcites →https://doi.org/10.1145/800168.811538openalex-snapshot
Automatic generation of efficient evaluators for attribute grammars
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-51364-7_13openalex-snapshot
Attributed tree transformations with delayed and smart re-evaluation
inferred← citeshttps://doi.org/10.1007/3-540-53101-7_24openalex-snapshot
Concurrent incremental attribute evaluation
inferred← citeshttps://doi.org/10.1007/bf00263499openalex-snapshot
Iteration of transformation passes over attributed program trees
inferred← citeshttps://doi.org/10.1007/bf00264472openalex-snapshot
Interpretation and reduction of attribute grammars
inferred← citeshttps://doi.org/10.1007/bf00265992openalex-snapshot
One-pass transformations of attributed program trees
inferred← citeshttps://doi.org/10.1007/bf00279953openalex-snapshot
Apex graph grammars and attribute grammars
inferred← citeshttps://doi.org/10.1007/bf00299633openalex-snapshot
Attribute (Re)evaluation in OPTRAN
inferred← citeshttps://doi.org/10.1007/bf02737108openalex-snapshot
Composition and evaluation of attribute coupled grammars
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90020-3openalex-snapshot
Optimal incremental simple multi-pass attribute evaluation
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90030-7openalex-snapshot
Simple multi-visit attribute grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(81)90466-6openalex-snapshot
Passes and paths of attribute grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80043-2openalex-snapshot
Machines for attribute grammars
inferred← citeshttps://doi.org/10.1137/0214063openalex-snapshot
Finding Minimal Pass Sequences for Attribute Grammars
inferred← citeshttps://doi.org/10.1145/122616.122625openalex-snapshot
Compiler structure engineering with attribute grammars
inferred← citeshttps://doi.org/10.1145/76359.76366openalex-snapshot
Passes, sweeps, and visits in attribute grammars
inferred← citeshttps://doi.org/10.3990/1.9789036517133openalex-snapshot
Linear data structures for storage allocation in attribute evaluators
showing the first 19 of 20 · page through all 20
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.