W. Chu, Chih-Wei Lu, Hongji Yang, Xudong He
{"title":"构件检索和集成分析的形式化方法","authors":"W. Chu, Chih-Wei Lu, Hongji Yang, Xudong He","doi":"10.1002/1096-908X(200011/12)12:6%3C325::AID-SMR217%3E3.0.CO;2-%23","DOIUrl":null,"url":null,"abstract":"Software reuse has the potential to improve software quality and productivity. Software reuse covers the whole process of identification, representation, retrieval, adaptation and integration of reusable software components. Although object-oriented software has potentially high reusability, retrieving reusable object-oriented software may be difficult when the reuse library is large and inaccessibly represented. Furthermore, it is hard to check the consistency of component integration due to the lack of formal descriptions of required components. In this paper, we propose a formal approach for component retrieval and integration analysis during the reuse process. During the reuse process, software components are specified with logical predicates. A two-layer specification method is proposed. The class-layer specification is used for component retrieval and the member function-layer specification is used for consistency analysis during component integration. A formal model, predicate transition nets, is used for dynamic integration analysis. We show how to derive predicate transition nets from individual components and integrated components, and how to detect potential inconsistencies by checking the reachability tree of the predicate transition net representing an integrated program. Based on the approach proposed in this paper, a comprehensive tool can be implemented. Copyright © 2000 John Wiley & Sons, Ltd.","PeriodicalId":383619,"journal":{"name":"J. Softw. Maintenance Res. Pract.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A formal approach for component retrieval and integration analysis\",\"authors\":\"W. Chu, Chih-Wei Lu, Hongji Yang, Xudong He\",\"doi\":\"10.1002/1096-908X(200011/12)12:6%3C325::AID-SMR217%3E3.0.CO;2-%23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Software reuse has the potential to improve software quality and productivity. Software reuse covers the whole process of identification, representation, retrieval, adaptation and integration of reusable software components. Although object-oriented software has potentially high reusability, retrieving reusable object-oriented software may be difficult when the reuse library is large and inaccessibly represented. Furthermore, it is hard to check the consistency of component integration due to the lack of formal descriptions of required components. In this paper, we propose a formal approach for component retrieval and integration analysis during the reuse process. During the reuse process, software components are specified with logical predicates. A two-layer specification method is proposed. The class-layer specification is used for component retrieval and the member function-layer specification is used for consistency analysis during component integration. A formal model, predicate transition nets, is used for dynamic integration analysis. We show how to derive predicate transition nets from individual components and integrated components, and how to detect potential inconsistencies by checking the reachability tree of the predicate transition net representing an integrated program. Based on the approach proposed in this paper, a comprehensive tool can be implemented. Copyright © 2000 John Wiley & Sons, Ltd.\",\"PeriodicalId\":383619,\"journal\":{\"name\":\"J. Softw. Maintenance Res. Pract.\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Softw. Maintenance Res. Pract.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/1096-908X(200011/12)12:6%3C325::AID-SMR217%3E3.0.CO;2-%23\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Softw. Maintenance Res. Pract.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/1096-908X(200011/12)12:6%3C325::AID-SMR217%3E3.0.CO;2-%23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
A formal approach for component retrieval and integration analysis
Software reuse has the potential to improve software quality and productivity. Software reuse covers the whole process of identification, representation, retrieval, adaptation and integration of reusable software components. Although object-oriented software has potentially high reusability, retrieving reusable object-oriented software may be difficult when the reuse library is large and inaccessibly represented. Furthermore, it is hard to check the consistency of component integration due to the lack of formal descriptions of required components. In this paper, we propose a formal approach for component retrieval and integration analysis during the reuse process. During the reuse process, software components are specified with logical predicates. A two-layer specification method is proposed. The class-layer specification is used for component retrieval and the member function-layer specification is used for consistency analysis during component integration. A formal model, predicate transition nets, is used for dynamic integration analysis. We show how to derive predicate transition nets from individual components and integrated components, and how to detect potential inconsistencies by checking the reachability tree of the predicate transition net representing an integrated program. Based on the approach proposed in this paper, a comprehensive tool can be implemented. Copyright © 2000 John Wiley & Sons, Ltd.