Modular and Constraint-based Information Flow Inference for an Object-oriented Language (2004)
Cached
Download Links
- [www.cis.ksu.edu]
- [www.cs.stevens.edu]
- [cis.ksu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. of the Eleventh International Static Analysis Symposium (SAS |
| Citations: | 23 - 9 self |
BibTeX
@INPROCEEDINGS{Sun04modularand,
author = {Qi Sun and Anindya Banerjee and David A. Naumann},
title = {Modular and Constraint-based Information Flow Inference for an Object-oriented Language},
booktitle = {In Proc. of the Eleventh International Static Analysis Symposium (SAS},
year = {2004},
pages = {84--99},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper addresses the problem of checking programs written in an object-oriented language to ensure that they satisfy the information flow policies, confidentiality and integrity. Policy is specified using security types. An algorithm that infers such security types in a modular manner is presented. The specification of the algorithm involves inference for libraries. Library classes and methods maybe parameterized by security levels. It is shown how modular inference is achieved in the presence of method inheritance and override. Soundness and completeness theorems for the inference algorithm are given.
