Type systems equivalent to data-flow analyses for imperative languages

Authors:
Peeter Laud;Tarmo Uustalu;Varmo Vene
Affiliations:
Department of Computer Science, University of Tartu, Tartu, Estonia;Institute of Cybernetics at Tallinn University of Technology, Tallinn, Estonia;Department of Computer Science, University of Tartu, Tartu, Estonia and Institute of Cybernetics at Tallinn University of Technology, Tallinn, Estonia
Venue:
Theoretical Computer Science - Applied semantics
Year:
2006

Citing 16
Cited 5

A type system equivalent to flow analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types as abstract interpretations

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A sound type system for secure flow analysis

Journal of Computer Security
An Axiomatic Approach to Information Flow in Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Certification of programs for secure information flow

Communications of the ACM
Oracle-based checking of untrusted software

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Cryptography: Theory and Practice,Second Edition

Cryptography: Theory and Practice,Second Edition
Principles of Program Analysis

Principles of Program Analysis
Eliminating counterevidence with applications to accountable certificate management

Journal of Computer Security
Control-Flow Analysis and Type Systems

SAS '95 Proceedings of the Second International Symposium on Static Analysis
From Polyvariant flow information to intersection and union types

Journal of Functional Programming
Lightweight Bytecode Verification

Journal of Automated Reasoning
On flow-sensitive security types

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handling encryption in an analysis for secure information flow

ESOP'03 Proceedings of the 12th European conference on Programming
A type system equivalent to a model checker

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems

Type Systems for Optimizing Stack-based Code

Electronic Notes in Theoretical Computer Science (ENTCS)
Bidirectional data-flow analyses, type-systematically

Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Certificate translation for optimizing compilers

ACM Transactions on Programming Languages and Systems (TOPLAS)
From Flow Logic to static type systems for coordination languages

Science of Computer Programming
Flow sensitive-insensitive pointer analysis based memory safety for multithreaded programs

ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V

Quantified Score

Hi-index	0.01

Visualization

Abstract

We show that a large class of data-flow analyses for imperative languages are describable as type systems in the following technical sense: possible results of an analysis can be described in a language of types so that a program checks with a type if and only if this type is a supertype of the result of applying the analysis. Type-checking is easy with the help of a certificate that records the "eureka"-bits of a typing derivation. Certificate-assisted type-checking amounts to a form of lightweight analysis à la Rose. For secure information flow, we obtain a type system that is considerably more precise than that of Volpano et al., but not more sophisticated. Importantly, our type systems are compositional.