{"title":"不干扰的代数方法(计算机安全)","authors":"Sylvan Pinsky","doi":"10.1109/CSFW.1992.236789","DOIUrl":null,"url":null,"abstract":"This paper introduces necessary and sufficient conditions for solving the Haigh-Young view-identical problem. A decision procedure, based on properties of the state transition matrix and the function relating states to outputs, is used to establish the equivalence between non-interference and the existence of Haigh-Young view-identical relations on the set of states.<<ETX>>","PeriodicalId":350578,"journal":{"name":"[1992] Proceedings The Computer Security Foundations Workshop V","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An algebraic approach to non-interference (computer security)\",\"authors\":\"Sylvan Pinsky\",\"doi\":\"10.1109/CSFW.1992.236789\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces necessary and sufficient conditions for solving the Haigh-Young view-identical problem. A decision procedure, based on properties of the state transition matrix and the function relating states to outputs, is used to establish the equivalence between non-interference and the existence of Haigh-Young view-identical relations on the set of states.<<ETX>>\",\"PeriodicalId\":350578,\"journal\":{\"name\":\"[1992] Proceedings The Computer Security Foundations Workshop V\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings The Computer Security Foundations Workshop V\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSFW.1992.236789\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings The Computer Security Foundations Workshop V","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSFW.1992.236789","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An algebraic approach to non-interference (computer security)
This paper introduces necessary and sufficient conditions for solving the Haigh-Young view-identical problem. A decision procedure, based on properties of the state transition matrix and the function relating states to outputs, is used to establish the equivalence between non-interference and the existence of Haigh-Young view-identical relations on the set of states.<>