Skip to main content
SpringerLink
Log in

A lightweight regular model checking approach for parameterized systems

  • RMC Regular Model Checking
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract

In recent years, we have designed a lightweight approach to regular model checking specifically designed for parameterized systems with global conditions. Our approach combines the strength of regular languages, used for representing infinite sets of configurations, with symbolic model checking and approximations. In this paper, we give a uniform presentation of several variations of a symbolic backward reachability scheme in which different classes of regular expressions are used in place of BDDs. The classification of the proposed methods is based on the precision of the resulting approximated analysis.

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., Čerāns, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. LICS 313–321 (1996)

  2. Abdulla, P.A., Chen, Y.-F., Delzanno, G., Haziza, F., Hong, C.-D., Rezine, A.: Constrained monotonic abstraction: a cegar for parameterized verification. In: CONCUR, pp. 86–101 (2010)

  3. Abdulla, P.A., Ben Henda, N., Delzanno, G., Rezine, A.: Regular model checking without transducers. In: TACAS, pp. 721–736 (2007)

  4. Abdulla, P.A., Ben Henda, N., Delzanno, G., Rezine, A.: Handling parameterized systems with non-atomic global conditions. In: VMCAI, pp. 22–36 (2008)

  5. Abdulla, P.A., Delzanno, G., Rezine, A.: Parameterized verification of infinite-state processes with global conditions. In: CAV, pp. 145–157 (2007)

  6. Abdulla, P.A., Delzanno, G., Haziza, F., Rezine, A.: Parameterized tree systems. In: FORTE’08, pp. 69–83 (2008)

  7. Abdulla, P.A., Delzanno, G., Rezine, A.: Approximated context-sensitive analysis for parameterized verification. In: FMOODS/FORTE, pp. 41–56 (2009)

  8. Arons, T., Pnueli, A., Ruah, S., Xu, J., Zuck, L.: Parameterized verification with automatically computed inductive assertions. In: CAV, pp. 221–234 (2001)

  9. Bouajjani, A., Habermehl, P., Vojnar, T.: Abstract regular model checking. In: CAV, pp. 372–386 (2004)

  10. Bouajjani A., Muscholl A., Touili T.: Permutation rewriting and algorithmic verification. Inf. Comp. 205(2), 199–224 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Clarke, E., Talupur, M., Veith, H.: Environment abstraction for parameterized verification. In: VMCAI, pp. 126–141 (2006)

  12. Courtois P.-J., Heymans F., Lorge Parnas D.: Concurrent control with “readers” and “writers”. CACM 14(10), 667–668 (1971)

    Google Scholar 

  13. Delzanno G.: Constraint-based verification of parameterized cache coherence protocols. FMSD 23(3), 257–301 (2003)

    MATH  Google Scholar 

  14. Emmi, M., Jhala, R., Kohler, E., Majumdar, R.: Verifying reference counted objects. In: TACAS, pp. 352–367 (2009)

  15. Ghilardi S., Ranise S.: Backward reachability of array-based systems by SMT solving: termination and invariant synthesis. Log. Methods Comput. Sci. 6(4), 1–48 (2010)

    MathSciNet  Google Scholar 

  16. Gribomont, E., Zenner, G.: Automated verification of Szymanski’s algorithm. In: TACAS, pp. 424–438 (1998)

  17. Henzinger T.A., Ho P.-H., Wong-Toi H.: HyTech: a model checker for hybrid systems. STTT 1, 110–122 (1997)

    MATH  Google Scholar 

  18. Higman G.: Ordering by divisibility in abstract algebras. Lond. Math. Soc. (3) 2(7), 326–336 (1952)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kesten Y., Maler O., Marcus M., Pnueli A., Shahar E.: Symbolic model checking with rich assertional languages. TCS 256, 93–112 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  20. Lamport L.: A new solution of Dijkstra’s concurrent programming problem. Commun. ACM 17(8), 453–455 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  21. Manna, Z., Pnueli, A.: An exercise in the verification of multi-process programs. In: Beauty is Our Business, pp. 289–301 (1990)

  22. Nilsson, M.: Regular model checking. PhD thesis, Uppsala University (2005)

  23. Pnueli, A., Ruah, S., Zuck, L.: Automatic deductive verification with invisible invariants. In: TACAS, pp. 82–97 (2001)

  24. Talupur, M.: Abstraction techniques for parameterized verification. PhD thesis, CMU (2006)

  25. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. LICS 332–344 (1986)

  26. Yavuz-Kahveci T., Bultan T.: A symbolic manipulator for automated verification of reactive systems with heterogeneous data types. STTT 5(1), 15–33 (2003)

    Google Scholar 

  27. Yavuz-Kahveci, T., Bultan, T.: Verification of parameterized hierarchical state machines using action language verifier. In: MEMOCODE, pp. 79–88 (2005)

Download references

Author information

Authors and Affiliations

  1. Università di Genova, Genoa, Italy

    Giorgio Delzanno

  2. Uppsala University, Uppsala, Sweden

    Ahmed Rezine

Authors
  1. Giorgio Delzanno
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ahmed Rezine
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giorgio Delzanno.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Delzanno, G., Rezine, A. A lightweight regular model checking approach for parameterized systems. Int J Softw Tools Technol Transfer 14, 207–222 (2012). https://doi.org/10.1007/s10009-011-0213-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-011-0213-y

Keywords

Search

Navigation