Institutional Repository
| Termination analysis with recursive calling graphs | |
| Long, T; Zhang, WH | |
| 2016 | |
| 发表期刊 | JOURNAL OF NETWORK AND COMPUTER APPLICATIONS
![]() |
| ISSN | 1084-8045 |
| 卷号 | 59页码:109-116 |
| 摘要 | 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 |
| 关键词 | Termination Analysis Green Software Programs Size-change Termination Principle |
| 部门归属 | China Univ Geosci, Sch Informat Engn, Beijing, Peoples R China. Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China. |
| 语种 | 英语 |
| WOS记录号 | WOS:000367491600012 |
| 引用统计 | |
| 内容类型 | 期刊论文 |
| URI标识 | 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. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| 1-s2.0-S108480451500(426KB) | 开放获取 | 使用许可 | 请求全文 | |||
| 个性服务 |
| 推荐该条目 |
| 保存到收藏夹 |
| 查看访问统计 |
| 导出为Endnote文件 |
| 谷歌学术 |
| 谷歌学术中相似的文章 |
| [Long, T]的文章 |
| [Zhang, WH]的文章 |
| 百度学术 |
| 百度学术中相似的文章 |
| [Long, T]的文章 |
| [Zhang, WH]的文章 |
| 必应学术 |
| 必应学术中相似的文章 |
| [Long, T]的文章 |
| [Zhang, WH]的文章 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论