Formalizing non-interference for a simple bytecode language in Coq

Kammueller, Florian (2008) Formalizing non-interference for a simple bytecode language in Coq. Formal Aspects of Computing, 20 (3). pp. 259-275. ISSN 0934-5043

[img]
Preview
PDF - Accepted Version
255kB

Abstract

In this paper, we describe the application of the interactive theorem prover Coq to the security analysis of bytecode as used in Java. We provide a generic specification and proof of non-interference for bytecode languages using the Coq module system. We illustrate the use of this formalization by applying it to a small subset of Java bytecode. The emphasis of the paper is on modularity of a language formalization and its analysis in a machine proof.

Item Type:Article
Research Areas:Middlesex University Schools and Centres > School of Science and Technology > Computer Science
Middlesex University Schools and Centres > School of Science and Technology > Computer Science > Foundations of Computing group
Middlesex University Schools and Centres > School of Science and Technology > Computer Science > Artificial Intelligence group
ID Code:6847
Permissions granted by publisher:Post refereed version as permitted by publisher.
Useful Links:
Deposited On:06 Jan 2011 17:04
Last Modified:29 Oct 2014 22:10

Repository staff only: item control page

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year