Information flow inference for ML
ACM Transactions on Programming Languages and Systems · 2003-01 · 25 (1) · 117-158
DOI: 10.1145/596980.596983 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Programming Languages and Systems, 2003-01. Verfasst von François Pottier und 1 weiteren Autor:innen. Die Arbeit wurde bisher 199-mal zitiert (Crossref) und nennt 33 Literaturangaben.
Abstract (Originalsprache)
This paper presents a type-based information flow analysis for a call-by-value λ-calculus equipped with references, exceptions and let-polymorphism, which we refer to as ML. The type system is constraint-based and has decidable type inference. Its noninterference proof is reasonably light-weight, thanks to the use of a number of orthogonal techniques. First, a syntactic segregation between values and expressions allows a lighter formulation of the type system. Second, noninterference is reduced to subject reduction for a nonstandard language extension. Lastly, a semi-syntactic approach to type soundness allows dealing with constraint-based polymorphism separately.
Zitieren
APA
Pottier, F., & Simonet, V. (2003). Information flow inference for ML. ACM Transactions on Programming Languages and Systems, 25(1), 117-158. https://doi.org/10.1145/596980.596983
Vancouver
Pottier F, Simonet V. Information flow inference for ML. ACM Transactions on Programming Languages and Systems. 2003;25(1):117-158. doi:10.1145/596980.596983
BibTeX
@article{Pottier2003,
author = {Pottier, François and Simonet, Vincent},
title = {Information flow inference for ML},
journal = {ACM Transactions on Programming Languages and Systems},
year = {2003},
volume = {25},
number = {1},
pages = {117--158},
doi = {10.1145/596980.596983}
}
EUVIMED