DIKU ITU KVL

Copenhagen Programming Language Seminar

COPLAS Talk

A Logic for Information Flow in Object-Oriented Programs

Torben Amtoft,
Kansas State University

Monday, May 22nd, 15:15-16:00
DIKU, Universitetsparken 1, room N018

Abstract:

We specify, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer aliasing is ubiquitous in such programs, and can potentially leak confidential information. Thus the logic employs independence assertions to describe the noninterference property that formalizes confidentiality, and employs region assertions to describe possible aliasing. Programmer assertions, in the style of JML, are also allowed, thereby permitting a more fine-grained specification of information flow policy.

The logic supports local reasoning about state in the style of separation logic. Small specifications are used; they mention only the variables and addresses relevant to a command. Specifications are combined using a frame rule. An algorithm for the computation of postconditions is described: under certain assumptions, there exists a strongest postcondition which the algorithm computes.

This is joint work with Anindya Banerjee and Sruthi Bandhakavi. If time permits, I may also sketch a possible extension to concurrency.

Scientific host: Andrzej Filinski, Administrative host: Camilla Jensen. All are welcome.
The Copenhagen Programming Language Seminar (COPLAS) is a collaboration between DIKU, ITU and KVL.
COPLAS is sponsored by FIRST Graduate School.
To receive information about COPLAS talks by email, send a message to prog-lang-request@mail.it-c.dk with the word 'subscribe' as subject or in the body.

For more information about COPLAS, see http://www.coplas.org