Type systems equivalent to data-flow analyses for imperative languages
From MaRDI portal
Publication:860844
DOI10.1016/J.TCS.2006.08.013zbMATH Open1153.68351OpenAlexW2149925406WikidataQ62043271 ScholiaQ62043271MaRDI QIDQ860844FDOQ860844
Authors: Peeter Laud, Tarmo Uustalu, 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
Recommendations
Cites Work
- Cryptography. Theory and practice
- Title not available (Why is that?)
- Static Analysis
- An Axiomatic Approach to Information Flow in Programs
- Certification of programs for secure information flow
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lightweight bytecode verification
- On flow-sensitive security types
- From polyvariant flow information to intersection and union types
- Verified lightweight bytecode verification
- Title not available (Why is that?)
- Oracle-based checking of untrusted software
- Programming Languages and Systems
- Logic for Programming, Artificial Intelligence, and Reasoning
Cited In (10)
- From flow logic to static type systems for coordination languages
- Fissile type analysis, modular checking of almost everywhere invariants
- Bit-vector typestate analysis
- Bidirectional data flow analysis for type inferencing.
- Program and proof optimizations with type systems
- Tracking data-flow with open closure types
- Dead code elimination based pointer analysis for multithreaded programs
- Recognition of logically related regions based heap abstraction
- Flow analytic type system for array bound checks
- Types from Control Flow Analysis
This page was built for publication: Type systems equivalent to data-flow analyses for imperative languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860844)