Journal of Computer Science and Technology
, Volume 24, Issue 1, pp 96109
First online:
Improved Bounded Model Checking for the Universal Fragment of CTL
 Liang XuAffiliated withState Key Laboratory of Computer Science, Institute of Software, Chinese Academy of SciencesGraduate University of Chinese Academy of Sciences Email author
 , Wei ChenAffiliated withState Key Laboratory of Computer Science, Institute of Software, Chinese Academy of SciencesGraduate University of Chinese Academy of Sciences
 , YanYan XuAffiliated withState Key Laboratory of Computer Science, Institute of Software, Chinese Academy of SciencesGraduate University of Chinese Academy of Sciences
 , WenHui ZhangAffiliated withState Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
SATbased bounded model checking (BMC) has been introduced as a complementary technique to BDDbased symbolic model checking in recent years, and a lot of successful work has been done in this direction. The approach was first introduced by A. Biere et al. in checking linear temporal logic (LTL) formulae and then also adapted to check formulae of the universal fragment of computation tree logic (ACTL) by W. Penczek et al. As the efficiency of model checking is still an important issue, we present an improved BMC approach for ACTL based on Penczek’s method. We consider two aspects of the approach. One is reduction of the number of variables and transitions in the kmodel by distinguishing the temporal operator EX from the others. The other is simplification of the transformation of formulae by using uniform path encoding instead of a disjunction of all paths needed in the kmodel. With these improvements, for an ACTL formula, the length of the final encoding of the formula in the worst case is reduced. The improved approach is implemented in the tool BMV and is compared with the original one by applying both to two well known examples, mutual exclusion and dining philosophers. The comparison shows the advantages of the improved approach with respect to the efficiency of model checking.
Keywords
software verification model checking algorithm bounded model checking ACTL SAT Title
 Improved Bounded Model Checking for the Universal Fragment of CTL
 Journal

Journal of Computer Science and Technology
Volume 24, Issue 1 , pp 96109
 Cover Date
 200901
 DOI
 10.1007/s1139000992085
 Print ISSN
 10009000
 Online ISSN
 18604749
 Publisher
 Springer US
 Additional Links
 Topics
 Keywords

 software verification
 model checking algorithm
 bounded model checking
 ACTL
 SAT
 Industry Sectors
 Authors

 Liang Xu ^{(1)} ^{(2)}
 Wei Chen ^{(1)} ^{(2)}
 YanYan Xu ^{(1)} ^{(2)}
 WenHui Zhang ^{(1)}
 Author Affiliations

 1. State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China
 2. Graduate University of Chinese Academy of Sciences, Beijing, 100049, China