{"title":"UML的一致性检查","authors":"P. Krishnan","doi":"10.1109/APSEC.2000.896695","DOIUrl":null,"url":null,"abstract":"In this article, we present an approach to defining UML diagrams in terms of state predicates and using the theorem prover PVS (Prototype Verification System) to verify consistency between various diagrams. We focus on the dynamic aspects of the various diagrams. Our approach can easily handle partially specified systems as the behaviour is described in terms of the history of the computation.","PeriodicalId":404621,"journal":{"name":"Proceedings Seventh Asia-Pacific Software Engeering Conference. APSEC 2000","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"40","resultStr":"{\"title\":\"Consistency checks for UML\",\"authors\":\"P. Krishnan\",\"doi\":\"10.1109/APSEC.2000.896695\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article, we present an approach to defining UML diagrams in terms of state predicates and using the theorem prover PVS (Prototype Verification System) to verify consistency between various diagrams. We focus on the dynamic aspects of the various diagrams. Our approach can easily handle partially specified systems as the behaviour is described in terms of the history of the computation.\",\"PeriodicalId\":404621,\"journal\":{\"name\":\"Proceedings Seventh Asia-Pacific Software Engeering Conference. APSEC 2000\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"40\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Seventh Asia-Pacific Software Engeering Conference. APSEC 2000\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APSEC.2000.896695\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Seventh Asia-Pacific Software Engeering Conference. APSEC 2000","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APSEC.2000.896695","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this article, we present an approach to defining UML diagrams in terms of state predicates and using the theorem prover PVS (Prototype Verification System) to verify consistency between various diagrams. We focus on the dynamic aspects of the various diagrams. Our approach can easily handle partially specified systems as the behaviour is described in terms of the history of the computation.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
