中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 互联网软件技术实验室  > 会议论文
题名:
a cut-off approach for bounded verification of parameterized systems
作者: Yang Qiusong ; Li Mingshu
会议文集: Proceedings - International Conference on Software Engineering
会议名称: 32nd ACM/IEEE International Conference on Software Engineering, ICSE 2010
会议日期: May 1, 201
出版日期: 2010
会议地点: Cape Town, South africa
关键词: Computer software ; Parameterization
出版地: United States
ISSN: 2705257
ISBN: 9781610000000
部门归属: (1) Laboratory for Internet Software Technologies, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China; (2) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China
主办者: Association for Computing Machinery (ACM); IEEE Computer Society; Technical Council on Software Engineering (tcse); SIGSOFT; Computer Society - South Africa
英文摘要: The features in multi-threaded programs, such as recursion, dynamic creation and communication, pose a great challenge to formal verification. A widely adopted strategy is to verify tentatively a system with a smaller size, by limiting the depth of recursion or the number of replicated processes, to find errors without ensuring the full correctness. The model checking of parameterized systems, a parametric infinite family of systems, is to decide if a property holds in every size instance. There has been a quest for finding cut-offs for the verification of parameterized systems. The basic idea is to find a cut-off on the number of replicated processes or on the maximum length of paths needed to prove a property, standing a chance of improving verification efficiency substantially if one can come up with small or modest cut-offs. In this paper, a novel approach, called Forward Bounded Reachability Analysis (FBRA), based upon the cut-off on the maximum lengths of paths is proposed for the verification of parameterized systems. Experimental results show that verification efficiency has been significantly improved as a result of the introduction of our new cut-offs. © 2010 ACM.
内容类型: 会议论文
URI标识: http://ir.iscas.ac.cn/handle/311060/8582
Appears in Collections:互联网软件技术实验室 _会议论文

Files in This Item:
File Name/ File Size Content Type Version Access License
p345-yang.pdf(223KB)----限制开放-- 联系获取全文

Recommended Citation:
Yang Qiusong,Li Mingshu. a cut-off approach for bounded verification of parameterized systems[C]. 见:32nd ACM/IEEE International Conference on Software Engineering, ICSE 2010. Cape Town, South africa. May 1, 201.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Yang Qiusong]'s Articles
[Li Mingshu]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Yang Qiusong]‘s Articles
[Li Mingshu]‘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-2017  中国科学院软件研究所 - Feedback
Powered by CSpace