Typing Local Control and State Using Flow Analysis

DOI10.1007/978-3-642-19718-5_14zbMath1326.68048OpenAlexW1591203048MaRDI QIDQ3000584

Arjun Guha, Shriram Krishnamurthi, Claudiu Saftoiu

Publication date: 19 May 2011

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19718-5_14

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Migrating gradual types ⋮ Inferring Effective Types for Static Analysis of C Programs ⋮ Verifying Whiley programs with Boogie

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The design and implementation of typed scheme
• Intensional polymorphism in type-erasure semantics
• Interprocedural Analysis with Lazy Propagation
• Logical types for untyped languages
• Modular set-based analysis from contracts

This page was built for publication: Typing Local Control and State Using Flow Analysis