loading...
Fine-Grained Information Flow Analysis for a \lambda Calculus with Sum Types
Cape Breton, Nova Scotia, Canada June 24-June 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSFW.2002.102181815th IEEE Computer Security Foundatio ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Vincent Simonet, "Fine-Grained Information Flow Analysis for a \lambda Calculus with Sum Types," Computer Security Foundations Workshop, IEEE, pp. 223, 15th IEEE Computer Security Foundations Workshop (CSFW'02), 2002.
 
 
BibTex
x
 
@article{ 10.1109/CSFW.2002.1021818,
author = {Vincent Simonet},
title = {Fine-Grained Information Flow Analysis for a \lambda Calculus with Sum Types},
journal ={Computer Security Foundations Workshop, IEEE},
volume = {0},
year = {2002},
issn = {1063-6900},
pages = {223},
doi = {http://doi.ieeecomputersociety.org/10.1109/CSFW.2002.1021818},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Security Foundations Workshop, IEEE
TI - Fine-Grained Information Flow Analysis for a \lambda Calculus with Sum Types
SN - 1063-6900
SP
EP
A1 - Vincent Simonet,
PY - 2002
KW - null
VL - 0
JA - Computer Security Foundations Workshop, IEEE
ER -
 
Vincent Simonet, INRI Rocquencourt
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.
Citation:
Vincent Simonet, "Fine-Grained Information Flow Analysis for a \lambda Calculus with Sum Types," csfw, pp.223, 15th IEEE Computer Security Foundations Workshop (CSFW'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.