On the public citation graph
Program analysis using mixed term and set constraints
0 signed · 73 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-58485-4_44openalex-snapshot
Compile-time detection of uncaught exceptions in Standard ML programs
inferredcites →https://doi.org/10.1007/3540543961_22openalex-snapshot
Efficient type inference for higher-order binding-time analysis
inferredcites →https://doi.org/10.1007/bfb0030609openalex-snapshot
Inclusion constraints over non-empty sets of trees
inferredcites →https://doi.org/10.1016/0022-0000(78)90014-4openalex-snapshot
A theory of type polymorphism in programming
inferredcites →https://doi.org/10.1016/0304-3975(90)90144-7openalex-snapshot
Type inference with subtypes
inferredcites →https://doi.org/10.1109/lics.1992.185545openalex-snapshot
Solving systems of set constraints
inferredcites →https://doi.org/10.1145/141471.141542openalex-snapshot
Global tagging optimization by type inference
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/231379.231387openalex-snapshot
Catching bugs in the web of program invariants
inferredcites →https://doi.org/10.1145/232627.232642openalex-snapshot
Simplifying subtyping constraints
inferredcites →https://doi.org/10.1145/237721.237727openalex-snapshot
Points-to analysis in almost linear time
inferredcites →https://doi.org/10.1145/258915.258937openalex-snapshot
Componential set-based analysis
inferredcites →https://doi.org/10.1145/258915.258939openalex-snapshot
Linear-time subtransitive control flow analysis
inferredcites →https://doi.org/10.1145/258948.258962openalex-snapshot
A practical subtyping system for Erlang
inferredcites →https://doi.org/10.1145/258948.258963openalex-snapshot
On the complexity of set-based analysis
inferredcites →https://doi.org/10.1145/263699.263703openalex-snapshot
Fast and accurate flow-insensitive points-to analysis
inferredcites →https://doi.org/10.1145/800017.800528openalex-snapshot
An ideal model for recursive polymorphic types
inferredcites →https://doi.org/10.1145/99583.99623openalex-snapshot
Algebraic reconstruction of types and effects
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.1007/11547662_16openalex-snapshot
Banshee: A Scalable Constraint-Based Analysis Toolkit
inferred← citeshttps://doi.org/10.1007/3-540-49201-1_16openalex-snapshot
Dead Code Elimination through Dependent Types
inferred← citeshttps://doi.org/10.1007/978-3-540-40018-9_19openalex-snapshot
Type Inference with Structural Subtyping: A Faithful Formalization of an Efficient Constraint Solver
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-540-78769-3_9openalex-snapshot
A Scalable Inclusion Constraint Solver Using Unification
inferred← citeshttps://doi.org/10.1007/978-3-642-15643-4_14openalex-snapshot
A Specification Logic for Exceptions and Beyond
inferred← citeshttps://doi.org/10.1007/bfb0032736openalex-snapshot
Towards a cost-effective estimation of uncaught exceptions in SML programs
inferred← citeshttps://doi.org/10.1007/bfb0055513openalex-snapshot
A toolkit for constructing type- and constraint-based program analyses
inferred← citeshttps://doi.org/10.1016/j.infsof.2016.05.003openalex-snapshot
A review on exception analysis
inferred← citeshttps://doi.org/10.1016/j.scico.2004.03.009openalex-snapshot
Type-safe method inlining
inferred← citeshttps://doi.org/10.1016/j.scico.2013.10.007openalex-snapshot
Modular type checking of anchored exception declarations
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00317-0openalex-snapshot
A cost-effective estimation of uncaught exceptions in Standard ML programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00325-6openalex-snapshot
A generic type system for the Pi-calculus
inferred← citeshttps://doi.org/10.1109/aero.2005.1559604openalex-snapshot
Precise and Scalable Static Program Analysis of NASA Flight Software
inferred← citeshttps://doi.org/10.1109/aero.2006.1656029openalex-snapshot
Verification of Autonomous Systems for Space Applications
inferred← citeshttps://doi.org/10.1109/aero.2008.4526577openalex-snapshot
Verification of C++ Flight Software with the MCP Model Checker
inferred← citeshttps://doi.org/10.1109/aero.2008.4526648openalex-snapshot
Automated Software Verification & Validation: An Emerging Approach for Ground Operations
inferred← citeshttps://doi.org/10.1145/1028976.1028978openalex-snapshot
Converting Java classes to use generics
inferred← citeshttps://doi.org/10.1145/1057387.1057392openalex-snapshot
A systematic approach to static access control
inferred← citeshttps://doi.org/10.1145/1094811.1094847openalex-snapshot
Combining the robustness of checked exceptions with the flexibility of unchecked exceptions using anchored exception declarations
inferred← citeshttps://doi.org/10.1145/1250734.1250772openalex-snapshot
Regularly annotated set constraints
inferred← citeshttps://doi.org/10.1145/1251535.1251543openalex-snapshot
An overview of the saturn project
inferred← citeshttps://doi.org/10.1145/1273920.1273923openalex-snapshot
Interactive, scalable, declarative program analysis
inferred← citeshttps://doi.org/10.1145/1480945.1480952openalex-snapshot
Translation and optimization for a core calculus with exceptions
inferred← citeshttps://doi.org/10.1145/1542476.1542483openalex-snapshot
Staged information flow for javascript
inferred← citeshttps://doi.org/10.1145/2211616.2211618openalex-snapshot
A framework for the checking and refactoring of crosscutting concepts
inferred← citeshttps://doi.org/10.1145/292540.292553openalex-snapshot
Aggregate structure identification and its application to program analysis
inferred← citeshttps://doi.org/10.1145/292540.292565openalex-snapshot
Type-based analysis of uncaught exceptions
inferred← citeshttps://doi.org/10.1145/325694.325700openalex-snapshot
A framework for combining analysis and verification
inferred← citeshttps://doi.org/10.1145/349214.349230openalex-snapshot
Type-based analysis of uncaught exceptions
inferred← citeshttps://doi.org/10.1145/353171.353190openalex-snapshot
Scalable propagation-based call graph construction algorithms
inferred← citeshttps://doi.org/10.1145/360204.360215openalex-snapshot
A generic type system for the Pi-calculus
inferred← citeshttps://doi.org/10.1145/581478.581488openalex-snapshot
Exception analysis for non-strict languages
inferred← citeshttps://doi.org/10.1145/583852.581488openalex-snapshot
Exception analysis for non-strict languages
inferred← citeshttps://doi.org/10.1145/944705.944710openalex-snapshot
An extension of HM(X) with bounded existential and universal data-types
inferred← citeshttps://doi.org/10.1145/996841.996869openalex-snapshot
Precise and efficient static array bound checking for large embedded C programs
inferred← citeshttps://doi.org/10.2168/lmcs-10(3:21)2014openalex-snapshot
Inferring Algebraic Effects
inferred← citeshttps://doi.org/10.22028/d291-25722openalex-snapshot
Set based failure diagnosis for concurrent constraint programming
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.