Incremental call graph reanalysis for AspectJ software

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":null,"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.0000,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Software Maintenance","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSM.2009.5306311","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

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.

查看原文本刊更多论文

AspectJ软件的增量调用图再分析

程序调用图表示可以用来支持编译器优化、程序理解和软件维护中的许多任务。在软件演进过程中，调用图需要保持相当精确，并根据软件变更快速更新。在本文中，我们提出了一种增量更新的方法，而不是对AspectJ软件中最初构造的调用图进行详尽的分析。我们的方法首先将更新软件版本和初始软件版本之间的源代码编辑分解为一组原子更改表示，这些表示捕获语义差异。然后，我们探索原子变化和调用图之间的关系，以增量方式更新最初构造的图，而不是从头开始重建它。我们在ajc AspectJ编译器之上实现了重新分析方法，并对8个AspectJ基准测试的24个版本进行了实证研究。实验结果表明，当程序发生变化时，我们的方法可以减少大部分不必要的重新分析成本，并且与详尽的分析相比，可以显著节省AspectJ调用图的增量重建，并且精度没有损失。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2009 IEEE International Conference on Software Maintenance

自引率

0.00%

发文量