Information Flow Inference For Free (2000)
Cached
Download Links
- [pauillac.inria.fr]
- [pauillac.inria.fr]
- [cristal.inria.fr]
- DBLP
Other Repositories/Bibliography
by
Franois Pottier
,
Sylvain Conchon
| Venue: | In Proc. 5th ACM SIGPLAN International Conference on Functional Programming (ICFP |
| Citations: | 67 - 2 self |
BibTeX
@INPROCEEDINGS{Pottier00informationflow,
author = {Franois Pottier and Sylvain Conchon},
title = {Information Flow Inference For Free},
booktitle = {In Proc. 5th ACM SIGPLAN International Conference on Functional Programming (ICFP},
year = {2000},
pages = {46--57}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper shows how to systematically extend an arbitrary type system with dependency information, and how soundness and non-interference proofs for the new system may rely upon, rather than duplicate, the soundness proof of the original system. This allows enriching virtually any of the type systems known today with information ow analysis, while requiring only a minimal proof eort.
