bounded semantics of ctl and sat-based verification

	bounded semantics of ctl and sat-based verification
	Zhang Wenhui
	2009
摘要	Bounded model checking has been proposed as a complementary approach to BDD based symbolic model checking for combating the state explosion problem, esp. for efficient error detection. This has led to a lot of successful work with respect to error detection in the checking of LTI,, ACTL (the universal fragment of CTL) and ACTL* properties by satisfiability testing. The use of bounded model checking for verification (in contrast to error detection) of LTL and ACTL properties has later also been studied. This paper studies the potentials and limitations of bounded model checking for the verification of CTL and CTL* formulas. On the theoretical side, we first provide a framework for discussion of bounded semantics, which serves as the basis for bounded model checking, then extend the bounded semantics of ACTL to a bounded semantics of CTL, and discuss the limitation of developing such a bounded semantics for CTL*. On the practical side, a. deduction of a SAT-based bounded model checking approach for ACTL properties from the bounded semantics of CTL is demonstrated, and a comparison of such an approach with BDD-based model checking is presented based on experimental results.
部门归属	Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080, Peoples R China.
组织者	Pontificia Univ Catolica Rio de Janeiro, Univ York, Inst Mil Engenharia
内容类型	学位论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8204
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Zhang Wenhui. bounded semantics of ctl and sat-based verification[D],2009.