search space partition and case basis exploration for reducing model     checking complexity

ISCAS OpenIR

	search space partition and case basis exploration for reducing model checking complexity
	Su B; Zhang WH
	2004
会议名称	2nd International Conference on Automated Technology for Verification and Analysis
页码	34-48
会议日期	OCT 31-NOV
会议地点	Taipei, TAIWAN
收录类别	sci ; istp
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS
ISSN	0302-9743
ISBN	3-540-23610-4
部门归属	Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing, Peoples R China. Chinese Acad Sci, Grad Sch, Beijing, Peoples R China.
摘要	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
主办者	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
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/12994
专题	中国科学院软件研究所
推荐引用方式 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.