Institutional Repository
| search space partition and case basis exploration for reducing model checking complexity | |
| Su B; Zhang WH | |
| 2004 | |
| Conference Name | 2nd International Conference on Automated Technology for Verification and Analysis |
| Pages | 34-48 |
| Conference Date | OCT 31-NOV |
| Conference Place | Taipei, TAIWAN |
| Indexed Type | sci ; istp |
| Publish Place | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| Publisher | AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS |
| ISSN | 0302-9743 |
| ISBN | 3-540-23610-4 |
| Department | Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing, Peoples R China. Chinese Acad Sci, Grad Sch, Beijing, Peoples R China. |
| English Abstract | The main disadvantage of model checking is the state explosion problem that can occur if the system being verified has many asynchronous components. Many approaches have been proposed to deal with this challenge. This paper extends an approach |
| Sponsorship | Natl Sci Council, Minist Educ, Acad Sinica, Inst Informat Sci, Natl Taiwan Univ, Ctr Informat & Elect Technol, Natl Taiwan Univ, SOC Ctr, Natl Taiwan Univ, Grad Inst Elect Engn, Synopsys Inc |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/12994 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Su B,Zhang WH. search space partition and case basis exploration for reducing model checking complexity[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS,2004:34-48. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| search space partiti（157KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment