Abstract
In the verification methods presented in Chapter 10, the model of finite state machine was the center of attention. Based on this, we now consider the more general verification concept of model checking. This concept is not strictly tied to the model of finite state machine, but is capable in addition of handling logic-based specifications.
Corriger la fortune [Take control of destiny]. Gotthold Ephraim Lessing (1729–1781)
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
The significance of computation tree logic for model checking was recognized by Clarke, Emerson, and Sistla [CES86].
In the years 1989/90, several research groups simultaneously opened up the potential of OBDD-based set representations for model checking: Coudert, Madre, and Berthet, further Burch, Clarke, McMillan, and Dill, and as third group Bose and Fisher. A chronicle of these achievements can be found in [BCL+94]. A substantial contribution in the development of symbolic model checking is due to McMillan, the author of the OBDD-based model checker SMV [McM93].
The VIS verification system was developed by research groups in Berkeley and in Boulder under the direction of Brayton, Hachtel, Sangiovanni-Vincentelli, and Somenzi [BHS+96]. Descriptions of the commercial systems CVE and RuleBase can be found in [BLPV95] and [BBEL96].
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Meinel, C., Theobald, T. (1998). Symbolic Model Checking. In: Algorithms and Data Structures in VLSI Design. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58940-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-58940-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64486-6
Online ISBN: 978-3-642-58940-9
eBook Packages: Springer Book Archive