%0 Journal Article
%T Improved Bounded Model Checking for the Universal Fragment of CTL
%A Liang Xu
%A Wei Chen
%A Yan-Yan Xu
%A Wen-Hui Zhang
%A <br>Liang Xu
%A Wei Chen
%A Yan-Yan Xu
%A and Wen-Hui Zhang
%J 计算机科学技术学报
%D 2009
%I 
%X SAT-based bounded model checking (BMC) has been introduced as a complementary technique to BDD-based 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 k-model 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 k-model. 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. Electronic Supplementary Material  The online version of this article (doi:) contains supplementary material, which is available to authorized users. This work is supported by the National Natural Science Foundation of China under Grants No. 60573012 and No. 60721061, and the National Basic Research 973 Program of China under Grant No. 2002CB312200.
%K software verification
%K model checking algorithm
%K bounded model checking
%K ACTL
%K SAT<br>二心
%K 二衬
%K 石子
%K 卜甲
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=D3527F1C3E6A031B6980CCD285EAF4EA&yid=DE12191FBD62783C&vid=B91E8C6D6FE990DB&iid=CA4FD0336C81A37A&sid=6700D0D256586E73&eid=91C9056D8E8856E0&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=1&reference_num=22