This paper describes a case study that uses clustering to group classes of an existing object-oriented system of significant size into subsystems. The clustering process is based on the structural relations between the classes: associations, generalizations and dependencies. We experiment with different combinations of relationships and different ways to use this information in the clustering process. The results clearly show that dependency relations are vital to achieve good clusterings. The clustering is performed with a third party tool called Bunch. Compared to other clustering methods the results come relatively close to the result of a manual reconstruction. Performance wise the clustering takes a significant amount of time, but not too much to make it unpractical. In our case study, we base the clustering on information from multiple versions and compare the result to that obtained when basing the clustering on a single version. We experiment with several combinations of versions. If the clustering is based on relations that were present in both the reconstructed and the first version this leads to a significantly better clustering result compared to that obtained when using only information from the reconstructed version
{"title":"Using version information in architectural clustering - a case study","authors":"A. Wierda, Eric Dortmans, L. Somers","doi":"10.1109/CSMR.2006.56","DOIUrl":"https://doi.org/10.1109/CSMR.2006.56","url":null,"abstract":"This paper describes a case study that uses clustering to group classes of an existing object-oriented system of significant size into subsystems. The clustering process is based on the structural relations between the classes: associations, generalizations and dependencies. We experiment with different combinations of relationships and different ways to use this information in the clustering process. The results clearly show that dependency relations are vital to achieve good clusterings. The clustering is performed with a third party tool called Bunch. Compared to other clustering methods the results come relatively close to the result of a manual reconstruction. Performance wise the clustering takes a significant amount of time, but not too much to make it unpractical. In our case study, we base the clustering on information from multiple versions and compare the result to that obtained when basing the clustering on a single version. We experiment with several combinations of versions. If the clustering is based on relations that were present in both the reconstructed and the first version this leads to a significantly better clustering result compared to that obtained when using only information from the reconstructed version","PeriodicalId":443362,"journal":{"name":"Conference on Software Maintenance and Reengineering (CSMR'06)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130041594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We have created a process model for managing corrective maintenance requests at the front-end support level. Our model is called CM3: front-end problem management. It was elicited at two ABB organisations and refined at Cap Gemini Ernst & Young and Scandinavian Airline Systems. In this paper, we evaluate it on a major scale using feedback from 15 major software organisations. The evaluation results show that CM3: front-end problem management appropriately mirrors the industrial reality
{"title":"Evaluation of CM^3: Front-End Problem Management within Industry","authors":"M. Kajko-Mattsson","doi":"10.1109/CSMR.2006.27","DOIUrl":"https://doi.org/10.1109/CSMR.2006.27","url":null,"abstract":"We have created a process model for managing corrective maintenance requests at the front-end support level. Our model is called CM3: front-end problem management. It was elicited at two ABB organisations and refined at Cap Gemini Ernst & Young and Scandinavian Airline Systems. In this paper, we evaluate it on a major scale using feedback from 15 major software organisations. The evaluation results show that CM3: front-end problem management appropriately mirrors the industrial reality","PeriodicalId":443362,"journal":{"name":"Conference on Software Maintenance and Reengineering (CSMR'06)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127820903","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Software maintenance and reuse require identification of the applied software licenses. The information needs of maintainers and reusers can be supported by reverse engineering tools at different information retrieval levels. The paper presents a reverse engineering approach called ASLA for retrieving license information typically used in OSS. User needs, system architecture, tool features, and tool evaluation are presented. The implemented tool features include support for identifying source file dependencies and licenses in source files. The tool is evaluated against another tool for license information extraction. ASLA supports the same programming languages as GCC. License identification coverage is good and the tool is extendable
{"title":"ASLA: reverse engineering approach for software license information retrieval","authors":"Timo Tuunanen, Jussi Koskinen, T. Kärkkäinen","doi":"10.1109/CSMR.2006.10","DOIUrl":"https://doi.org/10.1109/CSMR.2006.10","url":null,"abstract":"Software maintenance and reuse require identification of the applied software licenses. The information needs of maintainers and reusers can be supported by reverse engineering tools at different information retrieval levels. The paper presents a reverse engineering approach called ASLA for retrieving license information typically used in OSS. User needs, system architecture, tool features, and tool evaluation are presented. The implemented tool features include support for identifying source file dependencies and licenses in source files. The tool is evaluated against another tool for license information extraction. ASLA supports the same programming languages as GCC. License identification coverage is good and the tool is extendable","PeriodicalId":443362,"journal":{"name":"Conference on Software Maintenance and Reengineering (CSMR'06)","volume":"520 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132352355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Managing traceability data is an important aspect of the software development process. In this paper, we investigate to what extent latent semantic indexing (LSI), an information retrieval technique, can help recovering the information needed for automatically reconstructing traceability during the development process. We experimented with two different link selection strategies and applied LSI in multiple case studies varying in size and context. We discuss the results of a small lab study, a larger case study and a large industrial case study
{"title":"Can LSI help reconstructing requirements traceability in design and test?","authors":"M. Lormans, A. Deursen","doi":"10.1109/CSMR.2006.13","DOIUrl":"https://doi.org/10.1109/CSMR.2006.13","url":null,"abstract":"Managing traceability data is an important aspect of the software development process. In this paper, we investigate to what extent latent semantic indexing (LSI), an information retrieval technique, can help recovering the information needed for automatically reconstructing traceability during the development process. We experimented with two different link selection strategies and applied LSI in multiple case studies varying in size and context. We discuss the results of a small lab study, a larger case study and a large industrial case study","PeriodicalId":443362,"journal":{"name":"Conference on Software Maintenance and Reengineering (CSMR'06)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123848814","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
When reengineering legacy systems, it is crucial to assess if the legacy behavior has been preserved or how it changed due to the reengineering effort. Ideally if a legacy system is covered by tests, running the tests on the new version can identify potential differences or discrepancies. However, writing tests for an unknown and large system is difficult due to the lack of internal knowledge. It is especially difficult to bring the system to an appropriate state. Our solution is based on the acknowledgment that one of the few trustable piece of information available when approaching a legacy system is the running system itself. Our approach reifies the execution traces and uses logic programming to express tests on them. Thereby it eliminates the need to programatically bring the system in a particular state, and handles the test-writer a high-level abstraction mechanism to query the trace. The resulting system, called Testlog, was used on several real-world case studies to validate our claims
{"title":"Object-oriented legacy system trace-based logic testing","authors":"Stéphane Ducasse, Tudor Gîrba, Roel Wuyts","doi":"10.1109/CSMR.2006.37","DOIUrl":"https://doi.org/10.1109/CSMR.2006.37","url":null,"abstract":"When reengineering legacy systems, it is crucial to assess if the legacy behavior has been preserved or how it changed due to the reengineering effort. Ideally if a legacy system is covered by tests, running the tests on the new version can identify potential differences or discrepancies. However, writing tests for an unknown and large system is difficult due to the lack of internal knowledge. It is especially difficult to bring the system to an appropriate state. Our solution is based on the acknowledgment that one of the few trustable piece of information available when approaching a legacy system is the running system itself. Our approach reifies the execution traces and uses logic programming to express tests on them. Thereby it eliminates the need to programatically bring the system in a particular state, and handles the test-writer a high-level abstraction mechanism to query the trace. The resulting system, called Testlog, was used on several real-world case studies to validate our claims","PeriodicalId":443362,"journal":{"name":"Conference on Software Maintenance and Reengineering (CSMR'06)","volume":"30 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123273423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Recently, there is an increasing research interest in mining versioning information, i.e. the analysis of the transactions made on version systems to understand how and when a software system evolves. One particular area of interest is the identification of move operations as these are key indicators for refactorings. Unfortunately, there exists no evaluation which identifies the quality (expressed in precision and recall) of the most commonly used detection technique and its underlying principle of name identity. To overcome this problem, the paper compares the precision and recall values of the name-based technique with two alternative techniques, one based on line matching and one based on identifier matching, by means of two case studies. From the results of these studies we conclude that the name-based technique is very precise, yet misses a significant number of move operations (low recall value). To improve the trade-off it is worthwhile to consider the line-based technique since it detects more matches with a slightly worse precision, or to use the number of overlapping identifiers when combined with an additional filter
{"title":"Detecting move operations in versioning information","authors":"F. V. Rysselberghe, M. Rieger, S. Demeyer","doi":"10.1109/CSMR.2006.23","DOIUrl":"https://doi.org/10.1109/CSMR.2006.23","url":null,"abstract":"Recently, there is an increasing research interest in mining versioning information, i.e. the analysis of the transactions made on version systems to understand how and when a software system evolves. One particular area of interest is the identification of move operations as these are key indicators for refactorings. Unfortunately, there exists no evaluation which identifies the quality (expressed in precision and recall) of the most commonly used detection technique and its underlying principle of name identity. To overcome this problem, the paper compares the precision and recall values of the name-based technique with two alternative techniques, one based on line matching and one based on identifier matching, by means of two case studies. From the results of these studies we conclude that the name-based technique is very precise, yet misses a significant number of move operations (low recall value). To improve the trade-off it is worthwhile to consider the line-based technique since it detects more matches with a slightly worse precision, or to use the number of overlapping identifiers when combined with an additional filter","PeriodicalId":443362,"journal":{"name":"Conference on Software Maintenance and Reengineering (CSMR'06)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128396417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
While many commercial and academic design recovery tools have been proposed over the years, assessing their relevance and comparing them is difficult due to the lack of a well-defined, comprehensive, and common framework. In this paper, we introduce such a common comparative framework. The framework builds upon our own experience and extends existing comparative frameworks. We illustrate the comparative framework on two specific design recovery tools
{"title":"A comparative framework for design recovery tools","authors":"Yann-Gaël Guéhéneuc, K. Mens, Roel Wuyts","doi":"10.1109/CSMR.2006.1","DOIUrl":"https://doi.org/10.1109/CSMR.2006.1","url":null,"abstract":"While many commercial and academic design recovery tools have been proposed over the years, assessing their relevance and comparing them is difficult due to the lack of a well-defined, comprehensive, and common framework. In this paper, we introduce such a common comparative framework. The framework builds upon our own experience and extends existing comparative frameworks. We illustrate the comparative framework on two specific design recovery tools","PeriodicalId":443362,"journal":{"name":"Conference on Software Maintenance and Reengineering (CSMR'06)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114150149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Dynamic analysis has long been a subject of study in the context of (compiler) optimization, program comprehension, test coverage, etc. Ever-since, the scale of the event trace has been an important issue. This scalability issue finds its limits on the computational front, where time and/or space complexity of algorithms become too large to be handled by a computer, but also on the cognitive front, where the results presented to the user become too large to be easily understood. This research focuses on delivering a number of program comprehension solutions that help software engineers to focus on the software system during their initial program exploration and comprehension phases. The key concepts we use in our techniques are "frequency of execution" and runtime "coupling". To validate our techniques we used a number of open-source software systems, as well as an industrial legacy application
{"title":"Scalability solutions for program comprehension through dynamic analysis","authors":"A. Zaidman","doi":"10.1109/CSMR.2006.46","DOIUrl":"https://doi.org/10.1109/CSMR.2006.46","url":null,"abstract":"Dynamic analysis has long been a subject of study in the context of (compiler) optimization, program comprehension, test coverage, etc. Ever-since, the scale of the event trace has been an important issue. This scalability issue finds its limits on the computational front, where time and/or space complexity of algorithms become too large to be handled by a computer, but also on the cognitive front, where the results presented to the user become too large to be easily understood. This research focuses on delivering a number of program comprehension solutions that help software engineers to focus on the software system during their initial program exploration and comprehension phases. The key concepts we use in our techniques are \"frequency of execution\" and runtime \"coupling\". To validate our techniques we used a number of open-source software systems, as well as an industrial legacy application","PeriodicalId":443362,"journal":{"name":"Conference on Software Maintenance and Reengineering (CSMR'06)","volume":"41 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130655312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Measurement based software process improvement needs a non-intrusive approach to determine what and where improvement is needed without knowing anything about the methods and techniques used during project execution. Beside, it is necessary for obtaining successful business management, an accurate process behavior prediction. In order to obtain these results we proposed to use statistical process control (SPC) tailored to the software process point of view. The paper proposes an appropriate SPC-Framework and presents two industrial experiences in order to validate the framework in two different software contexts: recalibration of effort estimation models; monitoring of the primary processes through the supporting ones. These experiences validate the framework and show how it can be successfully used as a decision support tool in software process improvement
{"title":"Non-intrusive monitoring of software quality","authors":"N. Boffoli","doi":"10.1109/CSMR.2006.36","DOIUrl":"https://doi.org/10.1109/CSMR.2006.36","url":null,"abstract":"Measurement based software process improvement needs a non-intrusive approach to determine what and where improvement is needed without knowing anything about the methods and techniques used during project execution. Beside, it is necessary for obtaining successful business management, an accurate process behavior prediction. In order to obtain these results we proposed to use statistical process control (SPC) tailored to the software process point of view. The paper proposes an appropriate SPC-Framework and presents two industrial experiences in order to validate the framework in two different software contexts: recalibration of effort estimation models; monitoring of the primary processes through the supporting ones. These experiences validate the framework and show how it can be successfully used as a decision support tool in software process improvement","PeriodicalId":443362,"journal":{"name":"Conference on Software Maintenance and Reengineering (CSMR'06)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124649126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Software-intensive systems evolve continuously under the pressure of new and changing requirements, generally leading to an increase in overall system complexity. In this respect, to improve quality and decrease complexity, software artifacts need to be restructured and refactored throughout their lifecycle. Since software architecture artifacts represent the highest level of implementation abstraction, and constitute the first step in mapping requirements to design, architecture refactorings can be considered as the first step in the quest of maintaining system quality during evolution. In this paper, we introduce an approach for refactoring software architecture artifacts using model transformations and quality improvement semantic annotations. First, the conceptual architecture view is represented as a UML 2.0 profile with corresponding stereotypes. Second, instantiated architecture models are annotated using elements of the refactoring context, including soft-goals, metrics, and constraints. Finally, the actions that are most suitable for the given refactoring context are applied after being selected from a set of possible refactorings. The approach is applied to a simple example, demonstrating refactoring transformations for improved maintainability, performance, and security
{"title":"A framework for software architecture refactoring using model transformations and semantic annotations","authors":"Igor Ivkovic, K. Kontogiannis","doi":"10.1109/CSMR.2006.3","DOIUrl":"https://doi.org/10.1109/CSMR.2006.3","url":null,"abstract":"Software-intensive systems evolve continuously under the pressure of new and changing requirements, generally leading to an increase in overall system complexity. In this respect, to improve quality and decrease complexity, software artifacts need to be restructured and refactored throughout their lifecycle. Since software architecture artifacts represent the highest level of implementation abstraction, and constitute the first step in mapping requirements to design, architecture refactorings can be considered as the first step in the quest of maintaining system quality during evolution. In this paper, we introduce an approach for refactoring software architecture artifacts using model transformations and quality improvement semantic annotations. First, the conceptual architecture view is represented as a UML 2.0 profile with corresponding stereotypes. Second, instantiated architecture models are annotated using elements of the refactoring context, including soft-goals, metrics, and constraints. Finally, the actions that are most suitable for the given refactoring context are applied after being selected from a set of possible refactorings. The approach is applied to a simple example, demonstrating refactoring transformations for improved maintainability, performance, and security","PeriodicalId":443362,"journal":{"name":"Conference on Software Maintenance and Reengineering (CSMR'06)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124894117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：