Pub Date : 2003-03-26DOI: 10.1109/CSMR.2003.1192412
Diego Bovenzi, G. Canfora, A. R. Fasolino
In the Internet era, a challenging issue consists of defining viable solutions for integrating existing enterprise systems and making them accessible from heterogeneous client devices by exploiting the common infrastructure offered by the Web. This paper presents an integration approach that exploits black-box techniques for capturing the dynamic and static models of a legacy system user interface, and reproducing them on client devices with the support of a software wrapper. The wrapper is designed to satisfy service stability, data integration, and application integration requirements, and exploits State Chart Diagrams and open standard technologies, such as XML and XSL. In the paper, a methodology for designing the wrapper is proposed, and a toolkit that supports the application of the methodology is presented. An example of using the methodology for wrapping an existing system and exporting it to a Web browser and a WAP mobile phone is, finally, discussed.
{"title":"Enabling legacy system accessibility by Web heterogeneous clients","authors":"Diego Bovenzi, G. Canfora, A. R. Fasolino","doi":"10.1109/CSMR.2003.1192412","DOIUrl":"https://doi.org/10.1109/CSMR.2003.1192412","url":null,"abstract":"In the Internet era, a challenging issue consists of defining viable solutions for integrating existing enterprise systems and making them accessible from heterogeneous client devices by exploiting the common infrastructure offered by the Web. This paper presents an integration approach that exploits black-box techniques for capturing the dynamic and static models of a legacy system user interface, and reproducing them on client devices with the support of a software wrapper. The wrapper is designed to satisfy service stability, data integration, and application integration requirements, and exploits State Chart Diagrams and open standard technologies, such as XML and XSL. In the paper, a methodology for designing the wrapper is proposed, and a toolkit that supports the application of the methodology is presented. An example of using the methodology for wrapping an existing system and exporting it to a Web browser and a WAP mobile phone is, finally, discussed.","PeriodicalId":236632,"journal":{"name":"Seventh European Conference onSoftware Maintenance and Reengineering, 2003. Proceedings.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115590723","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}
Pub Date : 2003-03-26DOI: 10.1109/CSMR.2003.1192439
G. Antoniol, M. D. Penta, M. Neteler
There may be several reasons to reduce a software system to its bare bone removing the extra fat introduced during development or evolution. Porting the software system on embedded devices or palmtops are just two examples. This paper presents an approach to re-factoring libraries with the aim of reducing the memory requirements of executables. The approach is organized in two steps. The first step defines an initial solution based on clustering methods, while the subsequent phase refines the initial solution via genetic algorithms. In particular, a novel genetic algorithm approach, considering the initial clusters as the starting population, adopting a knowledge-based mutation function and a multiobjective fitness function, is proposed. The approach has been applied to several medium and large-size open source software systems such as GRASS, KDE-QT Samba and MySQL, allowing one to effectively produce smaller loosely coupled libraries, and to reduce the memory requirement for each application.
{"title":"Moving to smaller libraries via clustering and genetic algorithms","authors":"G. Antoniol, M. D. Penta, M. Neteler","doi":"10.1109/CSMR.2003.1192439","DOIUrl":"https://doi.org/10.1109/CSMR.2003.1192439","url":null,"abstract":"There may be several reasons to reduce a software system to its bare bone removing the extra fat introduced during development or evolution. Porting the software system on embedded devices or palmtops are just two examples. This paper presents an approach to re-factoring libraries with the aim of reducing the memory requirements of executables. The approach is organized in two steps. The first step defines an initial solution based on clustering methods, while the subsequent phase refines the initial solution via genetic algorithms. In particular, a novel genetic algorithm approach, considering the initial clusters as the starting population, adopting a knowledge-based mutation function and a multiobjective fitness function, is proposed. The approach has been applied to several medium and large-size open source software systems such as GRASS, KDE-QT Samba and MySQL, allowing one to effectively produce smaller loosely coupled libraries, and to reduce the memory requirement for each application.","PeriodicalId":236632,"journal":{"name":"Seventh European Conference onSoftware Maintenance and Reengineering, 2003. Proceedings.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127053606","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}
Pub Date : 2003-03-26DOI: 10.1109/CSMR.2003.1192446
G. Villavicencio
In (Oliveira and Villavicencio, 2001) we have applied [P]=([P/sub 1/], ..., [P/sub n/]) as a conjuncture to reverse calculate the formal specifications of a program P through the application of static slicing on output variables. This conjecture defines a calculation pattern: the formal specification for each slice is calculated and the whole program specification is obtained by combining the slice specifications by the split (<...>) combinator. However, the conjecture fails when we use conditioned slices as a complexity-reduction mechanism. Thus, it is necessary to define a new calculation pattern for the conditioned slices. Since we need to reconstruct the static slice on an output variable combining the conditioned slices on such variable, "transversal calculus" is required instead of a "linear calculation" as in (Oliveira and Villavicencio, 2001). The definition of the calculus patterns is important when facing the construction of the automatic support for the present approach because they contribute to the systematization of the calculus process.
在(Oliveira and Villavicencio, 2001)中，我们应用[P]=([P/sub 1/]，…， [P/sub n/]])作为节点，通过对输出变量应用静态切片，对程序P的形式规范进行反向计算。这个猜想定义了一种计算模式:计算每个片的形式规范，并通过split()组合子组合片规范获得整个程序规范。然而，当我们使用条件切片作为复杂性降低机制时，这个猜想就失效了。因此，有必要为条件切片定义一个新的计算模式。由于我们需要结合输出变量上的条件切片重建输出变量上的静态切片，因此需要“横向演算”而不是像(Oliveira和Villavicencio, 2001)中那样的“线性计算”。当面对当前方法的自动支持时，演算模式的定义是重要的，因为它们有助于演算过程的系统化。
{"title":"Formal program reversing by conditioned slicing","authors":"G. Villavicencio","doi":"10.1109/CSMR.2003.1192446","DOIUrl":"https://doi.org/10.1109/CSMR.2003.1192446","url":null,"abstract":"In (Oliveira and Villavicencio, 2001) we have applied [P]=([P/sub 1/], ..., [P/sub n/]) as a conjuncture to reverse calculate the formal specifications of a program P through the application of static slicing on output variables. This conjecture defines a calculation pattern: the formal specification for each slice is calculated and the whole program specification is obtained by combining the slice specifications by the split (<...>) combinator. However, the conjecture fails when we use conditioned slices as a complexity-reduction mechanism. Thus, it is necessary to define a new calculation pattern for the conditioned slices. Since we need to reconstruct the static slice on an output variable combining the conditioned slices on such variable, \"transversal calculus\" is required instead of a \"linear calculation\" as in (Oliveira and Villavicencio, 2001). The definition of the calculus patterns is important when facing the construction of the automatic support for the present approach because they contribute to the systematization of the calculus process.","PeriodicalId":236632,"journal":{"name":"Seventh European Conference onSoftware Maintenance and Reengineering, 2003. Proceedings.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128350447","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}
Pub Date : 2003-03-26DOI: 10.1109/CSMR.2003.1192443
E. Merlo, G. Antoniol, Pierre-Luc Brunelle
In the context of software quality assessment, this paper proposes original flow analyses which propagate numerical estimates of blocking risks along an inter-procedural control flow graph (CFG) and which combine these estimates along the different CFG paths using fuzzy logic operations. Two specialized analyses can be further defined in terms of definite and possible flow analysis. The definite analysis computes the minimum blocking risk levels that statements may encounter on every path, while the possible analysis computes the highest blocking risk levels encountered by statements on at least one path. This paper presents original flow equations to compute the definite and possible blocking risk levels for statements in source code. The described fix-point algorithm presents a linear execution time and memory complexity and it is also fast in practice. The experimental context used to validate the presented approach is described and results are reported and discussed for eight publicly available systems written in C whose total size is about 300 KLOC Results show that the analyses can be used to compute, identify, and compare definite and possible blocking risks in software systems. Furthermore, programs which are known to be synchronized like "samba" show a relatively high level of blocking risks. On the other hand, the approach allows to identify even low levels of blocking risks as those presented by programs like "gawk".
{"title":"Fast flow analysis to compute fuzzy estimates of risk levels","authors":"E. Merlo, G. Antoniol, Pierre-Luc Brunelle","doi":"10.1109/CSMR.2003.1192443","DOIUrl":"https://doi.org/10.1109/CSMR.2003.1192443","url":null,"abstract":"In the context of software quality assessment, this paper proposes original flow analyses which propagate numerical estimates of blocking risks along an inter-procedural control flow graph (CFG) and which combine these estimates along the different CFG paths using fuzzy logic operations. Two specialized analyses can be further defined in terms of definite and possible flow analysis. The definite analysis computes the minimum blocking risk levels that statements may encounter on every path, while the possible analysis computes the highest blocking risk levels encountered by statements on at least one path. This paper presents original flow equations to compute the definite and possible blocking risk levels for statements in source code. The described fix-point algorithm presents a linear execution time and memory complexity and it is also fast in practice. The experimental context used to validate the presented approach is described and results are reported and discussed for eight publicly available systems written in C whose total size is about 300 KLOC Results show that the analyses can be used to compute, identify, and compare definite and possible blocking risks in software systems. Furthermore, programs which are known to be synchronized like \"samba\" show a relatively high level of blocking risks. On the other hand, the approach allows to identify even low levels of blocking risks as those presented by programs like \"gawk\".","PeriodicalId":236632,"journal":{"name":"Seventh European Conference onSoftware Maintenance and Reengineering, 2003. Proceedings.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114980639","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}
Pub Date : 2003-03-26DOI: 10.1109/CSMR.2003.1192434
T. Gschwind, Johann Oberleitner
In this paper we present a new instrumentation approach to reverse engineer a given software application. Our approach is based on aspect-oriented programming and provides support for dynamic feature analysis. The advantage of bur approach compared to other existing approaches is that we allow the engineer to obtain deeper insights into the program executions and to combine these insights with existing analysis techniques. As we show in this paper this significantly reduces the time necessary to obtain viable traces of a program's execution.
{"title":"Improving dynamic data analysis with aspect-oriented programming","authors":"T. Gschwind, Johann Oberleitner","doi":"10.1109/CSMR.2003.1192434","DOIUrl":"https://doi.org/10.1109/CSMR.2003.1192434","url":null,"abstract":"In this paper we present a new instrumentation approach to reverse engineer a given software application. Our approach is based on aspect-oriented programming and provides support for dynamic feature analysis. The advantage of bur approach compared to other existing approaches is that we allow the engineer to obtain deeper insights into the program executions and to combine these insights with existing analysis techniques. As we show in this paper this significantly reduces the time necessary to obtain viable traces of a program's execution.","PeriodicalId":236632,"journal":{"name":"Seventh European Conference onSoftware Maintenance and Reengineering, 2003. Proceedings.","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133928152","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}
Pub Date : 2003-03-26DOI: 10.1109/CSMR.2003.1192426
L. Tahvildari, K. Kontogiannis
During the evolution of object-oriented legacy systems, improving the design quality is. most often a highly demanded objective. For such systems which have a large number of classes and are subject to frequent modifications, detection and correction of design defects is a complex task. The use of automatic detection and correction tools can be helpful for this task. Various research approaches have proposed transformations that improve the quality of an object-oriented systems while preserving its behavior This paper proposes a framework where a catalogue of object-oriented metrics can be used-as indicators for automatically detecting situations where a particular transformation can be applied to improve the quality of an object-oriented legacy system. The correction process is based on analyzing the impact of various meta-pattern transformations on these object-oriented metrics.
{"title":"A metric-based approach to enhance design quality through meta-pattern transformations","authors":"L. Tahvildari, K. Kontogiannis","doi":"10.1109/CSMR.2003.1192426","DOIUrl":"https://doi.org/10.1109/CSMR.2003.1192426","url":null,"abstract":"During the evolution of object-oriented legacy systems, improving the design quality is. most often a highly demanded objective. For such systems which have a large number of classes and are subject to frequent modifications, detection and correction of design defects is a complex task. The use of automatic detection and correction tools can be helpful for this task. Various research approaches have proposed transformations that improve the quality of an object-oriented systems while preserving its behavior This paper proposes a framework where a catalogue of object-oriented metrics can be used-as indicators for automatically detecting situations where a particular transformation can be applied to improve the quality of an object-oriented legacy system. The correction process is based on analyzing the impact of various meta-pattern transformations on these object-oriented metrics.","PeriodicalId":236632,"journal":{"name":"Seventh European Conference onSoftware Maintenance and Reengineering, 2003. Proceedings.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130140798","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}
Pub Date : 2003-03-26DOI: 10.1109/CSMR.2003.1192442
M. S. Lund, F. Braber, K. Stølen
Security assessments are cosily and lime consuming and cannot be carried out from scratch each lime a system is updated or modified This motivates the need for specific methodology addressing the maintenance Of assessment results, in particular, and a component-oriented approach to security assessment in general This paper presents such a methodology in the selling of model-based security assessment as developed by the EU-project CORAS. The main focus is on the maintenance part.
{"title":"Maintaining results from security assessments","authors":"M. S. Lund, F. Braber, K. Stølen","doi":"10.1109/CSMR.2003.1192442","DOIUrl":"https://doi.org/10.1109/CSMR.2003.1192442","url":null,"abstract":"Security assessments are cosily and lime consuming and cannot be carried out from scratch each lime a system is updated or modified This motivates the need for specific methodology addressing the maintenance Of assessment results, in particular, and a component-oriented approach to security assessment in general This paper presents such a methodology in the selling of model-based security assessment as developed by the EU-project CORAS. The main focus is on the maintenance part.","PeriodicalId":236632,"journal":{"name":"Seventh European Conference onSoftware Maintenance and Reengineering, 2003. Proceedings.","volume":"15 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130755667","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}
Pub Date : 2003-03-26DOI: 10.1109/CSMR.2003.1192441
M. Kajko-Mattsson
Software support (upfront maintenance) processes are one of the most diverse and complex to define. So far, they have not achieved enough attention. Most research effort has been put into the development and maintenance processes and the improvement of these processes. However, very little research has been done within their supporting processes - the processes that extensively mediate or eliminate the need for changes in software systems. We report on the problems experienced within 37 support organisations in Sweden. Our results show a great variety of problems. The dominating ones are: complexity of applications, customer knowledge, and complexity of support organisations.
{"title":"Problems within support (upfront maintenance)","authors":"M. Kajko-Mattsson","doi":"10.1109/CSMR.2003.1192441","DOIUrl":"https://doi.org/10.1109/CSMR.2003.1192441","url":null,"abstract":"Software support (upfront maintenance) processes are one of the most diverse and complex to define. So far, they have not achieved enough attention. Most research effort has been put into the development and maintenance processes and the improvement of these processes. However, very little research has been done within their supporting processes - the processes that extensively mediate or eliminate the need for changes in software systems. We report on the problems experienced within 37 support organisations in Sweden. Our results show a great variety of problems. The dominating ones are: complexity of applications, customer knowledge, and complexity of support organisations.","PeriodicalId":236632,"journal":{"name":"Seventh European Conference onSoftware Maintenance and Reengineering, 2003. Proceedings.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121484374","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}
Pub Date : 2003-03-26DOI: 10.1109/CSMR.2003.1192440
A. Capiluppi, P. Lago, M. Morisio
Most empirical studies about Open Source (OS) projects or products are vertical and usually deal with the flagship, successful projects. There is a substantial lack of horizontal studies to shed light on the whole population of projects, including failures. This paper presents a horizontal study aimed at characterizing OS projects. We analyze a sample of around 400 projects from a popular OS project repository. Each project is characterized by a number of attributes. We analyze these attributes statically and over time. The main results show that few projects are capable of attracting a meaningful community of developers. The majority of projects is made by few (in many cases one) person with a very slow pace of evolution.
{"title":"Characteristics of open source projects","authors":"A. Capiluppi, P. Lago, M. Morisio","doi":"10.1109/CSMR.2003.1192440","DOIUrl":"https://doi.org/10.1109/CSMR.2003.1192440","url":null,"abstract":"Most empirical studies about Open Source (OS) projects or products are vertical and usually deal with the flagship, successful projects. There is a substantial lack of horizontal studies to shed light on the whole population of projects, including failures. This paper presents a horizontal study aimed at characterizing OS projects. We analyze a sample of around 400 projects from a popular OS project repository. Each project is characterized by a number of attributes. We analyze these attributes statically and over time. The main results show that few projects are capable of attracting a meaningful community of developers. The majority of projects is made by few (in many cases one) person with a very slow pace of evolution.","PeriodicalId":236632,"journal":{"name":"Seventh European Conference onSoftware Maintenance and Reengineering, 2003. Proceedings.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121593112","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}
Pub Date : 2003-03-26DOI: 10.1109/CSMR.2003.1192414
H. Kienle, S. Sim
The purpose of this paper is to propose a benchmark for comparing fact extractors for Web sites and to invite interested researchers and practitioners to participate in its development. Fact extraction is a fundamental and difficult problem in both traditional software reverse engineering and Web site reverse engineering. In both domains, there are often irregularities in the input that violate an extractor's unstated assumptions. Consequently, it is difficult to predict how an extractor will perform in a given input. To remedy this problem, we created a benchmark for comparing fact extractors for the C++ programming language. We found that this benchmark improved our understanding of fact extraction, the tools produced, and the maturity of the community. The same approach, we believe, will be beneficial for Web site extractors and we propose WebETS (Web site Extractor Test Suite.) In this paper we give some starting points for the design of WebETS and ask others to join in the effort.
{"title":"Towards a benchmark for Web site extractors: a call for community participation","authors":"H. Kienle, S. Sim","doi":"10.1109/CSMR.2003.1192414","DOIUrl":"https://doi.org/10.1109/CSMR.2003.1192414","url":null,"abstract":"The purpose of this paper is to propose a benchmark for comparing fact extractors for Web sites and to invite interested researchers and practitioners to participate in its development. Fact extraction is a fundamental and difficult problem in both traditional software reverse engineering and Web site reverse engineering. In both domains, there are often irregularities in the input that violate an extractor's unstated assumptions. Consequently, it is difficult to predict how an extractor will perform in a given input. To remedy this problem, we created a benchmark for comparing fact extractors for the C++ programming language. We found that this benchmark improved our understanding of fact extraction, the tools produced, and the maturity of the community. The same approach, we believe, will be beneficial for Web site extractors and we propose WebETS (Web site Extractor Test Suite.) In this paper we give some starting points for the design of WebETS and ask others to join in the effort.","PeriodicalId":236632,"journal":{"name":"Seventh European Conference onSoftware Maintenance and Reengineering, 2003. Proceedings.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115635325","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
扫码关注我们
求助内容：
应助结果提醒方式：