by Franois Pottier, Sylvain Conchon
In Proc. 5th ACM SIGPLAN International Conference on Functional Programming (ICFP
http://pauillac.inria.fr/~fpottier/publis/fpottier-conchon-icfp00.ps.gz
Add To MetaCart
Abstract:
This paper shows how to systematically extend an arbitrary type system with dependency information, and how soundness and non-interference proofs for the new system may rely upon, rather than duplicate, the soundness proof of the original system. This allows enriching virtually any of the type systems known today with information ow analysis, while requiring only a minimal proof eort. Our approach is based on an untyped operational semantics for a labelled calculus akin to core ML. Thus, it is simple, and should be applicable to other computing paradigms, such as object or process calculi. The paper also discusses access control, and shows it may be viewed as entirely independent of information ow control. Letting the two mechanisms coexist, without interacting, yields a simple and expressive type system, which allows, in particular, selective declassication.
Citations
|
433
|
Security policies and security models
– Goguen, Meseguer
- 1982
|
|
409
|
Cryptography and Data Security
– Denning
- 1984
|
|
179
|
The SLam calculus: programming with secrecy and integrity
– Heintze, Riecke
- 1998
|
|
148
|
A core calculus of dependency
– Abadi, Banerjee, et al.
- 1999
|
|
63
|
Type inference with constrained types. Theory and practice of object systems
– Odersky, Sulzmann, et al.
- 1999
|
|
56
|
Objective ML: A simple object-oriented extension of ML
– Rémy, Vouillon
- 1997
|
|
51
|
Analysis and caching of dependencies
– Abadi, Lampson, et al.
- 1996
|
|
49
|
Implicit typing `a la ML for the join-calculus
– Fournet, Laneve, et al.
- 1997
|
|
44
|
A toolkit for constructing type- and constraint-based program analyses
– Aiken, Fahndrich, et al.
- 1998
|
|
38
|
Memoryless subsystems
– Fenton
- 1974
|
|
38
|
Polymorphic subtype inference: Closing the theorypractice gap
– Fuh, Mishra
- 1989
|
|
35
|
Mostly-Static Decentralized Information Flow Control
– Myers
- 1999
|
|
33
|
Trust in the *-calculus
– Palsberg, Orbaek
- 1995
|
|
30
|
Simplifying subtyping constraints: a theory
– Pottier
- 2001
|
|
18
|
A note on the con nement problem
– Lampson
- 1973
|
|
18
|
Type Inference in the Presence of Subtyping: from Theory to Practice
– Pottier
- 1998
|
|
7
|
Polymorphic type inference with overloading and subtyping
– Smith
- 1993
|
|
6
|
Compile-time detection of information ow in sequential programs
– Bantre, Bryce, et al.
- 1994
|
|
4
|
Certi of programs for secure information ow
– Denning, Denning
- 1977
|
|
3
|
An axiomatic approach to information ow in programs
– Andrews, Reitman
- 1980
|
|
3
|
Projective ML
– Rmy
- 1992
|
|
3
|
Building a bridge between pointer aliases and program dependences
– Ross, Sagiv
- 1998
|
|
2
|
Complete, safe information ow with decentralized labels
– Myers, Liskov
- 1998
|
