On the public citation graph
Reachability analysis of program variables
0 signed · 56 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/11547662_22openalex-snapshot
Pair-Sharing Analysis of Object-Oriented Programs
inferredcites →https://doi.org/10.1007/11609773_7openalex-snapshot
Detecting Non-cyclicity by Abstract Compilation into Boolean Functions
inferredcites →https://doi.org/10.1007/11691372_19openalex-snapshot
A Local Shape Analysis Based on Separation Logic
inferredcites →https://doi.org/10.1007/3-540-36579-6_12openalex-snapshot
Scaling Java Points-to Analysis Using Spark
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_12openalex-snapshot
Shape Analysis by Predicate Abstraction
inferredcites →https://doi.org/10.1007/978-3-540-71316-6_12openalex-snapshot
Cost Analysis of Java Bytecode
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_22openalex-snapshot
Shape Analysis for Composite Data Structures
inferredcites →https://doi.org/10.1007/978-3-540-74061-2_28openalex-snapshot
Magic-Sets Transformation for the Analysis of Java Bytecode
inferredcites →https://doi.org/10.1007/978-3-540-78791-4_17openalex-snapshot
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
inferredcites →https://doi.org/10.1007/978-3-642-28332-1_36openalex-snapshot
Automaton-Based Array Initialization Analysis
inferredcites →https://doi.org/10.1007/978-3-642-31365-3_33openalex-snapshot
Reachability Analysis of Program Variables
inferredcites →https://doi.org/10.1007/978-3-642-32943-2_6openalex-snapshot
Definite Expression Aliasing Analysis for Java Bytecode
inferredcites →https://doi.org/10.1007/s10009-009-0098-1openalex-snapshot
A low-level memory model and an accompanying reachability predicate
inferredcites →https://doi.org/10.1007/s10270-009-0132-5openalex-snapshot
Precise null-pointer analysis
inferredcites →https://doi.org/10.1016/j.tcs.2012.12.018openalex-snapshot
Reachability-based acyclicity analysis by Abstract Interpretation
inferredcites →https://doi.org/10.1016/j.tcs.2013.01.007openalex-snapshot
Inferring complete initialization of arrays
inferredcites →https://doi.org/10.1109/sefm.2008.8openalex-snapshot
Nullness Analysis in Boolean Form
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/1057387.1057391openalex-snapshot
Polymorphic predicate abstraction
inferredcites →https://doi.org/10.1145/1390630.1390656openalex-snapshot
Practical pluggable types for java
inferredcites →https://doi.org/10.1145/1480881.1480917openalex-snapshot
Compositional shape analysis by means of bi-abduction
inferredcites →https://doi.org/10.1145/1542431.1542449openalex-snapshot
Dynamic shape analysis via degree metrics
inferredcites →https://doi.org/10.1145/1596527.1596528openalex-snapshot
Dependence clusters in source code
inferredcites →https://doi.org/10.1145/1709093.1709095openalex-snapshot
A termination analyzer for Java bytecode based on path-length
inferredcites →https://doi.org/10.1145/1925844.1926389openalex-snapshot
Points-to analysis with efficient strong updates
inferredcites →https://doi.org/10.1145/1926385.1926389openalex-snapshot
Points-to analysis with efficient strong updates
inferredcites →https://doi.org/10.1145/1985793.1985826openalex-snapshot
Inference of field initialization
inferredcites →https://doi.org/10.1145/2442776.2442783openalex-snapshot
Automatic predicate abstraction of C programs
inferredcites →https://doi.org/10.1145/271510.271517openalex-snapshot
Solving shape-analysis problems in languages with destructive updating
inferredcites →https://doi.org/10.1145/332740.332741openalex-snapshot
Using shape analysis to reduce finite-state models of concurrent Java programs
inferredcites →https://doi.org/10.1145/378795.378846openalex-snapshot
Automatic predicate abstraction of C programs
inferredcites →https://doi.org/10.1145/504282.504286openalex-snapshot
Points-to analysis for Java using annotated constraints
inferredcites →https://doi.org/10.1145/504311.504286openalex-snapshot
Points-to analysis for Java using annotated constraints
inferredcites →https://doi.org/10.1145/514188.514190openalex-snapshot
Parametric shape analysis via 3-valued logic
inferredcites →https://doi.org/10.1145/567067.567073openalex-snapshot
Verifying reachability invariants of linked structures
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
inferredcites →https://doi.org/10.82308/51062openalex-snapshot
Program analysis using binary decision diagrams
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/tee.23467openalex-snapshot
DFlow : A Data Flow Analysis Tool for C/C++
inferred← citeshttps://doi.org/10.1007/978-3-030-39322-9_2openalex-snapshot
$$\mathsf {BackFlow}$$: Backward Context-Sensitive Flow Reconstruction of Taint Analysis Results
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_46openalex-snapshot
Checking Array Bounds by Abstract Interpretation and Symbolic Expressions
inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_33openalex-snapshot
Reachability Analysis of Program Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-32943-2_6openalex-snapshot
Definite Expression Aliasing Analysis for Java Bytecode
inferred← citeshttps://doi.org/10.1007/978-3-662-48899-7_10openalex-snapshot
Boolean Formulas for the Static Identification of Injection Attacks in Java
inferred← citeshttps://doi.org/10.1007/978-3-662-53413-7_3openalex-snapshot
The Julia Static Analyzer for Java
inferred← citeshttps://doi.org/10.1109/tse.2015.2431688openalex-snapshot
Inferring Loop Invariants by Mutation, Dynamic Analysis, and Static Checking
inferred← citeshttps://doi.org/10.1145/2629478openalex-snapshot
Inference of Field-Sensitive Reachability and Cyclicity
inferred← citeshttps://doi.org/10.1145/2746266.2746271openalex-snapshot
Android Malware Static Analysis Techniques
inferred← citeshttps://doi.org/10.1145/3332371openalex-snapshot
Static Identification of Injection Attacks in Java
inferred← citeshttps://doi.org/10.48550/arxiv.1306.6526openalex-snapshot
Inference of Field-Sensitive Reachability and Cyclicity
inferred← citeshttps://doi.org/10.5281/zenodo.4902205openalex-snapshot
The Factors of Code Reviewing Process to Ensure Software Quality
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.