Frontiers of Computer Science in China

, Volume 2, Issue 4, pp 368–379

Compositional encoding for bounded model checking

Research Article

DOI: 10.1007/s11704-008-0035-6

Cite this article as:
Sun, J., Liu, Y., Dong, J.S. et al. Front. Comput. Sci. China (2008) 2: 368. doi:10.1007/s11704-008-0035-6

Abstract

Verification techniques like SAT-based bounded model checking have been successfully applied to a variety of system models. Applying bounded model checking to compositional process algebras is, however, a highly non-trivial task. One challenge is that the number of system states for process algebra models is not statically known, whereas exploring the full state space is computationally expensive. This paper presents a compositional encoding of hierarchical processes as SAT problems and then applies state-of-the-art SAT solvers for bounded model checking. The encoding avoids exploring the full state space for complex systems so as to deal with state space explosion. We developed an automated analyzer which combines complementing model checking techniques (i.e., bounded model checking and explicit onthe-fly model checking) to validate system models against event-based temporal properties. The experiment results show the analyzer handles large systems.

Keywords

bounded model checking Communication Sequential Processes (CSP) Linear Temporal Logic (LTL) 

Copyright information

© Higher Education Press and Springer-Verlag GmbH 2008

Authors and Affiliations

  1. 1.School of ComputingNational University of SingaporeSingaporeSingapore
  2. 2.Department of Computer ScienceThe University of AucklandAucklandNew Zealand

Personalised recommendations