Termination analysis with recursive calling graphs
文献类型：期刊论文
| 作者 | Long, T ; Zhang, WH |
| 刊名 | JOURNAL OF NETWORK AND COMPUTER APPLICATIONS
 |
| 出版日期 | 2016 |
| 卷号 | 59页码:109-116 |
| 关键词 | Termination analysis Green software programs Size-change termination principle |
| ISSN号 | 1084-8045 |
| 中文摘要 | As one of the significant aspects for green software systems, termination analysis is related to the optimization of the resource utilization. The approach for size-change termination principle was first proposed by Lee, Jones and Ben-Amram in 2001, which is an effective method for automatic termination analysis. According to its abstracted constructs (size-change graphs), the principle ignores the condition and return values for function call. In this paper, we devise a new construct including the ignoring features to extend the set of programs that are size-change terminating in real life. The main contribution of our paper is twofold: firstly, it supports the analysis of functions in which the returned values are relevant to termination. Secondly, it gains more accuracy for oscillating value change in termination analysis. (C) 2015 Elsevier Ltd. All rights reserved. |
| 英文摘要 | As one of the significant aspects for green software systems, termination analysis is related to the optimization of the resource utilization. The approach for size-change termination principle was first proposed by Lee, Jones and Ben-Amram in 2001, which is an effective method for automatic termination analysis. According to its abstracted constructs (size-change graphs), the principle ignores the condition and return values for function call. In this paper, we devise a new construct including the ignoring features to extend the set of programs that are size-change terminating in real life. The main contribution of our paper is twofold: firstly, it supports the analysis of functions in which the returned values are relevant to termination. Secondly, it gains more accuracy for oscillating value change in termination analysis. (C) 2015 Elsevier Ltd. All rights reserved. |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000367491600012 |
| 公开日期 | 2016-12-13 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/17417]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Long, T,Zhang, WH. Termination analysis with recursive calling graphs[J]. JOURNAL OF NETWORK AND COMPUTER APPLICATIONS,2016,59:109-116. |
| APA | Long, T,&Zhang, WH.(2016).Termination analysis with recursive calling graphs.JOURNAL OF NETWORK AND COMPUTER APPLICATIONS,59,109-116. |
| MLA | Long, T,et al."Termination analysis with recursive calling graphs".JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 59(2016):109-116. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。