Abstract
Because of the state explosion problem, “explicit state” model checkers are limited in their application. One Solution to this problem is to use an implicit “symbolic” representation of State transitions and state labelings. This technique is called symbolic model checking [1,2]
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.L. McMillan. Symbolic Model Checking. Kluwer, 1993.
E. Clarke, O. Grumberg, and D. Long. Verification tools for finite state systems.
R.E. Bryant. Symbolic boolean manipulation with ordered binary decision diagrams. Technical Report CMU-CS-91-162, Carnegie Mellon, July 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg New York
About this chapter
Cite this chapter
McMillan, K.L. (2000). Symbolic Model Checking. In: Inan, M.K., Kurshan, R.P. (eds) Verification of Digital and Hybrid Systems. NATO ASI Series, vol 170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59615-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-59615-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64052-0
Online ISBN: 978-3-642-59615-5
eBook Packages: Springer Book Archive