On the public citation graph

The interprocedural analysis and automatic parallelization of Scheme programs

0 signed · 146 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-12868-9_93openalex-snapshot
The Bath Concurrent LISP machine
inferredcites →https://doi.org/10.1007/bf00263742openalex-snapshot
A system which automatically improves programs
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1017/cbo9781139171892openalex-snapshot
A Practical Introduction to Denotational Semantics
inferredcites →https://doi.org/10.1038/scientificamerican0687-108openalex-snapshot
The Connection Machine
inferredcites →https://doi.org/10.1109/tc.1987.5009499openalex-snapshot
Compiler Algorithms for Synchronization
inferredcites →https://doi.org/10.1126/science.231.4741.967openalex-snapshot
Parallel Supercomputing Today and the Cedar Approach
inferredcites →https://doi.org/10.1145/12276.13333openalex-snapshot
ORBIT: an optimizing compiler for scheme
inferredcites →https://doi.org/10.1145/15022.15026openalex-snapshot
On some extensions of syntactic error recovery technique based on phrase markers
inferredcites →https://doi.org/10.1145/15042.15043openalex-snapshot
Revised 3 report on the algorithmic language scheme
inferredcites →https://doi.org/10.1145/318593.318659openalex-snapshot
Constant propagation with conditional branches
inferredcites →https://doi.org/10.1145/319838.319870openalex-snapshot
Connection Machine Lisp
inferredcites →https://doi.org/10.1145/322217.322232openalex-snapshot
Parallel Prefix Computation
inferredcites →https://doi.org/10.1145/3392717.3400034openalex-snapshot
Optimizing supercompilers for supercomputers
inferredcites →https://doi.org/10.1145/363219.363225openalex-snapshot
Compact list representation
inferredcites →https://doi.org/10.1145/366193.366201openalex-snapshot
Revised report on the algorithmic language ALGOL 60
inferredcites →https://doi.org/10.1145/4472.4478openalex-snapshot
MULTILISP: a language for concurrent symbolic computation
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/5465.6040openalex-snapshot
Summary of the second annual UCLA survey of business school computer usage
inferredcites →https://doi.org/10.1145/55364.55416openalex-snapshot
Parcel: project for the automatic restructuring and concurrent evaluation of LISP
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
inferredcites →https://doi.org/10.1145/62115.62126openalex-snapshot
Restructuring Lisp programs for concurrent execution
inferredcites →https://doi.org/10.1145/73560.73570openalex-snapshot
A collecting interpretation of expressions
inferredcites →https://doi.org/10.1145/78969.78963openalex-snapshot
An interval-based approach to exhaustive and incremental interprocedural data-flow analysis
inferredcites →https://doi.org/10.1145/7902.7904openalex-snapshot
Advanced compiler optimizations for supercomputers
inferredcites →https://doi.org/10.1145/800055.802019openalex-snapshot
Queue-based multi-processing LISP
inferredcites →https://doi.org/10.1145/989393.989414openalex-snapshot
Orbit
inferredcites →https://doi.org/10.7551/mitpress/5298.001.0001openalex-snapshot
Performance and Evaluation of LISP Systems

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpa.3160480903openalex-snapshot
Interprocedural analysis and optimization
inferred← citeshttps://doi.org/10.1002/smr.1889openalex-snapshot
Purity analysis for JavaScript through abstract interpretation
inferred← citeshttps://doi.org/10.1007/11823230_11openalex-snapshot
Beyond Iteration Vectors: Instancewise Relational Abstract Domains
inferred← citeshttps://doi.org/10.1007/3-540-44898-5_10openalex-snapshot
Inserting Safe Memory Reuse Commands into ML-Like Programs
inferred← citeshttps://doi.org/10.1007/3-540-48319-5_13openalex-snapshot
Beyond Arrays — A Container-Centric Approach for Parallelization of Real-World Symbolic Applications
inferred← citeshttps://doi.org/10.1007/3-540-53065-7_104openalex-snapshot
Code parallelization for the LGDG large-grain dataflow computation
inferred← citeshttps://doi.org/10.1007/3-540-55425-4_8openalex-snapshot
Using the Reform inference system for parallel Prolog
inferred← citeshttps://doi.org/10.1007/3-540-55984-1_22openalex-snapshot
Compile-time analysis of object-oriented programs
inferred← citeshttps://doi.org/10.1007/3-540-57502-2_48openalex-snapshot
Supporting SPMD execution for dynamic data structures
inferred← citeshttps://doi.org/10.1007/3-540-57502-2_68openalex-snapshot
A program's eye view of Miprac
inferred← citeshttps://doi.org/10.1007/3-540-58485-4_44openalex-snapshot
Compile-time detection of uncaught exceptions in Standard ML programs
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_55openalex-snapshot
Semantic foundations of commutativity analysis
inferred← citeshttps://doi.org/10.1007/3-540-61736-1_43openalex-snapshot
Current status of the SUIF research project
inferred← citeshttps://doi.org/10.1007/978-3-540-93900-9_22openalex-snapshot
A Posteriori Soundness for Non-deterministic Abstract Interpretations
inferred← citeshttps://doi.org/10.1007/978-3-642-25318-8_7openalex-snapshot
Access-Based Localization with Bypassing
inferred← citeshttps://doi.org/10.1007/978-3-642-31500-8_13openalex-snapshot
Fine Grained Parallelism in Recursive Function Calls
inferred← citeshttps://doi.org/10.1007/978-3-642-39634-2_31openalex-snapshot
A Parallelized Theorem Prover for a Logic with Parallel Execution
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_27openalex-snapshot
A Toolkit for Debugging Parallel Lisp Programs
inferred← citeshttps://doi.org/10.1007/bf00155803openalex-snapshot
An introduction to compilation issues for parallel machines
inferred← citeshttps://doi.org/10.1007/bf01806061openalex-snapshot
Compiling lisp programs for parallel execution
inferred← citeshttps://doi.org/10.1007/bf02699884openalex-snapshot
Dynamic resolution: A runtime technique for the parallelization of modifications to directed acyclic graphs
inferred← citeshttps://doi.org/10.1007/bf03356759openalex-snapshot
Connection Analysis: A Practical Interprocedural Heap Analysis for C
inferred← citeshttps://doi.org/10.1007/bfb0014192openalex-snapshot
Interprocedural analysis for parallelization
inferred← citeshttps://doi.org/10.1007/bfb0014221openalex-snapshot
Connection analysis: A practical interprocedural heap analysis for C
inferred← citeshttps://doi.org/10.1007/bfb0018665openalex-snapshot
A new architecture design paradigm for parallel computing in scheme
inferred← citeshttps://doi.org/10.1007/bfb0024149openalex-snapshot
New ideas in parallel lisp: Language design, implementation, and programming tools
inferred← citeshttps://doi.org/10.1007/bfb0024157openalex-snapshot
The design of automatic parallelizers for symbolic and numeric programs
inferred← citeshttps://doi.org/10.1007/bfb0025882openalex-snapshot
Flow-insensitive interprocedural alias analysis in the presence of pointers
inferred← citeshttps://doi.org/10.1007/bfb0038670openalex-snapshot
Run-time management of Lisp parallelism and the Hierarchical Task Graph program representation
inferred← citeshttps://doi.org/10.1016/0096-0551(93)90006-mopenalex-snapshot
Designing programming languages for the analyzability of pointer data structures
inferred← citeshttps://doi.org/10.1016/0167-739x(92)90009-zopenalex-snapshot
Problem-solving environments for parallel computers
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90076-ropenalex-snapshot
A lattice for abstract interpretation of dynamic (LISP-like) structures
inferred← citeshttps://doi.org/10.1016/j.scico.2005.02.007openalex-snapshot
Static insertion of safe and effective memory reuse commands into ML-like programs
inferred← citeshttps://doi.org/10.1016/j.scico.2013.04.002openalex-snapshot
Access-based abstract memory localization in static analysis
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102476openalex-snapshot
Safe automated refactoring for intelligent parallelization of Java 8 streams
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.031openalex-snapshot
Analyzing the environment structure of higher-order languages using frame strings
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00044-5openalex-snapshot
An abstract interpretation for estimating uncaught exceptions in Standard ML programs
inferred← citeshttps://doi.org/10.1017/s0956796812000238openalex-snapshot
Systematic abstraction of abstract machines
inferred← citeshttps://doi.org/10.1017/s0956796818000138openalex-snapshot
Abstract allocation as a unified approach to polyvariance in control-flow analyses
inferred← citeshttps://doi.org/10.1023/a:1007560600904openalex-snapshot
Automatic Parallelization of Recursive Procedures
inferred← citeshttps://doi.org/10.1109/32.126773openalex-snapshot
A control-flow normalization algorithm and its complexity
inferred← citeshttps://doi.org/10.1109/5.214548openalex-snapshot
Automatic program parallelization
inferred← citeshttps://doi.org/10.1109/71.238302openalex-snapshot
Loop-level parallelism in numeric and symbolic programs
inferred← citeshttps://doi.org/10.1109/fdmpp.1992.588583openalex-snapshot
Research Directions in Compiling For Massive Parallelism
inferred← citeshttps://doi.org/10.1109/iccl.1992.185463openalex-snapshot
A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations
inferred← citeshttps://doi.org/10.1109/iccl.1994.288373openalex-snapshot
State space reduction in abstract interpretation of parallel programs
inferred← citeshttps://doi.org/10.1109/icpp.1994.26openalex-snapshot
A Framework for Data Dependence Testing in the Presence of Pointers
inferred← citeshttps://doi.org/10.1109/icpp.1997.622556openalex-snapshot
Data distribution analysis and optimization for Pointer-based distributed programs
inferred← citeshttps://doi.org/10.1109/icse.2019.00072openalex-snapshot
Safe Automated Refactoring for Intelligent Parallelization of Java 8 Streams
inferred← citeshttps://doi.org/10.1109/ipps.1991.153839openalex-snapshot
Confining imperative languages for parallel processing
inferred← citeshttps://doi.org/10.1109/ipps.1995.395955openalex-snapshot
Parallelizing while loops for multiprocessor systems
inferred← citeshttps://doi.org/10.1109/mpcs.1994.367033openalex-snapshot
Symbolic computing, Lisp languages, and parallel computing
inferred← citeshttps://doi.org/10.1109/pact.1996.554032openalex-snapshot
Dynamic parallelization of modifications to directed acyclic graphs
inferred← citeshttps://doi.org/10.1109/spdp.1991.218197openalex-snapshot
Dynamic control of parallelism and granularity in executing nested parallel loops
inferred← citeshttps://doi.org/10.1109/superc.1990.130020openalex-snapshot
Switch-stacks: A scheme for microtasking nested parallel loops
inferred← citeshttps://doi.org/10.1145/1029873.1029885openalex-snapshot
Experiments on the effectiveness of an automatic insertion of memory reuses into ML-like programs
inferred← citeshttps://doi.org/10.1145/1075382.1075385openalex-snapshot
Interprocedural parallelization analysis in SUIF
inferred← citeshttps://doi.org/10.1145/1111037.1111049openalex-snapshot
Environment analysis via ΔCFA
inferred← citeshttps://doi.org/10.1145/1111320.1111049openalex-snapshot
Environment analysis via ΔCFA
inferred← citeshttps://doi.org/10.1145/141471.141567openalex-snapshot
Dynamic program parallelization
inferred← citeshttps://doi.org/10.1145/141478.141567openalex-snapshot
Dynamic program parallelization
inferred← citeshttps://doi.org/10.1145/143095.143138openalex-snapshot
Abstractions for recursive pointer data structures
inferred← citeshttps://doi.org/10.1145/143103.143138openalex-snapshot
Abstractions for recursive pointer data structures
inferred← citeshttps://doi.org/10.1145/143165.143194openalex-snapshot
Compile-time analysis of parallel programs that share memory
inferred← citeshttps://doi.org/10.1145/151640.151644openalex-snapshot
Abstract description of pointer data structures
inferred← citeshttps://doi.org/10.1145/1529282.1529713openalex-snapshot
Data parallel dialect of scheme
inferred← citeshttps://doi.org/10.1145/158511.158613openalex-snapshot
Separating stages in the continuation-passing style transformation
inferred← citeshttps://doi.org/10.1145/158511.158642openalex-snapshot
Automatic generation and management of interprocedural program analyses
inferred← citeshttps://doi.org/10.1145/165180.165194openalex-snapshot
Experiences with compiler-directed storage reclamation
inferred← citeshttps://doi.org/10.1145/1774088.1774536openalex-snapshot
Software transactional memory for implicitly parallel functional language
inferred← citeshttps://doi.org/10.1145/178243.178262openalex-snapshot
A general data dependence test for dynamic, pointer-based data structures
inferred← citeshttps://doi.org/10.1145/178243.178263openalex-snapshot
Interprocedural may-alias analysis for pointers
inferred← citeshttps://doi.org/10.1145/178243.178264openalex-snapshot
Context-sensitive interprocedural points-to analysis in the presence of function pointers
inferred← citeshttps://doi.org/10.1145/181181.181308openalex-snapshot
An efficient approach to computing fixpoints for complex program analysis
inferred← citeshttps://doi.org/10.1145/182409.182493openalex-snapshot
Analyzing stores and references in a parallel symbolic language
inferred← citeshttps://doi.org/10.1145/182590.182493openalex-snapshot
Analyzing stores and references in a parallel symbolic language
inferred← citeshttps://doi.org/10.1145/186025.186037openalex-snapshot
Fixpoint computation for polyvariant static analyses of higher-order applicative programs
inferred← citeshttps://doi.org/10.1145/1863543.1863553openalex-snapshot
Abstracting abstract machines
inferred← citeshttps://doi.org/10.1145/1932681.1863553openalex-snapshot
Abstracting abstract machines
inferred← citeshttps://doi.org/10.1145/199448.199536openalex-snapshot
A unified treatment of flow analysis in higher-order languages
inferred← citeshttps://doi.org/10.1145/207110.207111openalex-snapshot
Efficient context-sensitive pointer analysis for C programs
inferred← citeshttps://doi.org/10.1145/207110.207112openalex-snapshot
Context-insensitive alias analysis reconsidered
inferred← citeshttps://doi.org/10.1145/215465.215592openalex-snapshot
Analyzing the communication topology of concurrent programs
inferred← citeshttps://doi.org/10.1145/2187671.2187672openalex-snapshot
Control-flow analysis of functional programs
inferred← citeshttps://doi.org/10.1145/223428.207111openalex-snapshot
Efficient context-sensitive pointer analysis for C programs
inferred← citeshttps://doi.org/10.1145/223428.207112openalex-snapshot
Context-insensitive alias analysis reconsidered
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1145/237721.237773openalex-snapshot
A practical and flexible flow analysis for higher-order languages
inferred← citeshttps://doi.org/10.1145/237721.237776openalex-snapshot
Trace-based program analysis
inferred← citeshttps://doi.org/10.1145/258948.258959openalex-snapshot
The effectiveness of flow analysis for inlining
inferred← citeshttps://doi.org/10.1145/258949.258959openalex-snapshot
The effectiveness of flow analysis for inlining
inferred← citeshttps://doi.org/10.1145/2594291.2594318openalex-snapshot
Selective context-sensitivity guided by impact pre-analysis
inferred← citeshttps://doi.org/10.1145/2666356.2594318openalex-snapshot
Selective context-sensitivity guided by impact pre-analysis
inferred← citeshttps://doi.org/10.1145/268946.268949openalex-snapshot
Escape analysis
inferred← citeshttps://doi.org/10.1145/2821504openalex-snapshot
Selective X-Sensitive Analysis Guided by Impact Pre-Analysis
inferred← citeshttps://doi.org/10.1145/291891.291898openalex-snapshot
A practical and flexible flow analysis for higher-order languages
inferred← citeshttps://doi.org/10.1145/2951913.2951936openalex-snapshot
Allocation characterizes polyvariance: a unified methodology for polyvariant control-flow analysis
inferred← citeshttps://doi.org/10.1145/301104.301108openalex-snapshot
SUIF Explorer
inferred← citeshttps://doi.org/10.1145/3022670.2951936openalex-snapshot
Allocation characterizes polyvariance: a unified methodology for polyvariant control-flow analysis
inferred← citeshttps://doi.org/10.1145/318789.318812openalex-snapshot
Intererence analysis tools for parallelizing programs with recursive data structures
inferred← citeshttps://doi.org/10.1145/320384.320387openalex-snapshot
Escape analysis for object-oriented languages
inferred← citeshttps://doi.org/10.1145/320385.320387openalex-snapshot
Escape analysis for object-oriented languages
inferred← citeshttps://doi.org/10.1145/325478.325519openalex-snapshot
Interprocedural pointer alias analysis
inferred← citeshttps://doi.org/10.1145/328690.328700openalex-snapshot
From recursion to iteration
inferred← citeshttps://doi.org/10.1145/773473.178262openalex-snapshot
A general data dependence test for dynamic, pointer-based data structures
inferred← citeshttps://doi.org/10.1145/773473.178264openalex-snapshot
Context-sensitive interprocedural points-to analysis in the presence of function pointers
inferred← citeshttps://doi.org/10.1145/93542.93583openalex-snapshot
Automatic recognition of induction variables and recurrence relations by abstract interpretation
inferred← citeshttps://doi.org/10.1145/945885.945886openalex-snapshot
Escape analysis for Java TM
inferred← citeshttps://doi.org/10.1145/99583.99590openalex-snapshot
How to make destructive updates less destructive
inferred← citeshttps://doi.org/10.1155/1997/312872openalex-snapshot
Precise Analysis of Array Usage in Scientific Programs
inferred← citeshttps://doi.org/10.1184/r1/6604622openalex-snapshot
Data-flow analysis and type recovery in Scheme
inferred← citeshttps://doi.org/10.1371/journal.pone.0230904openalex-snapshot
Binary-level data dependence analysis of hot execution regions using abstract interpretation at runtime
inferred← citeshttps://doi.org/10.2172/5217286openalex-snapshot
Cedar Project---Original goals and progress to date
inferred← citeshttps://doi.org/10.2200/s00340ed1v01y201201cac019openalex-snapshot
Automatic Parallelization: An Overview of Fundamental Compiler Techniques
inferred← citeshttps://doi.org/10.48550/arxiv.1107.3539openalex-snapshot
Systematic Abstraction of Abstract Machines
inferred← citeshttps://doi.org/10.5555/1760267.1760281openalex-snapshot
Inserting safe memory reuse commands into ML-like programs
inferred← citeshttps://doi.org/10.5555/520793.825722openalex-snapshot
Automatic parallelization of recursive procedures
inferred← citeshttps://doi.org/10.7146/brics.v14i18.21936openalex-snapshot
Control-Flow Analysis of Functional 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.