Abstract
Symbolic model checking, smc, is a decision procedure that verifies that some finite-state structure is a model for a formula of Computation Tree Logic (CTL). smc is based on fixpoint computations. Unfortunately, as the size of a structure grows exponentially with the number of state components, smc is not always powerful enough to handle realistic problems.
We first show that a subset of CTL formulas can be checked by testing simple sufficient conditions, that do not require any fixpoint computation. Based on these observations, we identify a second, larger, subset of CTL that can by verified with fewer fixpoint computations than smc. We propose a model checking algorithm for CTL that tests the identified sufficient conditions whenever possible and falls back to smc otherwise. In the best (resp. worst) case, the complexity of this algorithm is exponentially better (resp. the same) in terms of state components than that of smc.
The research presented in this paper has been partially financed by CNPq.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. J. Anderson, P. Beame, S. Burns, W. Chan, F. Modugno, D. Notkin, and R. Reese. Model checking large software specifications. In 4th Symposium on the Foundations of Software Engineering, pages 156–166. ACM/SIGSOFT, Oct. 1996.
A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without bdds. In TACAS’99, Lecture Notes in Computer Science. Springer Verlag.
R.E. Bryant. Graphbased algorithm for boolean function manipulation. IEEE Transactions Computers, C(35):1035–1044, 1986.
E.M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons for branching time temporal logic. In Logics of Programs: Workshop, volume 131 of Lecture Notes in Computer Science, pages 52–71. Springer Verlag, 1981.
E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finitestate concurrent systems using temporal logic specifications. ACM Transactions On Programming Languages and Systems, 8(2):244–263, Apr. 1986.
E.M. Clarke, O. Grumberg, and D. Long. Model checking and abstraction. In 19th Annual ACM Symposium on Principles of Programming Languages, 1992.
E.M. Clarke, O. Grumberg, H. Hiraishi, S. Jha, D.E. Long, K.L. McMillan, and L.A. Ness. Verification of the futurebus+cache coherence protocol. In L. Claesen, editor, 11th International Symposium on Computer Hardware Description Languages: CHDL’93. NorthHolland, 1993.
E.M. Clarke, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking.
D. Déharbe. Vérification Symbolique de Modèle pour la logique CTL: Étude et Application au Langage VHDL. PhD thesis, Université Joseph Fourier-Grenoble 1, Nov. 1996.
D. Déharbe and A. Martins Moreira. Using induction and BDDs to model check invariants. In Hon F. Li and David K. Probst, editors, CHARME’97: Correct Hardware Design and Verification Methods, Montréal, Canada, Oct. 1997. Chapman & Hall.
H. Iwashita, T. Nakata, and F. Hirose. CTL model checking based on forward state traversal. In ICCAD’96, page 82, 1996.
Bernhard Josko. MCTL-an extension of CTL for modular verification of concurrent systems. pages 165–187, 1987.
J.C. Madre. PRIAM Un outil de vérification formelle des circuits intégrés digitaux. PhD thesis, Ecole nationale supérieure des télécommunications, Paris, France, June 1990. 90 E 007.
K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Procs. 5 th international symposium on programming, volume 137 of Lecture Notes in Computer Science, pages 244–263. Springer Verlag, 1981.
B. Yang. Fmcad’98 benchmark traces. http://www.cs.cmu.edu/~bwolen/fmcad98.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Déharbe, D., Moreira, A.M. (1999). Symbolic Model Checking with Fewer Fixpoint Computations. In: Wing, J.M., Woodcock, J., Davies, J. (eds) FM’99 — Formal Methods. FM 1999. Lecture Notes in Computer Science, vol 1708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48119-2_17
Download citation
DOI: https://doi.org/10.1007/3-540-48119-2_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66587-8
Online ISBN: 978-3-540-48119-5
eBook Packages: Springer Book Archive