Institutional Repository
| a cut-off approach for bounded verification of parameterized systems | |
| Yang Qiusong; Li Mingshu | |
| 2010 | |
| Conference Name | 32nd ACM/IEEE International Conference on Software Engineering, ICSE 2010 |
| Source | Proceedings - International Conference on Software Engineering |
| Pages | 345-354 |
| Conference Date | May 1, 201 |
| Conference Place | Cape Town, South africa |
| Publish Place | United States |
| ISSN | 2705257 |
| ISBN | 9781610000000 |
| Department | (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 |
| English Abstract | 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. |
| Keyword | Computer Software Parameterization |
| Sponsorship | Association for Computing Machinery (ACM); IEEE Computer Society; Technical Council on Software Engineering (tcse); SIGSOFT; Computer Society - South Africa |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/8582 |
| Collection | 互联网软件技术实验室 |
| Recommended Citation GB/T 7714 | Yang Qiusong,Li Mingshu. a cut-off approach for bounded verification of parameterized systems[C]. United States,2010:345-354. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| p345-yang.pdf（223KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment