University of Surrey

Test tubes in the lab Research in the ATI Dance Research

May Testing, Non-interference, and Compositionality.

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.

Available under License : See the attached licence file.

Download (256kB)
[img] Text (licence)

Download (1kB)


This paper uses CSP to introduce a characterisation of noninterference 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 (Conference Paper)
Divisions : Faculty of Engineering and Physical Sciences > Computing Science
Authors :
Schneider, S
Date : March 2001
DOI : 10.1016/S1571-0661(05)80064-7
Contributors :
Related URLs :
Depositing User : Symplectic Elements
Date Deposited : 30 Sep 2011 15:06
Last Modified : 31 Oct 2017 14:09

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800