{"title":"评估B模型的质量","authors":"Adrien De Kermadec, Frédéric Dadeau, F. Bouquet","doi":"10.1109/SEFM.2010.17","DOIUrl":null,"url":null,"abstract":"This paper proposes to define and assess the notion of quality of B models aiming at providing an automated feedback on a model by performing systematic checks on its content. We define and classify classes of automatic verification steps that help the modeller in knowing whether his model is well-written or not. This technique is defined in the context of ``behavioral models'' that describe the behavior of a system using the generalized substitutions mechanism. From these models, verification conditions are automatically computed and discharged using a dedicated tool. This technique has been adapted to the B notation, especially on B abstract machines, and implemented within a tool interfaced with a constraint solver that is able to find counter-examples to unvalid verification conditions.","PeriodicalId":211760,"journal":{"name":"2010 8th IEEE International Conference on Software Engineering and Formal Methods","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Assessing the Quality of B Models\",\"authors\":\"Adrien De Kermadec, Frédéric Dadeau, F. Bouquet\",\"doi\":\"10.1109/SEFM.2010.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes to define and assess the notion of quality of B models aiming at providing an automated feedback on a model by performing systematic checks on its content. We define and classify classes of automatic verification steps that help the modeller in knowing whether his model is well-written or not. This technique is defined in the context of ``behavioral models'' that describe the behavior of a system using the generalized substitutions mechanism. From these models, verification conditions are automatically computed and discharged using a dedicated tool. This technique has been adapted to the B notation, especially on B abstract machines, and implemented within a tool interfaced with a constraint solver that is able to find counter-examples to unvalid verification conditions.\",\"PeriodicalId\":211760,\"journal\":{\"name\":\"2010 8th IEEE International Conference on Software Engineering and Formal Methods\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 8th IEEE International Conference on Software Engineering and Formal Methods\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SEFM.2010.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 8th IEEE International Conference on Software Engineering and Formal Methods","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SEFM.2010.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper proposes to define and assess the notion of quality of B models aiming at providing an automated feedback on a model by performing systematic checks on its content. We define and classify classes of automatic verification steps that help the modeller in knowing whether his model is well-written or not. This technique is defined in the context of ``behavioral models'' that describe the behavior of a system using the generalized substitutions mechanism. From these models, verification conditions are automatically computed and discharged using a dedicated tool. This technique has been adapted to the B notation, especially on B abstract machines, and implemented within a tool interfaced with a constraint solver that is able to find counter-examples to unvalid verification conditions.