{"title":"自动证明不受干扰IFFree","authors":"C. Faure, V. Delebarre","doi":"10.1145/2993412.3007551","DOIUrl":null,"url":null,"abstract":"Manually proving software level Freedom From Interference is really difficult because it requires the identification of all code statements where an interference may happen. Static analysis enables the automatic identification of code statement leading to interferences and SafeRiver has developed a static tool for software level interferences identification.","PeriodicalId":409631,"journal":{"name":"Proccedings of the 10th European Conference on Software Architecture Workshops","volume":"175 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Automatic proof of freedom from interference with IFFree\",\"authors\":\"C. Faure, V. Delebarre\",\"doi\":\"10.1145/2993412.3007551\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Manually proving software level Freedom From Interference is really difficult because it requires the identification of all code statements where an interference may happen. Static analysis enables the automatic identification of code statement leading to interferences and SafeRiver has developed a static tool for software level interferences identification.\",\"PeriodicalId\":409631,\"journal\":{\"name\":\"Proccedings of the 10th European Conference on Software Architecture Workshops\",\"volume\":\"175 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proccedings of the 10th European Conference on Software Architecture Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2993412.3007551\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proccedings of the 10th European Conference on Software Architecture Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2993412.3007551","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Automatic proof of freedom from interference with IFFree
Manually proving software level Freedom From Interference is really difficult because it requires the identification of all code statements where an interference may happen. Static analysis enables the automatic identification of code statement leading to interferences and SafeRiver has developed a static tool for software level interferences identification.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
