On the public citation graph
Demand-driven, symbolic range propagation
0 signed · 55 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-45403-9_8openalex-snapshot
Automatic Array Privatization
inferredcites →https://doi.org/10.1007/3-540-57659-2_29openalex-snapshot
Automatic array privatization
inferredcites →https://doi.org/10.1007/bfb0025876openalex-snapshot
Polaris: Improving the effectiveness of parallelizing compilers
inferredcites →https://doi.org/10.1109/icpp.1994.59openalex-snapshot
An Overview of Symbolic Analysis Techniques Needed for the Effective Parallelization of the Perfect Benchmarks
inferredcites →https://doi.org/10.1109/tse.1977.231133openalex-snapshot
Compiler Analysis of the Value Ranges for Variables
inferredcites →https://doi.org/10.1137/0204044openalex-snapshot
A Simple Algorithm for Global Data Flow Analysis Problems
inferredcites →https://doi.org/10.1145/113445.113447openalex-snapshot
Efficient and exact data dependence analysis
inferredcites →https://doi.org/10.1145/113446.113447openalex-snapshot
Efficient and exact data dependence analysis
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/155090.155095openalex-snapshot
Abstract debugging of higher-order imperative languages
inferredcites →https://doi.org/10.1145/173262.155095openalex-snapshot
Abstract debugging of higher-order imperative languages
inferredcites →https://doi.org/10.1145/22145.22166openalex-snapshot
A linear algorithm for finding dominators in flow graphs and related problems
inferredcites →https://doi.org/10.1145/224538.224648openalex-snapshot
Gated SSA-based demand-driven symbolic analysis for parallelizing compilers
inferredcites →https://doi.org/10.1145/512760.512770openalex-snapshot
Automatic discovery of linear restraints among variables of a program
inferredcites →https://doi.org/10.1177/109434208900300302openalex-snapshot
The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers
inferredcites →https://doi.org/10.5555/602770.602858openalex-snapshot
The range test: a dependence test for symbolic, non-linear expressions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.1015openalex-snapshot
Parametric timing estimation with Newton–Gregory formulae
inferred← citeshttps://doi.org/10.1007/11596110_19openalex-snapshot
Performance Analysis of Symbolic Analysis Techniques for Parallelizing Compilers
inferred← citeshttps://doi.org/10.1007/3-540-45306-7_9openalex-snapshot
Efficient Symbolic Analysis for Optimizing Compilers
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_16openalex-snapshot
Advanced Code Generation for High Performance Fortran
inferred← citeshttps://doi.org/10.1007/3-540-45574-4_22openalex-snapshot
Compiling Data Intensive Applications with Spatial Coordinates
inferred← citeshttps://doi.org/10.1007/978-3-540-24723-4_9openalex-snapshot
A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-69330-7_28openalex-snapshot
Interprocedural Symbolic Range Propagation for Optimizing Compilers
inferred← citeshttps://doi.org/10.1007/978-3-540-74061-2_23openalex-snapshot
Program Analysis Using Symbolic Ranges
inferred← citeshttps://doi.org/10.1007/978-3-642-03237-0_11openalex-snapshot
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
inferred← citeshttps://doi.org/10.1007/978-3-642-32820-6_25openalex-snapshot
From Serial Loops to Parallel Execution on Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-36036-7_5openalex-snapshot
A Hybrid Approach to Proving Memory Reference Monotonicity
inferred← citeshttps://doi.org/10.1007/bf02962208openalex-snapshot
Interactive and symbolic data dependence analysis based on ranges of expressions
inferred← citeshttps://doi.org/10.1023/a:1007560600904openalex-snapshot
Automatic Parallelization of Recursive Procedures
inferred← citeshttps://doi.org/10.1023/a:1018776615791openalex-snapshot
Simplifying Control Flow in Compiler-Generated Parallel Code
inferred← citeshttps://doi.org/10.1109/71.737695openalex-snapshot
Nonlinear and symbolic data dependence testing
inferred← citeshttps://doi.org/10.1109/71.888633openalex-snapshot
A unified symbolic evaluation framework for parallelizing compilers
inferred← citeshttps://doi.org/10.1109/hpcc.2008.145openalex-snapshot
Discovering Maximum Parallelization Using Advanced Data Dependence Analysis
inferred← citeshttps://doi.org/10.1109/iccae.2010.5451995openalex-snapshot
Recursive symbolic bound analysis in loop structure
inferred← citeshttps://doi.org/10.1109/iwia.2004.10018openalex-snapshot
Array Data Dependence Testing with the Chains of Recurrences Algebra
inferred← citeshttps://doi.org/10.1109/mc.2009.385openalex-snapshot
Cetus: A Source-to-Source Compiler Infrastructure for Multicores
inferred← citeshttps://doi.org/10.1109/pact.1999.807504openalex-snapshot
Automatic parallelization of recursive procedures
inferred← citeshttps://doi.org/10.1109/scam.2006.22openalex-snapshot
Prioritizing Software Inspection Results using Static Profiling
inferred← citeshttps://doi.org/10.1109/scam.2008.18openalex-snapshot
On the Use of Data Flow Analysis in Static Profiling
inferred← citeshttps://doi.org/10.1134/s0361768809020066openalex-snapshot
Automatic reconstruction of data types in the decompilation problem
inferred← citeshttps://doi.org/10.1145/1006209.1006226openalex-snapshot
A unified framework for nonlinear dependence testing and symbolic analysis
inferred← citeshttps://doi.org/10.1145/2254064.2254124openalex-snapshot
Logical inference techniques for loop parallelization
inferred← citeshttps://doi.org/10.1145/263580.263648openalex-snapshot
Symbolic evaluation for parallelizing compilers
inferred← citeshttps://doi.org/10.1145/267959.269970openalex-snapshot
A practical framework for demand-driven interprocedural data flow analysis
inferred← citeshttps://doi.org/10.1145/514191.514226openalex-snapshot
Compiler supported high-level abstractions for sparse disk-resident datasets
inferred← citeshttps://doi.org/10.1145/514191.514227openalex-snapshot
Computation regrouping: restructuring programs for temporal data cache locality
inferred← citeshttps://doi.org/10.13140/rg.2.2.31266.03528openalex-snapshot
The CR# Algebra and its Application in Loop Analysis and Optimization
inferred← citeshttps://doi.org/10.21236/ada387581openalex-snapshot
Compiling Scientific Programs for Scalable Parallel Systems
inferred← citeshttps://doi.org/10.2498/cit.2001.04.02openalex-snapshot
ATMOL: A Domain-Specific Language for Atmospheric Modeling
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.7346openalex-snapshot
Efficient Checkpointing for Heterogeneous Collaborative Environments: Representation, Coordination, and Automation.
inferred← citeshttps://doi.org/10.5555/520793.825722openalex-snapshot
Automatic parallelization of recursive procedures
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.