中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
Termination analysis with recursive calling graphs
Author: Long, T ; Zhang, WH
Keyword: Termination analysis ; Green software programs ; Size-change termination principle
Source: JOURNAL OF NETWORK AND COMPUTER APPLICATIONS
Issued Date: 2016
Volume: 59, Pages:109-116
Indexed Type: SCI
Department: China Univ Geosci, Sch Informat Engn, Beijing, Peoples R China. Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China.
Abstract: 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.
English Abstract: 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.
Language: 英语
WOS ID: WOS:000367491600012
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/17417
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
1-s2.0-S1084804515001605-main.pdf(426KB)----限制开放 联系获取全文

Recommended Citation:
Long, T,Zhang, WH. Termination analysis with recursive calling graphs[J]. JOURNAL OF NETWORK AND COMPUTER APPLICATIONS,2016-01-01,59:109-116.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Long, T]'s Articles
[Zhang, WH]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Long, T]‘s Articles
[Zhang, WH]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace