2009 IEEE International Conference on Software Maintenance最新文献_第8页

Incremental call graph reanalysis for AspectJ software AspectJ软件的增量调用图再分析

2009 IEEE International Conference on Software Maintenance Pub Date : 2009-10-30 DOI: 10.1109/ICSM.2009.5306311

Yu Lin, Sai Zhang, Jianjun Zhao

{"title":"Incremental call graph reanalysis for AspectJ software","authors":"Yu Lin, Sai Zhang, Jianjun Zhao","doi":"10.1109/ICSM.2009.5306311","DOIUrl":"https://doi.org/10.1109/ICSM.2009.5306311","url":null,"abstract":"Program call graph representation can be used to support many tasks in compiler optimization, program comprehension, and software maintenance. During software evolution, the call graph needs to remain fairly precise and be updated quickly in response to software changes. In this paper, we present an approach to incremental update, instead of exhaustive analysis of the initially constructed call graph in AspectJ software. Our approach first decomposes the source code edits between the updated and initial software versions into a set of atomic change representations, which capture the semantic differences. Then, we explore the relationship between atomic changes and call graph to incrementally update the initially constructed graph, instead of rebuilding it from the ground up. We implement the reanalysis approach on top of the ajc AspectJ compiler and perform an empirical study on 24 versions of eight AspectJ benchmarks. The experiment result shows that our approach can reduce a large portion of unnecessary reanalysis cost as program changes occur, and significant savings are observed for the incremental reconstruction of AspectJ call graph in comparison with an exhaustive analysis, with no loss in precision.","PeriodicalId":247441,"journal":{"name":"2009 IEEE International Conference on Software Maintenance","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124310711","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}

引用次数: 7

Criteria for the evaluation of implemented architectures 评估已实现架构的标准

2009 IEEE International Conference on Software Maintenance Pub Date : 2009-10-30 DOI: 10.1109/ICSM.2009.5306330

Eric Bouwers, Joost Visser, A. Deursen

引用次数: 16

Detecting virus mutations via dynamic matching 通过动态匹配检测病毒突变

2009 IEEE International Conference on Software Maintenance Pub Date : 2009-10-30 DOI: 10.1109/ICSM.2009.5306329

Min Feng, Rajiv Gupta

引用次数: 20

Searching and skimming: An exploratory study 搜索和略读:一项探索性研究

2009 IEEE International Conference on Software Maintenance Pub Date : 2009-10-30 DOI: 10.1109/ICSM.2009.5306335

J. Starke, Chris Luce, Jonathan Sillito

引用次数: 78

Maintenance and agile development: Challenges, opportunities and future directions 维护与敏捷开发:挑战、机遇和未来方向

2009 IEEE International Conference on Software Maintenance Pub Date : 2009-10-30 DOI: 10.1109/ICSM.2009.5306278

G. Hanssen, A. Yamashita, R. Conradi, L. Moonen

引用次数: 25

Object aware execution trace exploration 对象感知的执行跟踪探索

2009 IEEE International Conference on Software Maintenance Pub Date : 2009-09-20 DOI: 10.1109/ICSM.2009.5306320

Stefan Voigt, J. Bohnet, J. Döllner

引用次数: 10

A combinatorial approach to building navigation graphs for dynamic web applications 为动态web应用程序构建导航图的组合方法

2009 IEEE International Conference on Software Maintenance Pub Date : 2009-09-20 DOI: 10.1109/ICSM.2009.5306321

Wenhua Wang, Yu Lei, S. Sampath, R. Kacker, D. R. Kuhn, James Lawrence

{"title":"A combinatorial approach to building navigation graphs for dynamic web applications","authors":"Wenhua Wang, Yu Lei, S. Sampath, R. Kacker, D. R. Kuhn, James Lawrence","doi":"10.1109/ICSM.2009.5306321","DOIUrl":"https://doi.org/10.1109/ICSM.2009.5306321","url":null,"abstract":"Modeling the navigation structure of a dynamic web application is a challenging task because of the presence of dynamic pages. In particular, there are two problems to be dealt with: (1) the page explosion problem, i.e., the number of dynamic pages may be huge or even infinite; and (2) the request generation problem, i.e., many dynamic pages may not be reached unless appropriate user requests are supplied. As a user request typically consists of multiple parameter values, the request generation problem can be further divided into two problems: (1) How to select appropriate values for individual parameters? (2) How to effectively combine individual parameter values to generate requests? This paper presents a combinatorial approach to building a navigation graph. The novelty of our approach is two-fold. First, we use an abstraction scheme to control the page explosion problem. In this scheme, pages that are likely to have the same navigation behavior are grouped together, and are represented as a single node in a navigation graph. Grouping pages reduces and bounds the size of a navigation graph for practical applications. Second, assuming that values of individual parameters are supplied by using other techniques or generated manually by the user, we combine parameter values in a way that achieves a well-defined combinatorial coverage called pairwise coverage. Using pairwise coverage can significantly reduce the number of requests that have to be submitted while still achieving effective coverage of the navigation structure. We report a prototype tool called Tansuo, and apply the tool to five open source web applications. Our empirical results indicate that Tansuo can efficiently generate web navigation graphs for these applications.","PeriodicalId":247441,"journal":{"name":"2009 IEEE International Conference on Software Maintenance","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126059209","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}

引用次数: 47

Comparative analysis of evolving software systems using the Gini coefficient 用基尼系数对演化中的软件系统进行比较分析

2009 IEEE International Conference on Software Maintenance Pub Date : 2009-09-01 DOI: 10.1109/ICSM.2009.5306322

Rajesh Vasa, M. Lumpe, P. Branch, Oscar Nierstrasz

{"title":"Comparative analysis of evolving software systems using the Gini coefficient","authors":"Rajesh Vasa, M. Lumpe, P. Branch, Oscar Nierstrasz","doi":"10.1109/ICSM.2009.5306322","DOIUrl":"https://doi.org/10.1109/ICSM.2009.5306322","url":null,"abstract":"Software metrics offer us the promise of distilling useful information from vast amounts of software in order to track development progress, to gain insights into the nature of the software, and to identify potential problems. Unfortunately, however, many software metrics exhibit highly skewed, non-Gaussian distributions. As a consequence, usual ways of interpreting these metrics — for example, in terms of “average” values — can be highly misleading. Many metrics, it turns out, are distributed like wealth — with high concentrations of values in selected locations. We propose to analyze software metrics using the Gini coefficient, a higherorder statistic widely used in economics to study the distribution of wealth. Our approach allows us not only to observe changes in software systems efficiently, but also to assess project risks and monitor the development process itself. We apply the Gini coefficient to numerous metrics over a range of software projects, and we show that many metrics not only display remarkably high Gini values, but that these values are remarkably consistent as a project evolves over time.","PeriodicalId":247441,"journal":{"name":"2009 IEEE International Conference on Software Maintenance","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134364761","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}

引用次数: 94

Expert recommendation with usage expertise 具有使用经验的专家建议

2009 IEEE International Conference on Software Maintenance Pub Date : 2009-09-01 DOI: 10.1109/ICSM.2009.5306386

David Ma, David Schuler, Thomas Zimmermann, Jonathan Sillito

引用次数: 61

Regression model checking 回归模型检验

2009 IEEE International Conference on Software Maintenance Pub Date : 2009-09-01 DOI: 10.1109/ICSM.2009.5306334

Guowei Yang, Matthew B. Dwyer, G. Rothermel

引用次数: 73