Skip to main content
SpringerLink
Log in

Regular model checking

  • Introduction
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract

Regular model checking has been studied extensively during recent years as a framework for algorithmic verification of systems with infinite state spaces. We describe the main concepts of the framework, and some of its applications.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abdulla, P.A., Jonsson, B., Nilsson, M., d’Orso, J., Saksena, M.: Regular model checking for S1S + LTL, In this volume (2012)

  2. Abdulla P.A.: Well (and better) quasi-ordered transition systems. Bull. Symb. Log. 16(4), 457–515 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Abdulla, P.A., Bjesse, P., Eén, N.: Symbolic reachability analysis based on sat-solvers. In: Graf, S., Schwartzbach, M.I. (eds.), Tools and algorithms for construction and analysis of systems, Proceedings of the 6th International Conference, TACAS 2000, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000, Berlin, Germany, March 25–April 2, 2000. Lecture Notes in Computer Science, vol. 1785, pp 411–425. Springer, Berlin (2000)

  4. Abdulla, P.A., Bouajjani, A., Jonsson, B.: On-the-fly analysis of systems with unbounded, lossy fifo channels. In: Hu, AJ., Vardi, M.Y. (eds.), Computer Aided Verification, Proceedings of the 10th International Conference, CAV ’98, Vancouver, BC, Canada, June 28–July 2, 1998. Lecture Notes in Computer Science, vol. 1427, pp. 305–318, Springer, Berlin (1998)

  5. Abdulla, P.A., Bouajjani, A., Jonsson, B., Nilsson, M.: Handling global conditions in parameterized system verification. In: Halbwachs, N., Peled, D. (eds.), CAV. Lecture Notes in Computer Science, vol. 1633, pp. 134–145. Springer, Berlin (1999)

  6. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS, pp. 313–321 (1996)

  7. Abdulla, P.A., Chen, Y.-F., Holík, L., Mayr, R., Vojnar, T.: When simulation meets antichains. In: Esparza, J., Majumdar, R. (eds.), TACAS. Lecture Notes in Computer Science, vol. 6015, pp. 158–174. Springer, Berlin (2010)

  8. Abdulla, P.A., Delzanno, G., Henda, N.B., Rezine, A.: Regular model checking without transducers (on efficient verification of parameterized systems). In: Grumberg, O., Huth, M. (eds.), TACAS. Lecture Notes in Computer Science, vol. 4424, pp. 721–736. Springer, Berlin (2007)

  9. Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. In: LICS, pp. 160–170. IEEE Computer Society, Montreal, Canada (1993)

  10. Abdulla, P.A., Jonsson, B., Mahata, P., d’Orso, J.: Regular tree model checking. In: Brinksma, E., Larsen, K.G. (eds.), Computer Aided Verification, Proceedings of the 14th International Conference, CAV 2002, Copenhagen, Denmark, July 27–31, 2002. Lecture Notes in Computer Science, vol. 2404, pp. 555–568, Springer, Berlin (2002)

  11. Abdulla P.A., Jonsson B., Nilsson M., d’Orso J.: Regular model checking made simple and efficient. In: Brim, L., Jancar, P., Kretínský, M., Kucera, A. (eds.) CONCUR. Lecture Notes in Computer Science, vol. 2421, pp. 116–130. Springer, Berlin (2002)

    Google Scholar 

  12. Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking for real-time systems. In: LICS. pp. 414–425. IEEE Computer Society, USA (1990)

  13. Bardin S., Finkel A., Leroux J., Schnoebelen P.: Flat acceleration in symbolic model checking. In: Peled, D., Tsay, Y.-K. (eds.) ATVA. Lecture Notes in Computer Science, vol. 3707, pp. 474–488. Springer, Berlin (2005)

    Google Scholar 

  14. Boigelot, B.: Domain-specific regular accelaration, 2012. In this volume

  15. Boigelot B., Godefroid P.: Symbolic verification of communication protocols with infinite state spaces using qdds (extended abstract). In: Alur, R., Henzinger, T.A. (eds.) CAV. Lecture Notes in Computer Science, vol. 1102, pp. 1–12. Springer, Berlin (1996)

    Google Scholar 

  16. Boigelot B., Godefroid P., Willems B., Wolper P.: The power of qdds (extended abstract). In: Hentenryck, P.V. (ed.) SAS. Lecture Notes in Computer Science, vol. 1302, pp. 172–186. Springer, Berlin (1997)

    Google Scholar 

  17. Boigelot B., Legay A., Wolper P.: Iterating transducers in the large (extended abstract). In: Warren, A.H., Somenzi, F. (eds.) CAV. Lecture Notes in Computer Science, vol. 2725, pp. 223–235. Springer, Berlin (2003)

    Google Scholar 

  18. Boigelot B., Legay A., Wolper P.: Omega-regular model checking. In: Jensen, K., Podelski, A. (eds.) TACAS. Lecture Notes in Computer Science, vol. 2988, pp. 561–575. Springer, Berlin (2004)

    Google Scholar 

  19. Boigelot B., Wolper P.: Symbolic verification with periodic sets. In: Dill, D.L. (ed.) CAV. Lecture Notes in Computer Science, vol. 818, pp. 55–67. Springer, Berlin (1994)

    Google Scholar 

  20. Bouajjani A., Esparza J., Maler O.: Reachability analysis of pushdown automata: application to model-checking. In: Mazurkiewicz, A.W., Winkowski, J. (eds.) CONCUR. Lecture Notes in Computer Science, vol. 1243, pp. 135–150. Springer, Berlin (1997)

    Google Scholar 

  21. Bouajjani A., Habermehl P.: Symbolic reachability analysis of fifo channel systems with nonregular sets of configurations (extended abstract). In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP. Lecture Notes in Computer Science, vol. 1256, pp. 560–570. Springer, Berlin (1997)

    Google Scholar 

  22. Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular tree model checking of complex dynamic data structures. In: Yi, K. (ed.), SAS. Lecture Notes in Computer Science, vol. 4134, pp. 52–70. Springer (2006)

  23. Bouajjani A., Habermehl P., Vojnar T.: Abstract regular model checking. In: Alur, R., Peled, D. (eds.) CAV. Lecture Notes in Computer Science, vol. 3114, pp. 372–386. Springer, Berlin (2004)

    Google Scholar 

  24. Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.), Computer Aided Verification, Proceedings of the 12th International Conference, CAV 2000, Chicago, IL, USA, July 15–19, 2000. Lecture Notes in Computer Science, vol. 1855, pp. 403–418, Springer, Berlin (2000)

  25. Bouajjani, A., Rogalewicz, A., Habermehl, P., Vojnar, T.: Abstract regular (tree) model checking, 2012. In this volume

  26. Bouajjani, A., Touili, T.: Extrapolating tree transformations. In: Brinksma, E., Larsen, K.G. (eds.), Computer Aided Verification, Proceedings of the 14th International Conference, CAV 2002, Copenhagen, Denmark, July 27–31, 2002. Lecture Notes in Computer Science, vol. 2404, pp. 539–554. Springer, Berlin (2002)

  27. Bouajjani, A., Touili, Tayssir.: Widening techniques for regular tree model checking, 2012. In this volume

  28. Brinksma, E., Larsen, K.G. (eds.): Computer Aided Verification, Proceedings of the 14th International Conference, CAV 2002, Copenhagen, Denmark, July 27–31, 2002. Lecture Notes in Computer Science, vol. 2404. Springer, Berlin (2002)

  29. Burch J.R., Clarke E.M., McMillan K.L., Dill D.L., Hwang L.J.: Symbolic model checking: 1020 states and beyond. Inf. Comput. 98(2), 142–170 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  30. Burkart Olaf., Steffen Bernhard.: Model checking for context-free processes. In: Cleaveland, R. (ed.) CONCUR. Lecture Notes in Computer Science, vol. 630, pp. 123–137. Springer, Berlin (1992)

    Google Scholar 

  31. Burkart O., Steffen B.: Pushdown processes: parallel composition and model checking. In: Jonsson, B., Parrow, J. (eds.) CONCUR. Lecture Notes in Computer Science, vol. 836, pp. 98–113. Springer, Berlin (1994)

    Google Scholar 

  32. Caucal D.: On the regular structure of prefix rewriting. Theor. Comput. Sci. 106(1), 61–86 (1992)

    Article  MathSciNet  Google Scholar 

  33. Clarke E.M., Biere A., Raimi R., Zhu Y.: Bounded model checking using satisfiability solving. Form. Methods Syst. Des. 19(1), 7–34 (2001)

    Article  MATH  Google Scholar 

  34. Clarke E.M., Emerson E.A.: Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Kozen, D. (ed.) Logic of Programs. Lecture Notes in Computer Science, vol. 131, pp. 52–71. Springer, Berlin (1981)

    Google Scholar 

  35. Cleaveland R.: Pragmatics of model checking: an sttt special section. STTT 2(3), 208–218 (1999)

    MATH  Google Scholar 

  36. Dams D., Lakhnech Y., Steffen M.: Iterating transducers. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV. Lecture Notes in Computer Science, vol. 2102, pp. 286–297. Springer, Berlin (2001)

    Google Scholar 

  37. Delzanno, G., Rezine, A.: A lightweight regular model checking approach for parameterized systems, 2012. In this volume

  38. Doyen L., Raskin J.-F.: Antichains for the automata-based approach to model-checking. Log. Methods Comput. Sci. 5(1), 1–20 (2009)

    MathSciNet  Google Scholar 

  39. Emerson, E.A., Sistla, A.P. (eds.): Computer Aided Verification, Proceedings of the 12th International Conference, CAV 2000, Chicago, IL, USA, July 15–19, 2000. Lecture Notes in Computer Science, vol. 1855. Springer, Berlin (2000)

  40. Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient algorithms for model checking pushdown systems. In: Emerson, E.A., Sistla, A.P. (eds.), Computer Aided Verification, Proceedings of the 12th International Conference, CAV 2000, Chicago, IL, USA, July 15–19, 2000. Lecture Notes in Computer Science, vol. 1855. pp. 232–247. Springer, Berlin (2000)

  41. Graf, S., Schwartzbach, M.I. (eds.): Tools and algorithms for construction and analysis of systems, Proceedings of the 6th International Conference, TACAS 2000, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000, Berlin, Germany, March 25–April 2, 2000. Lecture Notes in Computer Science, vol. 1785, Springer, Berlin (2000)

  42. Hu, A.J., Vardi, M.Y. (eds.): Computer Aided Verification, Proceedings of the 10th International Conference, CAV ’98, Vancouver, BC, Canada, June 28–July 2, 1998. Lecture Notes in Computer Science, vol. 1427, Springer, Berlin (1998)

  43. Jonsson, B., Nilsson, M.: Transitive closures of regular relations for verifying infinite-state systems. In: Graf, S., Schwartzbach, M.I. (eds.), Tools and algorithms for construction and analysis of systems, Proceedings of the 6th International Conference, TACAS 2000, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000, Berlin, Germany, March 25–April 2, 2000. Lecture Notes in Computer Science, vol. 1785, pp. 220–234. Springer, Berlin (2000)

  44. Kesten Y., Maler O., Marcus M., Pnueli A., Shahar E.: Symbolic model checking with rich assertional languages. Theor. Comput. Sci. 256(1–2), 93–112 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  45. Klarlund N., Møller A., Schwartzbach M.I.: Mona implementation secrets. Int. J. Found. Comput. Sci. 13(4), 571–586 (2002)

    Article  MATH  Google Scholar 

  46. Legay, A.: Extrapolating (omega-)regular model checking, 2012. In this volume

  47. Queille J.-P., Sifakis J.: Specification and verification of concurrent systems in cesar. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Symposium on Programming. Lecture Notes in Computer Science, vol. 137, pp. 337–351. Springer, Berlin (1982)

    Google Scholar 

  48. Touili T.: Regular model checking using widening techniques. Electr. Notes Theor. Comput. Sci. 50(4), 342–356 (2001)

    Article  Google Scholar 

  49. Wolper, P., Boigelot, B.: Verifying systems with infinite but regular state spaces. In: Hu, A.J., Vardi, M.Y. (eds.), Computer Aided Verification, Proceedings of the 10th International Conference, CAV ’98, Vancouver, BC, Canada, June 28–July 2, 1998. Lecture Notes in Computer Science, vol. 1427, pp. 88–97. Springer, Berlin (1998)

Download references

Author information

Authors and Affiliations

  1. Department of Information Technology, Uppsala University, Uppsala, Sweden

    Parosh Aziz Abdulla

Authors
  1. Parosh Aziz Abdulla
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Parosh Aziz Abdulla.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abdulla, P.A. Regular model checking. Int J Softw Tools Technol Transfer 14, 109–118 (2012). https://doi.org/10.1007/s10009-011-0216-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-011-0216-8

Keywords

Search

Navigation