Abstract
This work presents a first-order model checking procedure that verifies systems with large or even infinite data spaces with respect to first-order CTL specifications. The procedure relies on a partition of the system variables into control and data. While control values are expanded into BDD-representations, data values enter in form of their properties relevant to the verification task. The algorithm is completely automatic. If the algorithm terminates, it has generated a first-order verification condition on the data space which characterizes the system’s correctness. Termination can be guaranteed for a class that properly includes the data-independent systems, defined in [10].
This work improves [5], where we extended explicit model checking algorithms. Here, both the control part and the first-order conditions are represented by BDDs, providing the full power of symbolic model checking for control aspects of the design.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berezin, S., Biere, A., Clarke, E., Zhu, Y.: Combining symbolic model checking with uninterpreted functions for out-of-order processor verification. Submitted for publication
Bernholtz, O., Vardi, M., Wolper, P.: An automata-theoretic approach to branching-time model checking. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 142–155. Springer, Heidelberg (1994)
Burch, J.R., Dill, D.L.: Automatic verification of pipelined microprocessor control. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 68–80. Springer, Heidelberg (1994)
Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM TOPLAS 16(5), 1512–1542 (1994)
Damm, W., Hungar, H., Grumberg, O.: What if model checking must be truly symbolic. In: Camurati, P.E., Eveking, H. (eds.) CHARME 1995. LNCS, vol. 987. Springer, Heidelberg (1995)
Dingel, J., Filkorn, T.: Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939. Springer, Heidelberg (1995)
Graf, S.: Verification of a distributed cache memory by using abstractions. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 207–219. Springer, Heidelberg (1994)
Isles, A.J., Hojati, R., Brayton, R.K.: Computing reachability control states of systems modeled with uninterpreted functions and infinite memory. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427. Springer, Heidelberg (1998)
Sajid, K., Goel, A., Zhou, H., Aziz, A., Barber, S., Singhal, V.: BDD based procedures for the theory of equality with uninterpreted functions. In: Y. Vardi, M. (ed.) CAV 1998. LNCS. vol. 1427. Springer, Heidelberg (1998)
Wolper, P.: Expressing interesting properties of programs in propositional temporal logic. In: POPL 1986, pp. 184–193 (1986)
Xu, Y., Cerny, E., Song, X., Corella, F., Mohamed, O.A.: Model checking for a first-order temporal logic using multiway decision graphs. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bohn, J., Damm, W., Grumberg, O., Hungar, H., Laster, K. (1998). First-Order-CTL Model Checking. In: Arvind, V., Ramanujam, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1998. Lecture Notes in Computer Science, vol 1530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49382-2_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-49382-2_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65384-4
Online ISBN: 978-3-540-49382-2
eBook Packages: Springer Book Archive