D. Nguyen, Chung-Tuyen Luu, Anh-Hoang Truong, N. Radics
{"title":"使用Java PathFinder验证UML序列图的实现","authors":"D. Nguyen, Chung-Tuyen Luu, Anh-Hoang Truong, N. Radics","doi":"10.1109/KSE.2010.29","DOIUrl":null,"url":null,"abstract":"The introduction of combined fragments to UML 2.x sequence diagrams makes it much harder for programmers to check manually the correctness of an implementation, especially when the fragments are nested. We develop an extension for Symbolic Java Path Finder (SPF) to verify if a Java program correctly implements its sequence diagram specification. Our main contribution is an algorithm to follow SPF exploration both when it advances and when it backtracks to find execution paths that are not specified in the specifications. We also generate the test cases that make the implementation go wrong for reproducing and debugging the bugs.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Verifying Implementation of UML Sequence Diagrams Using Java PathFinder\",\"authors\":\"D. Nguyen, Chung-Tuyen Luu, Anh-Hoang Truong, N. Radics\",\"doi\":\"10.1109/KSE.2010.29\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The introduction of combined fragments to UML 2.x sequence diagrams makes it much harder for programmers to check manually the correctness of an implementation, especially when the fragments are nested. We develop an extension for Symbolic Java Path Finder (SPF) to verify if a Java program correctly implements its sequence diagram specification. Our main contribution is an algorithm to follow SPF exploration both when it advances and when it backtracks to find execution paths that are not specified in the specifications. We also generate the test cases that make the implementation go wrong for reproducing and debugging the bugs.\",\"PeriodicalId\":158823,\"journal\":{\"name\":\"2010 Second International Conference on Knowledge and Systems Engineering\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on Knowledge and Systems Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KSE.2010.29\",\"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 Second International Conference on Knowledge and Systems Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KSE.2010.29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Verifying Implementation of UML Sequence Diagrams Using Java PathFinder
The introduction of combined fragments to UML 2.x sequence diagrams makes it much harder for programmers to check manually the correctness of an implementation, especially when the fragments are nested. We develop an extension for Symbolic Java Path Finder (SPF) to verify if a Java program correctly implements its sequence diagram specification. Our main contribution is an algorithm to follow SPF exploration both when it advances and when it backtracks to find execution paths that are not specified in the specifications. We also generate the test cases that make the implementation go wrong for reproducing and debugging the bugs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
