CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Integration of a Security Type System into a Program Logic

Reiner Hähnle (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)) ; Jing Pan ; Philipp Rümmer ; Dennis Walter
2007. - 40 s.

Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensuring non-interference in a simple while language can be expressed through specialised rules of a program logic. In our framework, the structure of non-interference proofs resembles the corresponding derivations in a recent security type system, meaning that the algorithmic version of the type system can be used as a proof procedure for the logic. We argue that this is important for obtaining uniform proof certificates in a proof-carrying code framework. We discuss in which cases the interleaving of approximative and precise reasoning allows us to deal with delimited information release. Finally, we present ideas on how our results can be extended to encompass features of realistic programming languages like Java.

Nyckelord: program logics, program verification, secure information flow, type systems

Denna post skapades 2007-04-17. Senast ändrad 2013-08-13.
CPL Pubid: 40624


Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)
Institutionen för data- och informationsteknik, datavetenskap (GU) (GU)


Datavetenskap (datalogi)

Chalmers infrastruktur

Ingår i serie

Technical report - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University 2007:1