On the public citation graph

On the sequential nature of interprocedural program-analysis problems

https://doi.org/10.1007/bf03036473
0 signed · 64 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-53504-7_64openalex-snapshot
Fast left-linear semi-unification
inferredcites →https://doi.org/10.1007/3-540-54572-7_6openalex-snapshot
Grammar flow analysis
inferredcites →https://doi.org/10.1007/3-540-55984-1_13openalex-snapshot
The interprocedural coincidence theorem
inferredcites →https://doi.org/10.1007/3-540-59293-8_226openalex-snapshot
Precise interprocedural dataflow analysis with applications to constant propagation
inferredcites →https://doi.org/10.1007/978-1-4615-2207-2openalex-snapshot
Applications of Logic Databases
inferredcites →https://doi.org/10.1007/978-1-4615-2207-2_8openalex-snapshot
Demand Interprocedural Program Analysis Using Logic Databases
inferredcites →https://doi.org/10.1007/978-3-662-03088-2_3openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/bf00288644openalex-snapshot
Ordered attributed grammars
inferredcites →https://doi.org/10.1016/0020-0190(83)90052-2openalex-snapshot
Reconstructing sequential behavior from parallel behavior projections
inferredcites →https://doi.org/10.1016/0304-3975(76)90068-2openalex-snapshot
Complete problems for deterministic polynomial time
inferredcites →https://doi.org/10.1016/0304-3975(96)00072-2openalex-snapshot
Precise interprocedural dataflow analysis with applications to constant propagation
inferredcites →https://doi.org/10.1016/0743-1066(84)90022-0openalex-snapshot
On the sequential nature of unification
inferredcites →https://doi.org/10.1109/cmpsac.1988.17176openalex-snapshot
Finding program slices for recursive procedures
inferredcites →https://doi.org/10.1109/tse.1984.5010248openalex-snapshot
Program Slicing
inferredcites →https://doi.org/10.1145/1008354.1008356openalex-snapshot
The monotone and planar circuit value problems are log space complete for P
inferredcites →https://doi.org/10.1145/131295.131296openalex-snapshot
Logic and logic programming
inferredcites →https://doi.org/10.1145/143095.143137openalex-snapshot
A safe approximate algorithm for interprocedural aliasing
inferredcites →https://doi.org/10.1145/155090.155096openalex-snapshot
Interprocedural modification side effect analysis with pointer aliasing
inferredcites →https://doi.org/10.1145/161494.161501openalex-snapshot
Undecidability of static analysis
inferredcites →https://doi.org/10.1145/186025.186041openalex-snapshot
The undecidability of aliasing
inferredcites →https://doi.org/10.1145/193173.195287openalex-snapshot
Speeding up slicing
inferredcites →https://doi.org/10.1145/195274.195287openalex-snapshot
Speeding up slicing
inferredcites →https://doi.org/10.1145/199448.199462openalex-snapshot
Precise interprocedural dataflow analysis via graph reachability
inferredcites →https://doi.org/10.1145/24039.24041openalex-snapshot
The program dependence graph and its use in optimization
inferredcites →https://doi.org/10.1145/390011.808263openalex-snapshot
The program dependence graph in a software development environment
inferredcites →https://doi.org/10.1145/512927.512945openalex-snapshot
A unified approach to global program optimization
inferredcites →https://doi.org/10.1145/53990.53995openalex-snapshot
The program summary graph and flow-sensitive interprocedual data flow analysis
inferredcites →https://doi.org/10.1145/567532.567555openalex-snapshot
Dependence graphs and compiler optimizations
inferredcites →https://doi.org/10.1145/567532.567556openalex-snapshot
A precise inter-procedural data flow algorithm
inferredcites →https://doi.org/10.1145/65979.65980openalex-snapshot
Integrating noninterfering versions of programs
inferredcites →https://doi.org/10.1145/73560.73572openalex-snapshot
Integrating non-intering versions of programs
inferredcites →https://doi.org/10.1145/77606.77608openalex-snapshot
Interprocedural slicing using dependence graphs
inferredcites →https://doi.org/10.1145/800020.808263openalex-snapshot
The program dependence graph in a software development environment
inferredcites →https://doi.org/10.1145/800168.811538openalex-snapshot
Automatic generation of efficient evaluators for attribute grammars
inferredcites →https://doi.org/10.1145/960116.53995openalex-snapshot
The program summary graph and flow-sensitive interprocedual data flow analysis
inferredcites →https://doi.org/10.1145/989393.989440openalex-snapshot
A safe approximate algorithm for interprocedural pointer aliasing
inferredcites →https://doi.org/10.1145/99583.99599openalex-snapshot
Pointer-induced aliasing: a problem taxonomy

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_23openalex-snapshot
On the Complexity of L-reachability
inferred← citeshttps://doi.org/10.1007/978-3-319-53733-7_26openalex-snapshot
Space Complexity of Reachability Testing in Labelled Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-71316-6_18openalex-snapshot
Computing Procedure Summaries for Interprocedural Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_11openalex-snapshot
Logical Interpretation: Static Program Analysis Using Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-662-46663-6_10openalex-snapshot
Towards a Scalable Framework for Context-Free Language Reachability
inferred← citeshttps://doi.org/10.1007/s11390-020-9754-4openalex-snapshot
SymPas: Symbolic Program Slicing
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.04.002openalex-snapshot
Space complexity of reachability testing in labelled graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.06.019openalex-snapshot
On the computational complexity of Data Flow Analysis over finite bounded meet semilattices
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00049-9openalex-snapshot
Interconvertibility of a class of set constraints and context-free-language reachability
inferred← citeshttps://doi.org/10.1016/s0950-5849(98)00093-7openalex-snapshot
Program analysis via graph reachability
inferred← citeshttps://doi.org/10.1109/32.473220openalex-snapshot
Region analysis: a parallel elimination method for data flow analysis
inferred← citeshttps://doi.org/10.1109/iccl.1994.288395openalex-snapshot
Region analysis: a parallel elimination method for data flow analysis
inferred← citeshttps://doi.org/10.1109/qsic.2011.15openalex-snapshot
Context-Sensitive Interprocedural Defect Detection Based on a Unified Symbolic Procedure Summary Model
inferred← citeshttps://doi.org/10.1145/1040305.1040332openalex-snapshot
Precise interprocedural analysis using random interpretation
inferred← citeshttps://doi.org/10.1145/1047659.1040332openalex-snapshot
Precise interprocedural analysis using random interpretation
inferred← citeshttps://doi.org/10.1145/1050849.1050865openalex-snapshot
A brief survey of program slicing
inferred← citeshttps://doi.org/10.1145/258993.259006openalex-snapshot
Interconvertbility of set constraints and context-free language reachability
inferred← citeshttps://doi.org/10.1145/258994.259006openalex-snapshot
Interconvertbility of set constraints and context-free language reachability
inferred← citeshttps://doi.org/10.1145/2955811.2955814openalex-snapshot
A Note on the Soundness of Difference Propagation
inferred← citeshttps://doi.org/10.1145/3434315openalex-snapshot
The fine-grained and parallel complexity of andersen’s pointer analysis
inferred← citeshttps://doi.org/10.1145/345099.345137openalex-snapshot
Undecidability of context-sensitive data-dependence analysis
inferred← citeshttps://doi.org/10.1145/989393.989419openalex-snapshot
Interprocedural slicing using dependence graphs
inferred← citeshttps://doi.org/10.3233/fi-2016-1371openalex-snapshot
On the Complexity of L-reachability
inferred← citeshttps://doi.org/10.48550/arxiv.1011.3840openalex-snapshot
Realizable Paths and the NL vs L Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1303.4315openalex-snapshot
On the computational complexity of Data Flow Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.2012.03567openalex-snapshot
Rational index of bounded-oscillation languages
inferred← citeshttps://doi.org/10.7551/mitpress/4283.003.0008openalex-snapshot
Program Analysis via Graph Reachability
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.