Type systems equivalent to data-flow analyses for imperative languages

DOI10.1016/j.tcs.2006.08.013zbMath1153.68351OpenAlexW2149925406WikidataQ62043271 ScholiaQ62043271MaRDI QIDQ860844

Tarmo Uustalu, Peeter Laud, Varmo Vene

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.013

zbMATH Keywords

type systemssecure information flowdata-flow analyses

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items (4)

Dead code elimination based pointer analysis for multithreaded programs ⋮ Recognition of logically related regions based heap abstraction ⋮ Program and proof optimizations with type systems ⋮ From flow logic to static type systems for coordination languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lightweight bytecode verification
• From Polyvariant flow information to intersection and union types
• An Axiomatic Approach to Information Flow in Programs
• Certification of programs for secure information flow
• Verified lightweight bytecode verification
• Oracle-based checking of untrusted software
• Programming Languages and Systems
• On flow-sensitive security types
• Static Analysis
• Logic for Programming, Artificial Intelligence, and Reasoning

This page was built for publication: Type systems equivalent to data-flow analyses for imperative languages