Formalizing non-interference for a simple bytecode language in Coq
Kammueller, Florian 
ORCID: https://orcid.org/0000-0001-5839-5488
(2008)
Formalizing non-interference for a simple bytecode language in Coq.
Formal Aspects of Computing, 20
(3)
.
pp. 259-275.
ISSN 0934-5043
[Article]
|
PDF
- Final accepted version (with author's formatting)
Download (255kB) | Preview |
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: | A. > School of Science and Technology > Computer Science > Foundations of Computing group A. > School of Science and Technology > Computer Science > Artificial Intelligence group |
| Item ID: | 6847 |
| Notes on copyright: | Post refereed version as permitted by publisher. |
| Useful Links: | |
| Depositing User: | Dr Florian Kammueller |
| Date Deposited: | 06 Jan 2011 17:04 |
| Last Modified: | 30 Nov 2022 01:51 |
| URI: | https://eprints.mdx.ac.uk/id/eprint/6847 |
Actions (login required)
 |
View Item |
Statistics
Additional statistics are available via IRStats2.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)