a cut-off approach for bounded verification of parameterized systems

ISCAS OpenIR > 互联网软件技术实验室

	a cut-off approach for bounded verification of parameterized systems
	Yang Qiusong; Li Mingshu
	2010
会议名称	32nd ACM/IEEE International Conference on Software Engineering, ICSE 2010
会议录名称	Proceedings - International Conference on Software Engineering
页码	345-354
会议日期	May 1, 201
会议地点	Cape Town, South africa
出版地	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
摘要	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.
关键词	Computer Software Parameterization
主办者	Association for Computing Machinery (ACM); IEEE Computer Society; Technical Council on Software Engineering (tcse); SIGSOFT; Computer Society - South Africa
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8582
专题	互联网软件技术实验室
推荐引用方式 GB/T 7714	Yang Qiusong,Li Mingshu. a cut-off approach for bounded verification of parameterized systems[C]. United States,2010:345-354.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
p345-yang.pdf（223KB）			开放获取	--	请求全文