On the public citation graph

An axiomatic treatment ofSIMD assignment

0 signed · 19 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/978-1-4612-5983-1openalex-snapshot
The Science of Programming
inferredcites →https://doi.org/10.1007/978-3-642-82921-5_4openalex-snapshot
Notes on Communicating Sequential Systems
inferredcites →https://doi.org/10.1007/bf00289504openalex-snapshot
An axiomatic definition of the programming language PASCAL
inferredcites →https://doi.org/10.1007/bf01941139openalex-snapshot
Simd language design using prescriptive semantics
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1145/357162.357170openalex-snapshot
R for Semantics
inferredcites →https://doi.org/10.1145/360303.360308openalex-snapshot
The denotational semantics of programming languages

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-58430-7_10openalex-snapshot
On the expressivity of a weakest precondition calculus for a simple data-parallel programming language (short version)
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_100openalex-snapshot
Laws of data parallel assignment
inferred← citeshttps://doi.org/10.1007/3-540-61736-1_51openalex-snapshot
Formal validation of data parallel programs: Introducing the assertional approach
inferred← citeshttps://doi.org/10.1007/bf01211307openalex-snapshot
Correct translation of data parallel assignment onto array processors
inferred← citeshttps://doi.org/10.1007/bfb0002777openalex-snapshot
Synchronising asynchronous communications
inferred← citeshttps://doi.org/10.1007/bfb0020461openalex-snapshot
On the completeness of a proof system for a simple data-parallel programming language (extended abstract)
inferred← citeshttps://doi.org/10.1016/0167-739x(92)90069-nopenalex-snapshot
Control structures for data-parallel SIMD languages: semantics and implementation
inferred← citeshttps://doi.org/10.1016/0898-1221(93)90026-ropenalex-snapshot
Axiomatic-like performance analysis (ALPA)
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00041-8openalex-snapshot
Formal validation of data-parallel programs: a two-component assertional proof system for a simple language
inferred← citeshttps://doi.org/10.1080/10637199808947391openalex-snapshot
AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗
inferred← citeshttps://doi.org/10.1109/pmmpc.1995.504360openalex-snapshot
Proving data-parallel programs correct: the proof outlines approach
inferred← citeshttps://doi.org/10.14236/ewic/fm1997.13openalex-snapshot
An Axiomatic Semantics for Data-Parallel Computation
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.