DocumentCode
2748148
Title
Categorising non-interference
Author
Jacob, Jeremy
Author_Institution
Comput. Lab., Oxford Univ., UK
fYear
1990
fDate
12-14 Jun 1990
Firstpage
44
Lastpage
50
Abstract
Noninterference (see J.A. Goguen and J. Meseguer, 1982) is given an abstract definition in category-theoretic terms. Unwinding theorems are investigated from this starting point. The theorems assume that commands form a monoid. Thus the results do not apply to systems where some sequences of commands are syntactically invalid. The extension to categories would generalize the results to languages where not every string is a syntactically valid program. It is concluded that category theory is a powerful tool for reasoning about noninterference
Keywords
formal logic; security of data; set theory; category theory; languages; monoid; noninterference; unwinding theorems; Equations; History; Information security; Jacobian matrices; Laboratories; Power system security; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Security Foundations Workshop III, 1990. Proceedings
Conference_Location
Franconia, NH
Print_ISBN
0-8186-2071-4
Type
conf
DOI
10.1109/CSFW.1990.128184
Filename
128184
Link To Document