A certified lightweight non-interference Java bytecode verifier†. (October 2013)

• Record Type: Journal Article
• Authors: BARTHE, GILLES; PICHARDIE, DAVID; REZK, TAMARA
• Is Part Of: Mathematical structures in computer science. Volume 23:Number 5(2013)
• Page Start: 1032
• Page End: 1081
• Publication Date: 2013-10
• Subjects: Computer science -- Mathematics -- Periodicals; 004.015105
• DOI: 10.1017/S0960129512000850
• Languages: English
• ISSNs: 0960-1295

Abstract

<abstract abstract-type="normal"> <title> <x content-type="archive" xml:space="preserve">Abstract</x> </title> <p>Non-interference guarantees the absence of illicit information flow throughout program execution. It can be enforced by appropriate information flow type systems. Much of the previous work on type systems for non-interference has focused on calculi or high-level programming languages, and existing type systems for low-level languages typically omit objects, exceptions and method calls. We define an information flow type system for a sequential JVM-like language that includes all these programming features, and we prove, in the Coq proof assistant, that it guarantees non-interference. An additional benefit of the formalisation is that we have extracted from our proof a certified lightweight bytecode verifier for information flow. Our work provides, to the best of our knowledge, the first sound and certified information flow type system for such an expressive fragment of the JVM.</p> </abstract>