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

Indexing Noncrashing Failures: A Dynamic Program Slicing-Based Approach 索引非崩溃故障:一种基于动态程序切片的方法

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

Chao Liu, X. Zhang, Yu Zhang, Jiawei Han, B. Bhargava

{"title":"Indexing Noncrashing Failures: A Dynamic Program Slicing-Based Approach","authors":"Chao Liu, X. Zhang, Yu Zhang, Jiawei Han, B. Bhargava","doi":"10.1109/ICSM.2007.4362658","DOIUrl":"https://doi.org/10.1109/ICSM.2007.4362658","url":null,"abstract":"Recent software systems usually feature an automated failure reporting component, with which a huge number of failures are collected from software end-users. With a proper support of failure indexing, which identifies failures due to the same fault, the collected failure data can help developers prioritize failure diagnosis, among other utilities of the failure data. Since crashing failures can be effectively indexed by program crashing venues, current practice has seen great success in prioritizing crashing failures. A recent study of bug characteristics indicates that as excellent memory checking tools are widely adopted, semantic bugs and the resulting noncrashing failures have become dominant. Unfortunately, the problem of how to index non-crashing failures has not been seriously studied before. In previous study, two techniques have been proposed to index noncrashing failures, and they are T-Proximity and R-Proximity. However, as T-Proximity indexes failures by the profile of the entire execution, it is generally not effective because most information in the profile is fault-irrelevant. On the other hand, although R-Proximity is more effective than T-Proximity, it relies on a sufficient number of correct executions that may not be available in practice. In this paper, we propose a dynamic slicing-based approach, which does not require any correct executions, and is comparably effective as R-Proximity. A detailed case study with gzip is reported, which clearly strates the advantages of the proposed approach.","PeriodicalId":263470,"journal":{"name":"2007 IEEE International Conference on Software Maintenance","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115354276","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}

引用次数: 13

How Programmers can Turn Comments into Waypoints for Code Navigation 程序员如何将注释变成代码导航的路标

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

M. Storey, Li-Te Cheng, J. Singer, M. J. Muller, D. Myers, Jody Ryall

引用次数: 36

Automatic Test Generation From GUI Applications For Testing Web Services 从GUI应用程序自动生成测试，用于测试Web服务

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

Kevin M. Conroy, M. Grechanik, M. Hellige, E. Liongosari, Qing Xie

引用次数: 29

On the prediction of the evolution of libre software projects 关于自由软件项目发展的预测

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

I. Herraiz, Jesus M. Gonzalez-Barahona, G. Robles, D. Germán

{"title":"On the prediction of the evolution of libre software projects","authors":"I. Herraiz, Jesus M. Gonzalez-Barahona, G. Robles, D. Germán","doi":"10.1109/ICSM.2007.4362653","DOIUrl":"https://doi.org/10.1109/ICSM.2007.4362653","url":null,"abstract":"Libre (free / open source) software development is a complex phenomenon. Many actors (core developers, casual contributors, bug reporters, patch submitters, users, etc.), in many cases volunteers, interact in complex patterns without the constrains of formal hierarchical structures or organizational ties. Understanding this complex behavior with enough detail to build explanatory models suitable for prediction is an open challenge, and few results have been published to date in this area. Therefore statistical, non-explanatory models (such as the traditional regression model) have a clear role, and have been used in some evolution studies. Our proposal goes in this direction, but using a model that we have found more useful: time series analysis. Data available from the source code management repository is used to compute the size of the software over its past life, using this information to estimate the future evolution of the project. In this paper we present this methodology and apply it to three large projects, showing how in these cases predictions are more accurate than regression models, and precise enough to estimate with little error their near future evolutions.","PeriodicalId":263470,"journal":{"name":"2007 IEEE International Conference on Software Maintenance","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132051088","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}

引用次数: 36