Information flow inference for ML
Information flow inference for ML
复制标题
DOI:
10.1145/565816.503302
复制
发表时间:
2002-01-01
影响因子:
--
通讯作者:
Simonet, V
中科院分区:
文献类型:
--
作者:
Pottier, F;Simonet, V
This paper presents a type-based information flow analysis for a call-by-value lambda-calculus equipped with references, exceptions and let-polymorphism, which we refer to as Core ML. The type system is constraint-based and has decidable type inference. Its non-interference proof is reasonably lightweight, 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, non-interference is reduced to subject reduction for a non-standard language extension. Lastly, a semi-syntactic approach to type soundness allows dealing with constraint-based polymorphism separately.