Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Reference33 articles.
1. A core calculus of dependency
2. Analysis and caching of dependencies
3. Fähndrich M. 1999. Bane: A library for scalable constraint-based program analysis. Ph.D. thesis University of California at Berkeley. URL: http://research.microsoft.com/∼maf/diss.ps.]] Fähndrich M. 1999. Bane: A library for scalable constraint-based program analysis. Ph.D. thesis University of California at Berkeley. URL: http://research.microsoft.com/∼maf/diss.ps.]]
Cited by
150 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献