On the public citation graph

Analysis and optimization of explicity parallel programs using the parallel program graph representation

0 signed · 47 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/3-540-57502-2_37openalex-snapshot
A concurrent execution semantics for Parallel Program Graphs and Program Dependence Graphs
inferredcites →https://doi.org/10.1007/3-540-57659-2_36openalex-snapshot
Parallel Program Graphs and their classification
inferredcites →https://doi.org/10.1007/bfb0024201openalex-snapshot
On the importance of an end-to-end view of memory consistency in future computer systems
inferredcites →https://doi.org/10.1007/bfb0032687openalex-snapshot
Concurrent static single assignment form and constant propagation for explicitly parallel programs
inferredcites →https://doi.org/10.1080/01495739708941415openalex-snapshot
COMPILE-TIME ANALYSIS AND OPTIMIZATION OF EXPLICITLY PARALLEL PROGRAMS*
inferredcites →https://doi.org/10.1109/71.242161openalex-snapshot
A unified formalization of four shared-memory models
inferredcites →https://doi.org/10.1109/88.219857openalex-snapshot
High performance Fortran
inferredcites →https://doi.org/10.1109/tc.1979.1675439openalex-snapshot
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
inferredcites →https://doi.org/10.1109/tse.1975.6312840openalex-snapshot
The programming language Concurrent Pascal
inferredcites →https://doi.org/10.1145/107214.129260openalex-snapshot
PTRAN—the IBM parallel translation system
inferredcites →https://doi.org/10.1145/143165.143194openalex-snapshot
Compile-time analysis of parallel programs that share memory
inferredcites →https://doi.org/10.1145/24039.24041openalex-snapshot
The program dependence graph and its use in optimization
inferredcites →https://doi.org/10.1145/285930.285997openalex-snapshot
Memory consistency and event ordering in scalable shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/318593.318636openalex-snapshot
On linearizing parallel code
inferredcites →https://doi.org/10.1145/325164.325102openalex-snapshot
Memory consistency and event ordering in scalable shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/3392717.3400034openalex-snapshot
Optimizing supercompilers for supercomputers
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/73141.74823openalex-snapshot
Automatic generation of DAG parallelism
inferredcites →https://doi.org/10.1145/97444.97702openalex-snapshot
A foundation for sequentializing parallel code
inferredcites →https://doi.org/10.1147/rd.355.0779openalex-snapshot
Automatic partitioning of a program dependence graph into parallel tasks

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_15openalex-snapshot
A Practical MHP Information Analysis for Concurrent Java Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-69330-7_11openalex-snapshot
Efficient Computation of May-Happen-in-Parallel Information for Concurrent Java Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-74974-5_17openalex-snapshot
Maintaining Data Dependencies Across BPEL Process Fragments
inferred← citeshttps://doi.org/10.1007/978-3-642-14052-5_26openalex-snapshot
A Framework for Formal Verification of Compiler Optimizations
inferred← citeshttps://doi.org/10.1007/978-3-642-19595-2_7openalex-snapshot
Array Regrouping on CMP with Non-uniform Cache Sharing
inferred← citeshttps://doi.org/10.1007/bfb0032687openalex-snapshot
Concurrent static single assignment form and constant propagation for explicitly parallel programs
inferred← citeshttps://doi.org/10.1007/s00165-008-0086-3openalex-snapshot
Slicing communicating automata specifications: polynomial algorithms for model reduction
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00086-1openalex-snapshot
Compilation techniques for parallel systems
inferred← citeshttps://doi.org/10.1023/a:1018772514882openalex-snapshot
A Constant Propagation Algorithm for Explicitly Parallel Programs
inferred← citeshttps://doi.org/10.1109/aswec.2007.43openalex-snapshot
Slicing Communicating Automata Specifications for Efficient Model Reduction
inferred← citeshttps://doi.org/10.1109/async58294.2023.10239640openalex-snapshot
Verification-Driven Design for Asynchronous VLSI
inferred← citeshttps://doi.org/10.1109/cgo68049.2026.11395217openalex-snapshot
The Parallel-Semantics Program Dependence Graph for Parallel Optimization
inferred← citeshttps://doi.org/10.1109/hpec.2019.8916312openalex-snapshot
TapirXLA: Embedding Fork-Join Parallelism into the XLA Compiler in TensorFlow Using Tapir
inferred← citeshttps://doi.org/10.1145/1229428.1229471openalex-snapshot
May-happen-in-parallel analysis of X10 programs
inferred← citeshttps://doi.org/10.1145/1375581.1375620openalex-snapshot
Dataflow analysis for concurrent programs using datarace detection
inferred← citeshttps://doi.org/10.1145/1735971.1736050openalex-snapshot
Butterfly analysis
inferred← citeshttps://doi.org/10.1145/1925844.1926457openalex-snapshot
A technique for the effective and automatic reuse of classical compiler optimizations on multithreaded code
inferred← citeshttps://doi.org/10.1145/2095050.2095103openalex-snapshot
Intermediate language extensions for parallelism
inferred← citeshttps://doi.org/10.1145/2220365.2220368openalex-snapshot
On a Technique for Transparently Empowering Classical Compiler Optimizations on Multithreaded Code
inferred← citeshttps://doi.org/10.1145/2509136.2509518openalex-snapshot
Online feedback-directed optimizations for parallel Java code
inferred← citeshttps://doi.org/10.1145/301104.301105openalex-snapshot
Basic compiler algorithms for parallel programs
inferred← citeshttps://doi.org/10.1145/3018743.3018758openalex-snapshot
Tapir
inferred← citeshttps://doi.org/10.1145/3452299openalex-snapshot
Intermediate Representations for Explicitly Parallel Programs
inferred← citeshttps://doi.org/10.1145/596980.596982openalex-snapshot
Pointer analysis for structured parallel programs
inferred← citeshttps://doi.org/10.21236/ada416794openalex-snapshot
Enabling Programmer-Controlled Combined Memory Consistency for Parallel Code Optimization
inferred← citeshttps://doi.org/10.70675/c38919a9z6886z48fbzb4a5z5f7610506bc3openalex-snapshot
Analysis and Compilation of Parallel Programming Languages
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.