{"title":"验证混合系统的信息流特性","authors":"P. Prabhakar, Boris Köpf","doi":"10.1145/2461446.2461458","DOIUrl":null,"url":null,"abstract":"In this paper, we study the problem of analyzing information flow properties of hybrid systems. We begin by formalizing non-interference -- the baseline information flow property -- for hybrid systems. We then present a type system for statically enforcing non-interference, together with a proof of soundness. We conclude with discussions on future work towards analyzing more permissive information flow properties.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Verifying information flow properties of hybrid systems\",\"authors\":\"P. Prabhakar, Boris Köpf\",\"doi\":\"10.1145/2461446.2461458\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the problem of analyzing information flow properties of hybrid systems. We begin by formalizing non-interference -- the baseline information flow property -- for hybrid systems. We then present a type system for statically enforcing non-interference, together with a proof of soundness. We conclude with discussions on future work towards analyzing more permissive information flow properties.\",\"PeriodicalId\":203753,\"journal\":{\"name\":\"International Conference on High Confidence Networked Systems\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on High Confidence Networked Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2461446.2461458\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on High Confidence Networked Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2461446.2461458","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Verifying information flow properties of hybrid systems
In this paper, we study the problem of analyzing information flow properties of hybrid systems. We begin by formalizing non-interference -- the baseline information flow property -- for hybrid systems. We then present a type system for statically enforcing non-interference, together with a proof of soundness. We conclude with discussions on future work towards analyzing more permissive information flow properties.