Type-based flow analysis and context-free language reachability

DOI10.1017/S0960129508006968zbMath1156.68015OpenAlexW2081272942MaRDI QIDQ3535677

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

zbMATH Keywords

polymorphic subtypinginterprocedural dataflow analysis

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Principal type schemes for functional programs with overloading and subtyping
• Interconvertibility of a class of set constraints and context-free-language reachability

This page was built for publication: Type-based flow analysis and context-free language reachability