Journal of Computer Science and Technology

, Volume 24, Issue 1, pp 96–109

Improved Bounded Model Checking for the Universal Fragment of CTL

Authors

    • State Key Laboratory of Computer Science, Institute of SoftwareChinese Academy of Sciences
    • Graduate University of Chinese Academy of Sciences
  • Wei Chen
    • State Key Laboratory of Computer Science, Institute of SoftwareChinese Academy of Sciences
    • Graduate University of Chinese Academy of Sciences
  • Yan-Yan Xu
    • State Key Laboratory of Computer Science, Institute of SoftwareChinese Academy of Sciences
    • Graduate University of Chinese Academy of Sciences
  • Wen-Hui Zhang
    • State Key Laboratory of Computer Science, Institute of SoftwareChinese Academy of Sciences
Regular Paper

DOI: 10.1007/s11390-009-9208-5

Cite this article as:
Xu, L., Chen, W., Xu, Y. et al. J. Comput. Sci. Technol. (2009) 24: 96. doi:10.1007/s11390-009-9208-5

Abstract

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.

Keywords

software verification model checking algorithm bounded model checking ACTL SAT

Supplementary material

11390_2009_9208_MOESM1_ESM.pdf (89 kb)
(PDF 88.8 kb)

Copyright information

© Springer 2009