{"title":"正式验证:一个工业案例研究","authors":"B. Vergauwen, J. Lewi","doi":"10.1109/CMPEUR.1992.218507","DOIUrl":null,"url":null,"abstract":"By means of the mu PABX example, the adequacy of temporal logic was demonstrated for the specification and formal verification of industrial reactive systems. The aim of the mu PABX system is to provide services that are issued by phone-users of the mu PABX. In contrast to a real PABX, the mu PABX offers only one type of service to its subscribers: two-party voice calls. Formal verification avoids the deficiencies of testing by proving mathematically that the system behaves according to the specification. For this to be possible, the system behavior must be defined with mathematical precision. The focus is on the formal verification of the mu PABX. It is demonstrated that, if temporal logic is used, the task of proof construction can be 100% automated. An implementation of the mu PABX system is discussed.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"202 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Formal verifications: an industrial case study\",\"authors\":\"B. Vergauwen, J. Lewi\",\"doi\":\"10.1109/CMPEUR.1992.218507\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"By means of the mu PABX example, the adequacy of temporal logic was demonstrated for the specification and formal verification of industrial reactive systems. The aim of the mu PABX system is to provide services that are issued by phone-users of the mu PABX. In contrast to a real PABX, the mu PABX offers only one type of service to its subscribers: two-party voice calls. Formal verification avoids the deficiencies of testing by proving mathematically that the system behaves according to the specification. For this to be possible, the system behavior must be defined with mathematical precision. The focus is on the formal verification of the mu PABX. It is demonstrated that, if temporal logic is used, the task of proof construction can be 100% automated. An implementation of the mu PABX system is discussed.<<ETX>>\",\"PeriodicalId\":390273,\"journal\":{\"name\":\"CompEuro 1992 Proceedings Computer Systems and Software Engineering\",\"volume\":\"202 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-05-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CompEuro 1992 Proceedings Computer Systems and Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPEUR.1992.218507\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPEUR.1992.218507","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
By means of the mu PABX example, the adequacy of temporal logic was demonstrated for the specification and formal verification of industrial reactive systems. The aim of the mu PABX system is to provide services that are issued by phone-users of the mu PABX. In contrast to a real PABX, the mu PABX offers only one type of service to its subscribers: two-party voice calls. Formal verification avoids the deficiencies of testing by proving mathematically that the system behaves according to the specification. For this to be possible, the system behavior must be defined with mathematical precision. The focus is on the formal verification of the mu PABX. It is demonstrated that, if temporal logic is used, the task of proof construction can be 100% automated. An implementation of the mu PABX system is discussed.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
