Abstract
We present an algorithm that uses decision procedures to generate finite-state abstractions of possibly infinite-state systems. The algorithm compositionally abstracts the transitions of the system, relative to a given, fixed set of assertions. Thus, the number of validity checks is proportional to the size of the system description, rather than the size of the abstract state-space. The generated abstractions are weakly preserving for ∀CTL temporal properties. We describe several applications of the algorithm, implemented using the decision procedures of the Stanford Temporal Prover (STeP).
This research was supported in part by the National Science Foundation under grant CCR-95-27927, the Defense Advanced Research Projects Agency under NASA grant NAG2-892, ARO under grant DAAH04-95-1-0317, ARO under MURI grant DAAH04-96-1-0341, and by Army contract DABT63-96-C-0096 (DARPA).
Chapter PDF
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. Alur and T.A. Henzinger, editors. Proc. 8 th Intl. Conference on Computer Aided Verification, vol. 1102 of LNCS. Springer-Verlag, July 1996.
N.S. Bjørner, A. Browne, E.S. Chang, M. Colón, A. Kapur, Z. Manna, H.B. Sipma, and T.E. Uribe. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Alur and Henzinger [AH96], pages 415-418.
N.S. Bjørner, A. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49–87, February 1997. Preliminary version appeared in 1st Intl. Conf. on Principles and Practice of Constraint Programming, vol. 976 of LNCS, pp. 589–623, Springer-Verlag, 1995.
N.S. Bjørner, M.E. Stickel, and T.E. Uribe. A practical integration of first-order reasoning and decision procedures. In 14th Intl. Conf. on Automated Deduction, vol. 1249 of LNCS, pages 101–115. Springer-Verlag, July 1997.
P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Symp. Princ. of Prog. Lang., pages 238–252. ACM Press, 1977.
E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. ACM Trans. on Prog. Lang. and Systems, 16(5):1512–1542, September 1994.
D.R. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Eindhoven University of Technology, July 1996.
J. Dingel and T. Filkorn. Model checking of infinite-state systems using data abstraction, assumption-commitment style reasoning and theorem proving. In Wolper [Wo195], pages 54-69.
D.R. Dams, R. Gerth, and O. Grümberg. Abstract interpretation of reactive systems. ACM Transactions on Prog. Lang. and Systems, 19(2):253–291, 1997.
P.R. D'Argenio, J.P. Katoen, T. Ruys, and G.T. Tretmans. The bounded retransmission protocol must be on time! In 3rd TACAS Workshop, vol. 1217 of LNCS, pages 416–432. Springer-Verlag, 1997.
D.L. Dill and H. Wong-Toi. Verification of real-time systems by successive over and under approximation. In Wolper [Wo195], pages 409–422.
E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, pages 995–1072. Elsevier Science Publishers (North-Holland), 1990.
O. Grumberg, editor. Proc. 9 th Intl. Conference on Computer Aided Verification, vol. 1254 of LNCS. Springer-Verlag, June 1997.
S. Graf and H. Saidi. Construction of abstract state graphs with PVS. In Grumberg [Gru97], pages 72–83.
K. Havelund and N. Shankar. Experiments in theorem proving and model checking for protocol verification. In Formal Methods Europe, pages 662–681, March 1996.
P. Kelb, D. Dams, and R. Gerth. Practical symbolic model checking of the full μ-calculus using compositional abstractions. Technical Report 95/31, Eindhoven University of Technology, The Netherlands, October 1995.
Y. Kesten, Z. Manna, and A. Pnueli. Temporal verification of simulation and refinement. In A Decade of Concurrency, vol. 803 of LNCS, pages 273–346. Springer-Verlag, 1994.
C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6:1–35, 1995.
K.L. McMillan. Symbolic Model Checking. Kluwer Academic Pub., 1993.
Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
Z. Manna and A. Pnueli. Clocked transition systems. Tech. Report STAN-CSTR-96-1566, Computer Science Department, Stanford University, April 1996.
A. Pardo and G. Hachtel. Automatic abstraction techniques for propositional μ-calculus model checking. In Grumberg [Gru97], pages 12–23.
H.B. Sipma, T.E. Uribe, and Z. Manna. Deductive model checking. In Alur and Henzinger [AH96], pages 208–219.
P. Wolper, editor. Proc. 7 th Intl. Conference on Computer Aided Verification, vol. 939 of LNCS. Springer-Verlag, July 1995.
H. Wong-Toi. Symbolic Approximations for Verifying Real-Time Systems. PhD thesis, Computer Science Department, Stanford University, March 1995. Tech. Report CS-TR-95-1546.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Colón, M.A., Uribe, T.E. (1998). Generating finite-state abstractions of reactive systems using decision procedures. In: Hu, A.J., Vardi, M.Y. (eds) Computer Aided Verification. CAV 1998. Lecture Notes in Computer Science, vol 1427. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028753
Download citation
DOI: https://doi.org/10.1007/BFb0028753
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64608-2
Online ISBN: 978-3-540-69339-0
eBook Packages: Springer Book Archive