| Abstract |
|
This paper presents a new type syste tracing information flow for a \lambda calculus equipped with polymorphic "let" and with sums (a.k.a.union types or polymorphic variants). The type system allows establishing (weak) non-interference properties. Thanks to original forms of security annotations and constraints, it is more accurate than existing analyses. Through a straightforward encoding into sums, this work also provides a new type-based information flow analysis for programming languages featuring exceptions. From these systems, one may derive constraint-based formulations, in the style of HM(X), which have decidable type inference.
|
 Additional Information
|
Citation:
Vincent Simonet,
"Fine-Grained Information Flow Analysis for a \lambda Calculus with Sum Types,"
csfw,
p. 223,
15th IEEE Computer Security Foundations Workshop (CSFW'02),
2002
|
