On the public citation graph

A compiler for multiple memory models

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.1006/jpdc.1996.0136openalex-snapshot
Analyses and Optimizations for Shared Address Space Programs
inferredcites →https://doi.org/10.1007/3-540-48166-4_21openalex-snapshot
An Efficient Algorithm for Computing MHP Information for Concurrent Java Programs
inferredcites →https://doi.org/10.1023/a:1018772514882openalex-snapshot
A Constant Propagation Algorithm for Explicitly Parallel Programs
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/2.485843openalex-snapshot
TreadMarks: shared memory computing on networks of workstations
inferredcites →https://doi.org/10.1109/2.546611openalex-snapshot
Shared memory consistency models: a tutorial
inferredcites →https://doi.org/10.1109/2.707614openalex-snapshot
Multiprocessors should support simple memory consistency models
inferredcites →https://doi.org/10.1145/115372.115320openalex-snapshot
Efficiently computing static single assignment form and the control dependence graph
inferredcites →https://doi.org/10.1145/158511.158644openalex-snapshot
Static single assignment for explicitly parallel programs
inferredcites →https://doi.org/10.1145/207110.207142openalex-snapshot
Optimizing parallel programs with explicit synchronization
inferredcites →https://doi.org/10.1145/301104.301105openalex-snapshot
Basic compiler algorithms for parallel programs
inferredcites →https://doi.org/10.1145/301104.301106openalex-snapshot
Code motion for explicitly parallel programs
inferredcites →https://doi.org/10.1145/301618.301645openalex-snapshot
Pointer analysis for multithreaded programs
inferredcites →https://doi.org/10.1145/304065.304106openalex-snapshot
Fixing the Java memory model
inferredcites →https://doi.org/10.1145/320384.320386openalex-snapshot
Escape analysis for Java
inferredcites →https://doi.org/10.1145/42190.42277openalex-snapshot
Efficient and correct execution of parallel programs that share memory
inferredcites →https://doi.org/10.1145/68210.69225openalex-snapshot
Static analysis of low-level synchronization
inferredcites →https://doi.org/10.1145/76263.76329openalex-snapshot
Event synchronization analysis for debugging parallel programs
inferredcites →https://doi.org/10.1145/99163.99167openalex-snapshot
Analysis of event synchronization in a parallel programming tool
inferredcites →https://doi.org/10.1147/sj.391.0211openalex-snapshot
The Jalapeño virtual machine

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11532378_16openalex-snapshot
Efficient Computation of Communicator Variables for Programs with Unstructured Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_21openalex-snapshot
Operational Reasoning for Concurrent Caml Programs and Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-540-79561-2_7openalex-snapshot
Incorporation of OpenMP Memory Consistency into Conventional Dataflow Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_5openalex-snapshot
Pervasive Theory of Memory
inferred← citeshttps://doi.org/10.1109/memcod.2005.1487915openalex-snapshot
On the decidability of shared memory consistency veri~cation
inferred← citeshttps://doi.org/10.1145/1988915.1988917openalex-snapshot
There is nothing wrong with out-of-thin-air
inferred← citeshttps://doi.org/10.1145/780822.781145openalex-snapshot
Static conflict analysis for multi-threaded object-oriented programs
inferred← citeshttps://doi.org/10.22028/d291-25889openalex-snapshot
Address spaces and virtual memory : specification, implementation, and correctness
inferred← citeshttps://doi.org/10.3929/ethz-a-004756402openalex-snapshot
Detecting synchronization defects in multi-threaded object-oriented programs
inferred← citeshttps://doi.org/10.5555/1898953.1898968openalex-snapshot
On the effectiveness of speculative and selective memory fences
inferred← citeshttps://doi.org/10.82308/10932openalex-snapshot
A practical MHP information computation for concurrent Java programs /
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.