Institutional Repository
| bounded semantics of ctl and sat-based verification | |
| Zhang Wenhui | |
| 2009 | |
| English Abstract | 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. |
| Department | Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080, Peoples R China. |
| Sponsorship | Pontificia Univ Catolica Rio de Janeiro, Univ York, Inst Mil Engenharia |
| Content Type | 学位论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/8204 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | Zhang Wenhui. bounded semantics of ctl and sat-based verification[D],2009. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment