2007 IEEE International Conference on Software Maintenance最新文献_第2页

The Effect of Communication Overhead on Software Maintenance Project Staffing: a Search-Based Approach 通信开销对软件维护项目人员配置的影响:一种基于搜索的方法

2007 IEEE International Conference on Software Maintenance Pub Date : 2007-10-22 DOI: 10.1109/ICSM.2007.4362644

M. D. Penta, M. Harman, G. Antoniol, Fahim Qureshi

引用次数: 37

Finding Unusual Code 发现异常代码

2007 IEEE International Conference on Software Maintenance Pub Date : 2007-10-22 DOI: 10.1109/ICSM.2007.4362616

S. Reiss

引用次数: 7

Clone Smells in Software Evolution 软件进化中的克隆气味

2007 IEEE International Conference on Software Maintenance Pub Date : 2007-10-22 DOI: 10.1109/ICSM.2007.4362615

Tibor Bakota, R. Ferenc, T. Gyimóthy

{"title":"Clone Smells in Software Evolution","authors":"Tibor Bakota, R. Ferenc, T. Gyimóthy","doi":"10.1109/ICSM.2007.4362615","DOIUrl":"https://doi.org/10.1109/ICSM.2007.4362615","url":null,"abstract":"Although source code cloning (copy&paste programming) represents a significant threat to the maintainability of a software system, problems usually start to arise only when the system evolves. Most of the related research papers tackle the question of finding code clones in one particular version of the software only, leaving the dynamic behavior of the clones out of consideration. Eliminating these clones in large software systems often seems absolutely hopeless, as there might exist several thousands of them. Alternatively, tracking the evolution of individual clones can be used to identify those occurrences that could really cause problems in the future versions. In this paper we present an approach for mapping clones from one particular version of the software to another one, based on a similarity measure. This mapping is used to define conditions under which clones become suspicious (or \"smelly\") compared to their other occurrences. Accordingly, these conditions introduce the notion of dynamic clone smells. The usefulness of these smells is validated on the Mozilla Firefox internet browser, where the approach was able to find specific bugs that resulted from neglecting earlier copy&paste activities.","PeriodicalId":263470,"journal":{"name":"2007 IEEE International Conference on Software Maintenance","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123434776","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}

引用次数: 105

A model to predict anti-regressive effort in Open Source Software 一个预测开源软件中反回归工作的模型

2007 IEEE International Conference on Software Maintenance Pub Date : 2007-10-22 DOI: 10.1109/ICSM.2007.4362632

A. Capiluppi, J. Fernández-Ramil

引用次数: 11

Tracing Model Elements 跟踪模型元素

2007 IEEE International Conference on Software Maintenance Pub Date : 2007-10-22 DOI: 10.1109/ICSM.2007.4362623

Sven Wenzel, Hermann Hutter, U. Kelter

引用次数: 25

Computation of Static Execute After Relation with Applications to Software Maintenance 静态执行后计算与软件维护应用的关系

2007 IEEE International Conference on Software Maintenance Pub Date : 2007-10-22 DOI: 10.1109/ICSM.2007.4362642

Árpád Beszédes, T. Gergely, J. Jász, Gabriella Tóth, T. Gyimóthy, V. Rajlich

引用次数: 27

An Activity-Based Quality Model for Maintainability 基于活动的可维护性质量模型

2007 IEEE International Conference on Software Maintenance Pub Date : 2007-10-22 DOI: 10.1109/ICSM.2007.4362631

F. Deißenböck, S. Wagner, M. Pizka, S. Teuchert, J. Girard

{"title":"An Activity-Based Quality Model for Maintainability","authors":"F. Deißenböck, S. Wagner, M. Pizka, S. Teuchert, J. Girard","doi":"10.1109/ICSM.2007.4362631","DOIUrl":"https://doi.org/10.1109/ICSM.2007.4362631","url":null,"abstract":"Maintainability is a key quality attribute of successful software systems. However, its management in practice is still problematic. Currently, there is no comprehensive basis for assessing and improving the maintainability of software systems. Quality models have been proposed to solve this problem. Nevertheless, existing approaches do not explicitly take into account the maintenance activities, that largely determine the software maintenance effort. This paper proposes a 2-dimensional model of maintainability that explicitly associates system properties with the activities carried out during maintenance. The separation of activities and properties facilitates the identification of sound quality criteria and allows to reason about their interdependencies. This transforms the quality model into a structured and comprehensive quality knowledge base that is usable in industrial project environments. For example, review guidelines can be generated from it. The model is based on an explicit quality metamodel that supports its systematic construction and fosters preciseness as well as completeness. An industrial case study demonstrates the applicability of the model for the evaluation of the maintainability of Matlab Simulink models that are frequently used in model-based development of embedded systems.","PeriodicalId":263470,"journal":{"name":"2007 IEEE International Conference on Software Maintenance","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131549827","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}

引用次数: 111

A Maintainable Software Architecture for Fast and Modular Bioinformatics Sequence Search 一种可维护的快速模块化生物信息学序列搜索软件体系结构

2007 IEEE International Conference on Software Maintenance Pub Date : 2007-10-22 DOI: 10.1109/ICSM.2007.4362627

J. Archuleta, E. Tilevich, Wu-chun Feng

{"title":"A Maintainable Software Architecture for Fast and Modular Bioinformatics Sequence Search","authors":"J. Archuleta, E. Tilevich, Wu-chun Feng","doi":"10.1109/ICSM.2007.4362627","DOIUrl":"https://doi.org/10.1109/ICSM.2007.4362627","url":null,"abstract":"Bioinformaticists use the Basic Local Alignment Search Tool (BLAST) to characterize an unknown sequence by comparing it against a database of known sequences, thus detecting evolutionary relationships and biological properties. mpiBLAST is a widely-used, high-performance, open-source parallelization of BLAST that runs on a computer cluster delivering super-linear speedups. However, the Achilles heel of mpiBLAST is its lack of modularity, thus adversely affecting maintainability and extensibility. Alleviating this shortcoming requires an architectural refactoring to improve maintenance and extensibility while preserving high performance. Toward that end, this paper evaluates five different software architectures and details how each satisfies our design objectives. In addition, we introduce a novel approach to using mixin layers to enable mixing-and-matching of modules in constructing sequence-search applications for a variety of high-performance computing systems. Our design, which we call \"mixin layers with refined roles\", utilizes mixin layers to separate functionality into complementary modules and the refined roles in each layer improve the inherently modular design by precipitating flexible and structured parallel development, a necessity for an open-source application. We believe that this new software architecture for mpiBLAST-2.0 will benefit both the users and developers of the package and that our evaluation of different software architectures will be of value to other software engineers faced with the challenges of creating maintainable and extensible, high-performance, bioinformatics software.","PeriodicalId":263470,"journal":{"name":"2007 IEEE International Conference on Software Maintenance","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121098939","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}

引用次数: 12

Applying Interface-Contract Mutation in Regression Testing of Component-Based Software 接口契约突变在构件软件回归测试中的应用

2007 IEEE International Conference on Software Maintenance Pub Date : 2007-10-22 DOI: 10.1109/ICSM.2007.4362630

Shan-Shan Hou, Lu Zhang, Tao Xie, Hong Mei, Jiasu Sun

{"title":"Applying Interface-Contract Mutation in Regression Testing of Component-Based Software","authors":"Shan-Shan Hou, Lu Zhang, Tao Xie, Hong Mei, Jiasu Sun","doi":"10.1109/ICSM.2007.4362630","DOIUrl":"https://doi.org/10.1109/ICSM.2007.4362630","url":null,"abstract":"Regression testing, which plays an important role in software maintenance, usually relies on test adequacy criteria to select and prioritize test cases. However, with the wide use and reuse of black-box components, such as reusable class libraries and COTS components, it is challenging to establish test adequacy criteria for testing software systems built on components whose source code is not available. Without source code or detailed documents, the misunderstanding between the system integrators and component providers has become a main factor of causing faults in component-based software. In this paper, we apply mutation on interface contracts, which can describe the rights and obligations between component users and providers, to simulate the faults that may occur in this way of software development. The mutation adequacy score for killing the mutants of interface contracts can serve as a test adequacy criterion. We performed an experimental study on three subject systems to evaluate the proposed approach together with four other existing criteria. The experimental results show that our adequacy criterion is helpful for both selecting good-quality test cases and scheduling test cases in an order of exposing faults quickly in regression testing of component-based software.","PeriodicalId":263470,"journal":{"name":"2007 IEEE International Conference on Software Maintenance","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133390261","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}

引用次数: 25

Matching Control Flow of Program Versions 程序版本匹配控制流程

2007 IEEE International Conference on Software Maintenance Pub Date : 2007-10-22 DOI: 10.1109/ICSM.2007.4362621

V. Nagarajan, Rajiv Gupta, Matias Madou, X. Zhang, B. D. Sutter

{"title":"Matching Control Flow of Program Versions","authors":"V. Nagarajan, Rajiv Gupta, Matias Madou, X. Zhang, B. D. Sutter","doi":"10.1109/ICSM.2007.4362621","DOIUrl":"https://doi.org/10.1109/ICSM.2007.4362621","url":null,"abstract":"In many application areas, including piracy detection, software debugging and maintenance, situations arise in which there is a need for comparing two versions of a program that dynamically behave the same even though they statically appear to be different. Recently dynamic matching [18] was proposed by us which uses execution histories to automatically produce mappings between instructions in the two program versions. The mappings then can be used to understand the correspondence between the two versions by a user involved in software piracy detection or a comparison checker involved in debugging of optimized code. However, if a program's control flow is substantially altered, which usually occurs in obfuscation or even manual transformations, mappings at instruction level are not sufficient to enable a good understanding of the correspondence. In this paper, we present a comprehensive dynamic matching algorithm with the focus on call graph and control flow matching. Our technique works in the presence of aggressive control flow transformations (both interprocedural such as function Mining/outlining and intraprocedural such as control flow flattening) and produces mappings of interprocedural and intraprocedural control flow in addition to mapping between instructions. We evaluated our dynamic matching algorithms by attempting to match original program with versions that were subjected to popular obfuscation and control flow altering transformations. Our experimental results show that the control flow mappings produced are highly accurate and complete, for the programs considered.","PeriodicalId":263470,"journal":{"name":"2007 IEEE International Conference on Software Maintenance","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121240115","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}

引用次数: 34