On the public citation graph
Concurrent static single assignment form and constant propagation for explicitly parallel programs
0 signed · 72 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/3-540-55437-8_77openalex-snapshot
Data structures for optimizing programs with explicit parallelism
inferredcites →https://doi.org/10.1007/3-540-57659-2_36openalex-snapshot
Parallel Program Graphs and their classification
inferredcites →https://doi.org/10.1007/bfb0032686openalex-snapshot
Analysis and optimization of explicity parallel programs using the parallel program graph representation
inferredcites →https://doi.org/10.1109/52.108783openalex-snapshot
Detecting nondeterminacy in parallel programs
inferredcites →https://doi.org/10.1145/103135.103136openalex-snapshot
Constant propagation with conditional branches
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/178243.178257openalex-snapshot
Effective partial redundancy elimination
inferredcites →https://doi.org/10.1145/197320.197331openalex-snapshot
Single-pass generation of static single-assignment form for structured languages
inferredcites →https://doi.org/10.1145/68210.69225openalex-snapshot
Static analysis of low-level synchronization
inferredcites →https://doi.org/10.1145/73560.73562openalex-snapshot
Global value numbers and redundant computations
inferredcites →https://doi.org/10.1145/76263.76329openalex-snapshot
Event synchronization analysis for debugging parallel programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.2523openalex-snapshot
Static analysis and process model transformation for an advanced business process to Petri net mapping
inferred← citeshttps://doi.org/10.1007/11596110_12openalex-snapshot
Automatic Implementation of Programming Language Consistency Models
inferred← citeshttps://doi.org/10.1007/11678779_17openalex-snapshot
Choosing Among Alternative Futures
inferred← citeshttps://doi.org/10.1007/3-540-40889-4_10openalex-snapshot
Optimizing Mutual Exclusion Synchronization in Explicitly Parallel Programs
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_50openalex-snapshot
Identifying and Validating Irregular Mutual Exclusion Synchronization in Explicitly Parallel Programs
inferred← citeshttps://doi.org/10.1007/3-540-44905-1_8openalex-snapshot
Accurate Data and Context Management in Message-Passing Programs
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_50openalex-snapshot
Array SSA for Explicitly Parallel Programs
inferred← citeshttps://doi.org/10.1007/978-1-84882-240-5_5openalex-snapshot
Intermediate Program Representation
inferred← citeshttps://doi.org/10.1007/978-3-031-62076-8_12openalex-snapshot
Concurrent RSSA for CRIL: Flow Analysis for a Concurrent Reversible Programming Language
inferred← citeshttps://doi.org/10.1007/978-3-540-69330-7_13openalex-snapshot
Concurrency Analysis for Parallel Programs with Textually Aligned Barriers
inferred← citeshttps://doi.org/10.1007/978-3-540-69330-7_27openalex-snapshot
Scalable Array SSA and Array Data Flow Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_10openalex-snapshot
Causal Dataflow Analysis for Concurrent 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-03848-8_15openalex-snapshot
A Restructuring Method for WS-BPEL Business Processes Based on Extended Workflow Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-21934-4_29openalex-snapshot
Flow Sensitive-Insensitive Pointer Analysis Based Memory Safety for Multithreaded Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-22386-0_1openalex-snapshot
Towards a Compiler for Business-IT Systems
inferred← citeshttps://doi.org/10.1007/bfb0032686openalex-snapshot
Analysis and optimization of explicity parallel programs using the parallel program graph representation
inferred← citeshttps://doi.org/10.1016/j.joems.2011.12.011openalex-snapshot
Dead code elimination based pointer analysis for multithreaded programs
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00086-1openalex-snapshot
Compilation techniques for parallel systems
inferred← citeshttps://doi.org/10.1023/a:1007633018973openalex-snapshot
Static Single Assignment Form for Message-Passing Programs
inferred← citeshttps://doi.org/10.1023/a:1018772514882openalex-snapshot
A Constant Propagation Algorithm for Explicitly Parallel Programs
inferred← citeshttps://doi.org/10.1109/12.947002openalex-snapshot
Hiding relaxed memory consistency with a compiler
inferred← citeshttps://doi.org/10.1109/ccece.2008.4564838openalex-snapshot
Compiling parallel applications to Coarse-Grained Reconfigurable Architectures
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.1109/iciw.2008.14openalex-snapshot
Generic CSSA-Based Pattern over Boolean Data for an Improved WS-BPEL to Petri Net Mappping
inferred← citeshttps://doi.org/10.1109/icpp.1998.708506openalex-snapshot
Concurrent SSA form in the presence of mutual exclusion
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161030openalex-snapshot
Concurrent SSA for general barrier-synchronized parallel programs
inferred← citeshttps://doi.org/10.1109/micro.2001.991116openalex-snapshot
Efficient static single assignment form for predication
inferred← citeshttps://doi.org/10.1109/pact.2000.888336openalex-snapshot
Hiding relaxed memory consistency with compilers
inferred← citeshttps://doi.org/10.1109/pact.2005.13openalex-snapshot
Communication optimizations for fine-grained UPC applications
inferred← citeshttps://doi.org/10.1109/pact.2013.6618799openalex-snapshot
Parallel frame rendering: trading responsiveness for energy on a mobile GPU
inferred← citeshttps://doi.org/10.1109/pact.2013.6618801openalex-snapshot
S-CAVE: effective SSD caching to improve virtual machine storage performance
inferred← citeshttps://doi.org/10.1109/sc.2005.43openalex-snapshot
Making Sequential Consistency Practical in Titanium
inferred← citeshttps://doi.org/10.1109/scc.2007.22openalex-snapshot
Advanced Verification of Distributed WS-BPEL Business Processes Incorporating CSSA-based Data Flow Analysis
inferred← citeshttps://doi.org/10.1109/scc.2008.122openalex-snapshot
Deriving Explicit Data Links in WS-BPEL Processes
inferred← citeshttps://doi.org/10.1142/s0129053399000089openalex-snapshot
CONSTANT PROPAGATION IN A HIERARCHICAL INTERMEDIATE PROGRAM REPRESENTATION
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/1926385.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/2509420.2509427openalex-snapshot
Improved bitwidth-aware variable packing
inferred← citeshttps://doi.org/10.1145/301104.301105openalex-snapshot
Basic compiler algorithms for parallel programs
inferred← citeshttps://doi.org/10.1145/301104.301106openalex-snapshot
Code motion for explicitly parallel programs
inferred← citeshttps://doi.org/10.1145/329366.301105openalex-snapshot
Basic compiler algorithms for parallel programs
inferred← citeshttps://doi.org/10.1201/9781420043839.ch11openalex-snapshot
The Static Single Assignment Form
inferred← citeshttps://doi.org/10.1631/jzus.c1100364openalex-snapshot
Verification of workflow nets with transition conditions
inferred← citeshttps://doi.org/10.18419/opus-2633openalex-snapshot
Supporting business process fragmentation while maintaining operational semantics : a BPEL perspective
inferred← citeshttps://doi.org/10.48456/tr-660openalex-snapshot
Static program analysis based on virtual register renaming
inferred← citeshttps://doi.org/10.48550/arxiv.1301.1629openalex-snapshot
Partial Orders for Efficient BMC of Concurrent Software
inferred← citeshttps://doi.org/10.5555/2523721.2523729openalex-snapshot
Interprocedural strength reduction of critical sections in explicitly-parallel programs
inferred← citeshttps://doi.org/10.5555/563998.564022openalex-snapshot
Efficient static single assignment form for predication
inferred← citeshttps://doi.org/10.70675/d3af64e2z27b0z4354za1fczf56c69261924openalex-snapshot
Langages modernes pour la modélisation et la vérification des systèmes asynchrones
inferred← citeshttps://doi.org/10.7939/r3wm13x58openalex-snapshot
Analysis and Optimization of Explicitly Parallel Programs
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.