{"title":"归类不干涉","authors":"J. Jacob","doi":"10.1109/CSFW.1990.128184","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":185508,"journal":{"name":"[1990] Proceedings. The Computer Security Foundations Workshop III","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Categorising non-interference\",\"authors\":\"J. Jacob\",\"doi\":\"10.1109/CSFW.1990.128184\",\"DOIUrl\":null,\"url\":null,\"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.<<ETX>>\",\"PeriodicalId\":185508,\"journal\":{\"name\":\"[1990] Proceedings. The Computer Security Foundations Workshop III\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1990] Proceedings. The Computer Security Foundations Workshop III\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSFW.1990.128184\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990] Proceedings. The Computer Security Foundations Workshop III","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSFW.1990.128184","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
摘要
不干涉(见J. a . Goguen和J. Meseguer, 1982)在范畴论术语中给出了一个抽象的定义。展开定理从这个起点进行研究。定理假设命令形成一个单群。因此，结果不适用于某些命令序列在语法上无效的系统。对categories的扩展将把结果推广到并非每个字符串都是语法有效程序的语言。结论是范畴论是推理非干涉性的有力工具。
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.<>
![[1990] Proceedings. The Computer Security Foundations Workshop III](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
