{"title":"正式验证/spl mu/-图表","authors":"D. Goldson","doi":"10.1109/APSEC.2002.1182982","DOIUrl":null,"url":null,"abstract":"This paper describes an experiment in the formal verification of /spl mu/-charts, a Statechart-like language with instantaneous communication. Properties of /spl mu/-charts are verified using a theory of chart refinement. By modelling /spl mu/-charts in the language of CSP used here as a semantic metalanguage, chart refinement is reduced to CSP trace refinement, which allows verification to be executed automatically using the model-checker FDR. A detailed verification of a motor vehicle central locking system is used to illustrate this approach. Results so far are promising, with the augmentation of a Statechart-like language with a refinement theory offering a more integrated method of reactive system design.","PeriodicalId":132364,"journal":{"name":"Ninth Asia-Pacific Software Engineering Conference, 2002.","volume":"86 12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Formal verification of /spl mu/-charts\",\"authors\":\"D. Goldson\",\"doi\":\"10.1109/APSEC.2002.1182982\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes an experiment in the formal verification of /spl mu/-charts, a Statechart-like language with instantaneous communication. Properties of /spl mu/-charts are verified using a theory of chart refinement. By modelling /spl mu/-charts in the language of CSP used here as a semantic metalanguage, chart refinement is reduced to CSP trace refinement, which allows verification to be executed automatically using the model-checker FDR. A detailed verification of a motor vehicle central locking system is used to illustrate this approach. Results so far are promising, with the augmentation of a Statechart-like language with a refinement theory offering a more integrated method of reactive system design.\",\"PeriodicalId\":132364,\"journal\":{\"name\":\"Ninth Asia-Pacific Software Engineering Conference, 2002.\",\"volume\":\"86 12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ninth Asia-Pacific Software Engineering Conference, 2002.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APSEC.2002.1182982\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ninth Asia-Pacific Software Engineering Conference, 2002.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APSEC.2002.1182982","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper describes an experiment in the formal verification of /spl mu/-charts, a Statechart-like language with instantaneous communication. Properties of /spl mu/-charts are verified using a theory of chart refinement. By modelling /spl mu/-charts in the language of CSP used here as a semantic metalanguage, chart refinement is reduced to CSP trace refinement, which allows verification to be executed automatically using the model-checker FDR. A detailed verification of a motor vehicle central locking system is used to illustrate this approach. Results so far are promising, with the augmentation of a Statechart-like language with a refinement theory offering a more integrated method of reactive system design.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
