Abstract
We present a state abstraction that is defined with respect to a given CTL formula. Since it does not attempt to preserve all ACTL formula, like simulation does, we can expect to compute coarser abstraction. Specifically, the abstraction is used to reduce the size of each Kripke structure, so that their product will be smaller. When the abstraction is too coarse, we show how refinement can be applied to produce a more precise abstract model. We also extend the notion of formula-dependent abstraction to Kripke structure with fairness, and define the coarsest abstraction that preserves the given CTL formula interpreted with respect to the fair paths. The method is exact and fully automatic, and handles full CTL.
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.
References
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)
Clarke, E.M., Burch, J.R., Grumberg, O., Long, D.E., McMillan, K.L.: Automatic Verification of Sequential Circuit Designs. Phil. Trans. of the Royal Society of London 339, 105–120 (1992)
Emerson, E.A.: Temporal and Model Logic. Formal Models and Semantics. Handbook of theoretical Computer Science, vol. B, pp. 996–1072 (1990)
Clarke, E.M., Emerson, E.A.: Synthesis of Synchronization Skeletons for Branching Time Temporal Logic. In: Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982)
Graf, S., Saidi, H.: Construction of Abstract State Graphs with PVS. In: Proceedings of Computer Aided Verification. LNCS, vol. 1254, pp. 72–83. Springer, Heidelberg (1997)
Cousot, P., Cousot, R.: Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Proceedings of POPL, pp. 238–252 (1977)
Cousot, P., Cousot, R.: Abstract Interpretation Frameworks. Journal of Logic and Computation 2(4), 511–547 (1992)
Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic Verfication of Finite-state Concurrent Systems Using Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems 8(2), 244–263 (1986)
Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided Abstraction Refinement. In: Proceedings of Computer Aided Verification, pp. 154–169 (2000)
Alur, R., Itai, A., Kurshan, R.P., Yannakakis, M.: Timing Verification by Successive Approximation. Information and Computation 118(1), 142–157 (1995)
Lakhnech, Y., Bensalem, S., Berezin, S., Owre, S.: Incremental Verification by Abstraction. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol. 2031, pp. 98–112. Springer, Heidelberg (2001)
Clarke, E., Grumberg, O., Long, D.E.: Model Checking and Abstraction. In: Proceedings of TOPLAS, pp. 1512–1542 (1994)
Aziz, A., Shiple, T.R., Singhal, V., Sangiovanni-Vincentelli, A.L.: Formula-dependent Equivalence for Compositional CTL Model Checking. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 324–337. Springer, Heidelberg (1994)
Dams, D., Gerth, R., Grumberg, O.: Generation of Reduced Models for Checking Fragments of CTL. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 479–490. Springer, Heidelberg (1993)
Dams, D., Gerth, R., Grumberg, O.: Abstract Interpretation of Reactive Systems. ACM Transactions on Programming Languages and Systems 19(2), 253–291 (1997)
Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property Preserving Abstractions for the Verification of Concurrent Systems. Formal Methods in System Design 6(1), 11–44 (1995)
Dams, D., Gerth, R., Grumberg, O.: Fair model Checking of Abstractions (extended abstract). In: Proceedings of VCL, number DSSE-TR-2000-6, University of Southampton (July 2000)
Aziz, A., Singhal, V., Shiple, T.R., SangiovanniVincentelli, A.L., Balarin, F., Brayton, R.K.: Equivalences for Fair Kripke Structures. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 364–375. Springer, Heidelberg (1994)
Bensalem, S., Lakhnech, Y., Owre, S.: Computing Abstractions of Infinite State Systems Compositionally and Automatically. In: Proceedings of Computer Aided Verification. LNCS, vol. 1427, pp. 319–331 (1998)
Giacobazzi, R., Ranzato, F.: Incompleteness, Counterexamples and Refinements in Abstract Model Checking. In: Cousot, P. (ed.) SAS 2001. LNCS, vol. 2126, pp. 356–373. Springer, Heidelberg (2001)
Ranzato, F., Tapparo, F.: Strong Preservation as Completeness in Abstract Interpretation. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 18–32. Springer, Heidelberg (2004)
Ranzato, F., Tapparo, F.: Strong Preservation of Temporal Fixpoint-based Operators by Abstract Interpretation. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 332–347. Springer, Heidelberg (2005)
Corbett, J.C., Dwyer, M.B., Hatcliff, J., Laubach, S., Pasareanu, C.S., Robby., Zheng, H.: Bandera: Extracting Finite-state Models from Java Source Code. In: Proceedings of ICSE, pp. 439–448 (2000)
Havelund, K., Pressburger, T.: Model Checking JAVA Programs using JAVA PathFinder. International Journal on Software Tools for Technology Transfer 2(4), 366–381 (2000)
Ball, T., Majumdar, R., Millstein, T.D., Rajamani, S.K.: Automatic Predicate Abstraction of C Programs. In: SIGPLAN Conference on Programming Language Design and Implementation, pp. 203–213 (2001)
Chaki, S., Clarke, E.M., Groce, A., Ouaknine, J., Strichman, O., Yorav, K.: Efficient Verification of Sequential and Concurrent C Programs. Formal Methods in System Design 25(2-3), 129–166 (2004)
Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy Abstraction. In: Proceedings of POPL, pp. 58–70 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qian, J., Zhao, L., Cai, G., Gu, T. (2008). Formula-Dependent Abstraction for CTL Model Checking. In: Gervasi, O., Murgante, B., Laganà, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2008. ICCSA 2008. Lecture Notes in Computer Science, vol 5073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69848-7_82
Download citation
DOI: https://doi.org/10.1007/978-3-540-69848-7_82
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69840-1
Online ISBN: 978-3-540-69848-7
eBook Packages: Computer ScienceComputer Science (R0)