On the public citation graph
A toolkit for constructing type- and constraint-based program analyses
0 signed · 70 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-57659-2_30openalex-snapshot
FIAT: A framework for interprocedural analysis and transformation
inferredcites →https://doi.org/10.1007/3-540-60360-3_31openalex-snapshot
Generation of efficient interprocedural analyzers with PAG
inferredcites →https://doi.org/10.1007/3-540-61053-7_57openalex-snapshot
How to uniformly specify program analysis and transformation with graph rewrite systems
inferredcites →https://doi.org/10.1007/bfb0032737openalex-snapshot
Program analysis using mixed term and set constraints
inferredcites →https://doi.org/10.1007/bfb0054172openalex-snapshot
Detecting races in relay ladder logic programs
inferredcites →https://doi.org/10.1109/icse.1996.493449openalex-snapshot
A flexible architecture for building data flow analyzers
inferredcites →https://doi.org/10.1145/141471.141542openalex-snapshot
Global tagging optimization by type inference
inferredcites →https://doi.org/10.1145/143095.143120openalex-snapshot
Sharlit---a tool for building optimizers
inferredcites →https://doi.org/10.1145/158511.158642openalex-snapshot
Automatic generation and management of interprocedural program analyses
inferredcites →https://doi.org/10.1145/165180.165188openalex-snapshot
Type inclusion constraints and type inference
inferredcites →https://doi.org/10.1145/174675.177847openalex-snapshot
Soft typing with conditional types
inferredcites →https://doi.org/10.1145/174675.177855openalex-snapshot
Implementation of the typed call-by-value λ-calculus using a stack of regions
inferredcites →https://doi.org/10.1145/182409.182495openalex-snapshot
Set-based analysis of ML programs
inferredcites →https://doi.org/10.1145/217838.217858openalex-snapshot
Sound polymorphic type inference for objects
inferredcites →https://doi.org/10.1145/231379.231387openalex-snapshot
Catching bugs in the web of program invariants
inferredcites →https://doi.org/10.1145/236337.236342openalex-snapshot
Code reuse in an optimizing compiler
inferredcites →https://doi.org/10.1145/237721.237727openalex-snapshot
Points-to analysis in almost linear time
inferredcites →https://doi.org/10.1145/258915.258939openalex-snapshot
Linear-time subtransitive control flow analysis
inferredcites →https://doi.org/10.1145/277650.277667openalex-snapshot
Partial online cycle elimination in inclusion constraint graphs
inferredcites →https://doi.org/10.1145/321921.321938openalex-snapshot
Global Data Flow Analysis and Iterative Algorithms
inferredcites →https://doi.org/10.1145/390013.808480openalex-snapshot
Global common subexpression elimination
inferredcites →https://doi.org/10.1145/512927.512945openalex-snapshot
A unified approach to global program optimization
inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs
inferredcites →https://doi.org/10.1145/73141.74819openalex-snapshot
A framework for construction and evaluation of high-level specifications for program analysis techniques
inferredcites →https://doi.org/10.1145/75277.75284openalex-snapshot
Type checking records and variants in a natural extension of ML
inferredcites →https://doi.org/10.21236/ada256798openalex-snapshot
Report on the FX-91 Programming Language
inferredcites →https://doi.org/10.5555/227726.227843openalex-snapshot
A flexible architecture for building data flow analyzers
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2001.2963openalex-snapshot
Simplifying Subtyping Constraints: A Theory
inferred← citeshttps://doi.org/10.1007/11547662_16openalex-snapshot
Banshee: A Scalable Constraint-Based Analysis Toolkit
inferred← citeshttps://doi.org/10.1007/11688839_5openalex-snapshot
Context-Sensitive Points-to Analysis: Is It Worth It?
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_11openalex-snapshot
Flow Logic: A Multi-paradigmatic Approach to Static Analysis
inferred← citeshttps://doi.org/10.1007/3-540-36579-6_12openalex-snapshot
Scaling Java Points-to Analysis Using Spark
inferred← citeshttps://doi.org/10.1007/3-540-45306-7_5openalex-snapshot
Imperative Program Transformation by Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-030-47147-7_6openalex-snapshot
Set Constraints, Pattern Match Analysis, and SMT
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_10openalex-snapshot
Polymorphic versus Monomorphic Flow-Insensitive Points-To Analysis for C
inferred← citeshttps://doi.org/10.1007/978-3-642-39038-8_17openalex-snapshot
QUIC Graphs: Relational Invariant Generation for Containers
inferred← citeshttps://doi.org/10.1007/978-81-322-2268-2_59openalex-snapshot
Static Analysis: A Survey of Techniques and Tools
inferred← citeshttps://doi.org/10.1007/pl00010810openalex-snapshot
Detecting races in Relay Ladder Logic programs
inferred← citeshttps://doi.org/10.1016/j.scico.2005.03.003openalex-snapshot
Dynamic inference of polymorphic lock types
inferred← citeshttps://doi.org/10.1016/s0167-6423(01)00015-6openalex-snapshot
An empirical study into COBOL type inferencing
inferred← citeshttps://doi.org/10.1109/icmecg.2009.111openalex-snapshot
A Penetration Testing Method for E-Commerce Authentication System Security
inferred← citeshttps://doi.org/10.1109/icsm.2002.1167823openalex-snapshot
Constructing precise object relation diagrams
inferred← citeshttps://doi.org/10.1109/icsm.2005.24openalex-snapshot
Annotated inclusion constraints for precise flow analysis
inferred← citeshttps://doi.org/10.1109/saner.2016.15openalex-snapshot
Supporting Program Analysis for Non-Mainstream Languages: Experiences and Lessons Learned
inferred← citeshttps://doi.org/10.1142/s0129054107004668openalex-snapshot
UN-KLEENE BOOLEAN EQUATION SOLVING
inferred← citeshttps://doi.org/10.1145/1044834.1044835openalex-snapshot
Parameterized object sensitivity for points-to analysis for Java
inferred← citeshttps://doi.org/10.1145/1069774.1069784openalex-snapshot
Automatic type inference via partial evaluation
inferred← citeshttps://doi.org/10.1145/1094811.1094817openalex-snapshot
Demand-driven points-to analysis for Java
inferred← citeshttps://doi.org/10.1145/1146238.1146260openalex-snapshot
The case for analysis preserving language transformation
inferred← citeshttps://doi.org/10.1145/1250734.1250772openalex-snapshot
Regularly annotated set constraints
inferred← citeshttps://doi.org/10.1145/1391984.1391987openalex-snapshot
Evaluating the benefits of context-sensitive points-to analysis using a BDD-based implementation
inferred← citeshttps://doi.org/10.1145/1529282.1529700openalex-snapshot
Static type inference for Ruby
inferred← citeshttps://doi.org/10.1145/2254064.2254112openalex-snapshot
Synthesizing software verifiers from proof rules
inferred← citeshttps://doi.org/10.1145/301618.301681openalex-snapshot
Efficient incremental run-time specialization for free
inferred← citeshttps://doi.org/10.1145/349299.349310openalex-snapshot
Off-line variable substitution for scaling points-to analysis
inferred← citeshttps://doi.org/10.1145/351240.351245openalex-snapshot
Information flow inference for free
inferred← citeshttps://doi.org/10.1145/378795.378855openalex-snapshot
Ultra-fast aliasing analysis using CLA
inferred← citeshttps://doi.org/10.1145/381694.378855openalex-snapshot
Ultra-fast aliasing analysis using CLA
inferred← citeshttps://doi.org/10.1145/504282.504286openalex-snapshot
Points-to analysis for Java using annotated constraints
inferred← citeshttps://doi.org/10.1145/566171.566174openalex-snapshot
Parameterized object sensitivity for points-to and side-effect analyses for Java
inferred← citeshttps://doi.org/10.22028/d291-25722openalex-snapshot
Set based failure diagnosis for concurrent constraint programming
inferred← citeshttps://doi.org/10.7282/t3-hj7s-mb71openalex-snapshot
Points-to analysis for Java based on annotated constraints
inferred← citeshttps://doi.org/10.82308/51062openalex-snapshot
Program analysis using binary decision diagrams
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.