Formal verification of language-based concurrent noninterference
Popescu, Andrei, Hölzl, Johannes and Nipkow, Tobias (2013) Formal verification of language-based concurrent noninterference. Journal of Formalized Reasoning, 6 (1) . pp. 1-30. ISSN 1972-5787 [Article] (doi:10.6092/issn.1972-5787/3690)
|
PDF
- Published version (with publisher's formatting)
Download (360kB) | Preview |
Abstract
We perform a formal analysis of compositionality techniques for proving possibilistic noninterference for a while language with parallel composition. We develop a uniform framework where we express a wide range of noninterference variants from the literature and compare them w.r.t. their contracts: the strength of the security properties they ensure weighed against the harshness of the syntactic conditions they enforce. This results in a simple implementable algorithm for proving that a program has a specific noninterference property, using only compositionality, which captures uniformly several security type-system results from the literature and suggests a further improved type system. All formalism and theorems have been mechanically verified in Isabelle/HOL.
| Item Type: | Article |
|---|---|
| Research Areas: | A. > School of Science and Technology > Computer Science > Foundations of Computing group |
| Item ID: | 15372 |
| Notes on copyright: | Full text: Copyright (c) 2013 Andrei Popescu, Johannes Hölzl, Tobias Nipkow.
Creative Commons License: This work is licensed under a Creative Commons Attribution 3.0 International License - http://creativecommons.org/licenses/by/3.0/ |
| Useful Links: | |
| Depositing User: | Andrei Popescu |
| Date Deposited: | 27 Apr 2015 12:52 |
| Last Modified: | 17 Jun 2021 13:40 |
| URI: | https://eprints.mdx.ac.uk/id/eprint/15372 |
Actions (login required)
 |
View Item |
Statistics
Additional statistics are available via IRStats2.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)