On the public citation graph
Detecting parallelism in C programs with recursive data structures
0 signed · 50 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/bf02699905openalex-snapshot
Compiling C for the EARTH multithreaded architecture
inferredcites →https://doi.org/10.1007/bf03356759openalex-snapshot
Connection Analysis: A Practical Interprocedural Heap Analysis for C
inferredcites →https://doi.org/10.1109/71.80123openalex-snapshot
Parallelizing programs with recursive data structures
inferredcites →https://doi.org/10.1109/icpp.2002.1040853openalex-snapshot
Proceedings International Conference on Parallel Processing
inferredcites →https://doi.org/10.1109/pact.1996.552551openalex-snapshot
Compiling C for the EARTH multithreaded architecture
inferredcites →https://doi.org/10.1109/pact.1997.644000openalex-snapshot
Heap analysis and optimizations for threaded programs
inferredcites →https://doi.org/10.1145/178243.178262openalex-snapshot
A general data dependence test for dynamic, pointer-based data structures
inferredcites →https://doi.org/10.1145/178243.178264openalex-snapshot
Context-sensitive interprocedural points-to analysis in the presence of function pointers
inferredcites →https://doi.org/10.1145/237721.237724openalex-snapshot
Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C
inferredcites →https://doi.org/10.1145/268946.268957openalex-snapshot
Putting pointer analysis to work
inferredcites →https://doi.org/10.1145/53990.53993openalex-snapshot
Detecting conflicts between structure accesses
inferredcites →https://doi.org/10.1145/73141.74821openalex-snapshot
Dependence analysis for pointer variables
inferredcites →https://doi.org/10.1145/960116.53993openalex-snapshot
Detecting conflicts between structure accesses
inferredcites →https://doi.org/10.5555/522659.825661openalex-snapshot
Heap analysis and optimizations for threaded programs
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_28openalex-snapshot
A New Dependence Test Based on Shape Analysis for Pointer-Based Codes
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_17openalex-snapshot
Maintaining Doubly-Linked List Invariants in Shape Analysis with Local Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-72521-3_25openalex-snapshot
A Static Heap Analysis for Shape and Connectivity: Unified Memory Analysis: The Base Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-78791-4_17openalex-snapshot
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
inferred← citeshttps://doi.org/10.1007/978-3-540-89740-8_7openalex-snapshot
Identification of Heap–Carried Data Dependence Via Explicit Store Heap Models
inferred← citeshttps://doi.org/10.1007/978-3-642-00590-9_25openalex-snapshot
Automatic Parallelization with Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-03237-0_6openalex-snapshot
Automatic Parallelization and Optimization of Programs by Proof Rewriting
inferred← citeshttps://doi.org/10.1007/s10766-008-0085-2openalex-snapshot
A Compile/Run-time Environment for the Automatic Transformation of Linked List Data Structures
inferred← citeshttps://doi.org/10.1007/s11334-013-0198-7openalex-snapshot
Precise shape analysis using field sensitivity
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.08.007openalex-snapshot
Detecting loop-carried dependences in programs with dynamic data structures
inferred← citeshttps://doi.org/10.1016/j.jpdc.2012.08.004openalex-snapshot
A data dependence test based on the projection of paths over shape graphs
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00114-xopenalex-snapshot
Parallelizing graph construction operations in programs with cyclic graphs
inferred← citeshttps://doi.org/10.1016/s0743-7315(02)00026-6openalex-snapshot
Identifying parallelism in programs with cyclic graphs
inferred← citeshttps://doi.org/10.1109/.9openalex-snapshot
Analysis of TCP and DTN Retransmission Algorithms in Presence of Channel Disruptions
inferred← citeshttps://doi.org/10.1109/cgo.2013.6494989openalex-snapshot
SIMD parallelization of applications that traverse irregular data structures
inferred← citeshttps://doi.org/10.1109/fccm.2014.11openalex-snapshot
Separation Logic-Assisted Code Transformations for Efficient High-Level Synthesis
inferred← citeshttps://doi.org/10.1109/icpp.2005.11openalex-snapshot
A Novel Approach for Detecting Heap-Based Loop-Carried Dependences
inferred← citeshttps://doi.org/10.1109/icppw.2009.27openalex-snapshot
On the Automatic Detection of Heap-Induced Data Dependencies with Interprocedural Shape Analysis
inferred← citeshttps://doi.org/10.1109/icsm.2010.5609588openalex-snapshot
Understanding parallelism-inhibiting dependences in sequential Java programs
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536285openalex-snapshot
Parallelizing irregular C codes assisted by interprocedural shape analysis
inferred← citeshttps://doi.org/10.1145/1250734.1250764openalex-snapshot
Shape analysis with inductive recursion synthesis
inferred← citeshttps://doi.org/10.1145/1251535.1251541openalex-snapshot
Heap analysis in the presence of collection libraries
inferred← citeshttps://doi.org/10.1145/1512475.1512485openalex-snapshot
Sharing analysis of arrays, collections, and recursive structures
inferred← citeshttps://doi.org/10.1145/2048066.2048104openalex-snapshot
Enhancing locality for recursive traversals of recursive structures
inferred← citeshttps://doi.org/10.1145/2245276.2231982openalex-snapshot
Precise shape analysis using field sensitivity
inferred← citeshttps://doi.org/10.1145/2384616.2384643openalex-snapshot
Automatically enhancing locality for tree traversals with traversal splicing
inferred← citeshttps://doi.org/10.1145/2491522.2491525openalex-snapshot
Proof-Directed Parallelization Synthesis by Separation Logic
inferred← citeshttps://doi.org/10.1145/2632215openalex-snapshot
A Portable Optimization Engine for Accelerating Irregular Data-Traversal Applications on SIMD Architectures
inferred← citeshttps://doi.org/10.1145/2836169openalex-snapshot
Separation Logic for High-Level Synthesis
inferred← citeshttps://doi.org/10.1145/2892208.2892228openalex-snapshot
On fusing recursive traversals of K-d trees
inferred← citeshttps://doi.org/10.1145/3133900openalex-snapshot
TreeFuser: a framework for analyzing and fusing general recursive tree traversals
inferred← citeshttps://doi.org/10.1145/3314221.3314592openalex-snapshot
Composable, sound transformations of nested recursion and loops
inferred← citeshttps://doi.org/10.1145/335231.335261openalex-snapshot
Automatic compiler techniques for thread coarsening for multithreaded architectures
inferred← citeshttps://doi.org/10.1145/3437801.3441617openalex-snapshot
Reasoning about recursive tree traversals
inferred← citeshttps://doi.org/10.3233/978-1-61499-041-3-99openalex-snapshot
Heap Dependence Analysis for Sequential 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.