Type-based flow analysis and context-free language reachability
DOI10.1017/S0960129508006968zbMATH Open1156.68015OpenAlexW2081272942MaRDI QIDQ3535677FDOQ3535677
Authors: Manuel Fähndrich, Jakob Rehof
Publication date: 13 November 2008
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129508006968
Recommendations
Formal languages and automata (68Q45) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
Cited In (13)
- Context-sensitive data-dependence analysis via linear conjunctive language reachability
- Type-based information flow analysis for the \(\pi\)-calculus
- Specification inference using context-free language reachability
- Type systems equivalent to data-flow analyses for imperative languages
- Title not available (Why is that?)
- Type-base flow analysis
- Interprocedural type propagation for object-oriented languages
- A type-based escape analysis for functional languages
- Existential Label Flow Inference Via CFL Reachability
- Title not available (Why is that?)
- Interprocedural analysis with lazy propagation
- Correctness of static flow analysis in continuation semantics
- Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators
This page was built for publication: Type-based flow analysis and context-free language reachability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535677)