Modular and constraint-based information flow inference for an object-oriented language

Qi Sun, Anindya Banerjee, David A. Naumann

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

21 Scopus citations

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsRoberto Giacobazzi
Pages84-99
Number of pages16
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3148
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Modular and constraint-based information flow inference for an object-oriented language'. Together they form a unique fingerprint.

Cite this