May Testing, Non-interference, and Compositionality.
Tools
Tools
Tools
Schneider, S (2001) May Testing, Non-interference, and Compositionality. In: The First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology (MFCSIT2000), 2000-07-20 - 2000-07-21, Cork, ireland.
![[img]](/style/images/fileicons/application_pdf.png)
| PDF Available under License : See the attached licence file. 250Kb | |
![[img]](/style/images/fileicons/text_plain.png) | Plain Text (licence) 1516b |
Official URL: http://dx.doi.org/10.1016/S1571-0661(05)80064-7
Abstract
This paper uses CSP to introduce a characterisation of noninterference in terms of the deductions that may be made about high level processes by low level tests. May testing yields classic noninference, and has a concise formulation in CSP. It is preserved by a wider range of composition operators than are normally considered in the context of non-interference, and thus also composes under the operators traditionally studied with non-interference. The CSP characterisation of may noninterference also permits some attractive and simple Compositionality proofs. This work has benefitted from discussions with Peter Ryan, and from the careful reading and comments of the anonymous referees. The work has also received financial support from DERA.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Divisions: | Faculty of Engineering and Physical Sciences > Computing Science |
| Related URLs: | |
| ID Code: | 7217 |
| Deposited By: | Symplectic Elements |
| Deposited On: | 30 Sep 2011 16:06 |
| Last Modified: | 16 Feb 2013 16:10 |
Document Downloads
Repository Staff Only: item control page