On the public citation graph

Existential Label Flow Inference Via CFL Reachability

https://doi.org/10.1007/11823230_7
0 signed · 55 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.1002/(sici)1096-9942(199901/03)5:1<35::aid-tapo4>3.0.co;2-4openalex-snapshot
Type inference with constrained types
inferredcites →https://doi.org/10.1007/11823230_7openalex-snapshot
Existential Label Flow Inference Via CFL Reachability
inferredcites →https://doi.org/10.1007/3-540-47764-0_15openalex-snapshot
Estimating the Impact of Scalable Pointer Analysis on Optimization
inferredcites →https://doi.org/10.1007/3-540-49099-x_7openalex-snapshot
Types for Safe Locking
inferredcites →https://doi.org/10.1007/3-540-57887-0_102openalex-snapshot
Programming objects with ML-ART an extension to ML with abstract and record types
inferredcites →https://doi.org/10.1016/s0168-0072(98)00047-5openalex-snapshot
Typability and type checking in System F are equivalent and undecidable
inferredcites →https://doi.org/10.1017/s0956796800000113openalex-snapshot
Type inference with simple subtypes
inferredcites →https://doi.org/10.1145/1133255.1134019openalex-snapshot
LOCKSMITH
inferredcites →https://doi.org/10.1145/1165389.945471openalex-snapshot
Capriccio
inferredcites →https://doi.org/10.1145/1186632.1186635openalex-snapshot
Flow-insensitive type qualifiers
inferredcites →https://doi.org/10.1145/169701.169692openalex-snapshot
Type inference with polymorphic recursion
inferredcites →https://doi.org/10.1145/186025.186031openalex-snapshot
Polymorphic type inference and abstract data types
inferredcites →https://doi.org/10.1145/199448.199462openalex-snapshot
Precise interprocedural dataflow analysis via graph reachability
inferredcites →https://doi.org/10.1145/237721.237791openalex-snapshot
Typed closure conversion
inferredcites →https://doi.org/10.1145/258915.258937openalex-snapshot
Componential set-based analysis
inferredcites →https://doi.org/10.1145/2641638.2641653openalex-snapshot
MLF
inferredcites →https://doi.org/10.1145/292540.292560openalex-snapshot
Dependent types in practical programming
inferredcites →https://doi.org/10.1145/292540.292561openalex-snapshot
JFlow
inferredcites →https://doi.org/10.1145/349299.349309openalex-snapshot
Unification-based pointer analysis with directional assignments
inferredcites →https://doi.org/10.1145/349299.349332openalex-snapshot
Scalable context-sensitive flow analysis using instantiation constraints
inferredcites →https://doi.org/10.1145/358438.349332openalex-snapshot
Scalable context-sensitive flow analysis using instantiation constraints
inferredcites →https://doi.org/10.1145/360204.360208openalex-snapshot
Type-base flow analysis
inferredcites →https://doi.org/10.1145/373243.360208openalex-snapshot
Type-base flow analysis
inferredcites →https://doi.org/10.1145/379605.379635openalex-snapshot
Type-based analysis and applications
inferredcites →https://doi.org/10.1145/44501.45065openalex-snapshot
Abstract types have existential type
inferredcites →https://doi.org/10.1145/780822.781146openalex-snapshot
Checking and inferring local non-aliasing
inferredcites →https://doi.org/10.1145/944705.944710openalex-snapshot
An extension of HM(X) with bounded existential and universal data-types
inferredcites →https://doi.org/10.1145/944746.944709openalex-snapshot
ML F
inferredcites →https://doi.org/10.1145/945445.945471openalex-snapshot
Capriccio
inferredcites →https://doi.org/10.1145/996841.996867openalex-snapshot
The set constraint/CFL reachability connection in practice

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-031-44245-2_12openalex-snapshot
Mutual Refinements of Context-Free Language Reachability
inferred← citeshttps://doi.org/10.1007/978-3-642-03237-0_13openalex-snapshot
Region Analysis for Race Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_41openalex-snapshot
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-11319-2_17openalex-snapshot
Shape Analysis of Low-Level C with Overlapping Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-32469-7_13openalex-snapshot
A Formal Design of a Tool for Static Analysis of Upper Bounds on Object Calls in Java
inferred← citeshttps://doi.org/10.1007/978-3-642-54013-4_2openalex-snapshot
Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_33openalex-snapshot
Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_17openalex-snapshot
Bar-Hillel Theorem Mechanization in Coq
inferred← citeshttps://doi.org/10.1145/1251535.1251549openalex-snapshot
Improving software quality with static analysis
inferred← citeshttps://doi.org/10.1145/1889997.1890000openalex-snapshot
LOCKSMITH
inferred← citeshttps://doi.org/10.1145/2491956.2462159openalex-snapshot
Fast algorithms for Dyck-CFL-reachability with applications to alias analysis
inferred← citeshttps://doi.org/10.1145/2499370.2462159openalex-snapshot
Fast algorithms for Dyck-CFL-reachability with applications to alias analysis
inferred← citeshttps://doi.org/10.1145/2660193.2660213openalex-snapshot
Efficient subcubic alias analysis for C
inferred← citeshttps://doi.org/10.1145/2676726.2676997openalex-snapshot
Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks
inferred← citeshttps://doi.org/10.1145/2714064.2660213openalex-snapshot
Efficient subcubic alias analysis for C
inferred← citeshttps://doi.org/10.1145/2775051.2676997openalex-snapshot
Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks
inferred← citeshttps://doi.org/10.1145/2970276.2970337openalex-snapshot
Static race detection for device drivers: the Goblint approach
inferred← citeshttps://doi.org/10.1145/3009837.3009848openalex-snapshot
Context-sensitive data-dependence analysis via linear conjunctive language reachability
inferred← citeshttps://doi.org/10.1145/3093333.3009848openalex-snapshot
Context-sensitive data-dependence analysis via linear conjunctive language reachability
inferred← citeshttps://doi.org/10.1145/3241653.3241655openalex-snapshot
Parser combinators for context-free path querying
inferred← citeshttps://doi.org/10.1145/3527322openalex-snapshot
C to checked C by 3c
inferred← citeshttps://doi.org/10.1145/3563339openalex-snapshot
Indexing the extended Dyck-CFL reachability for context-sensitive program analysis
inferred← citeshttps://doi.org/10.1145/3721145.3725762openalex-snapshot
GraCFL: A Holistically Designed Vertex-Centric Graph System for CFL Reachability
inferred← citeshttps://doi.org/10.1145/3776686openalex-snapshot
Context-Free-Language Reachability for Almost-Commuting Transition Systems
showing the first 24 of 25 · page through all 25
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.