Advertisement

Beyond Parameterized Verification

  • Marco Bozzano
  • Giorgio Delzanno
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2280)

Abstract

We present a sound and fully automated method for the verification of safety properties of parameterized systems with unbounded local data variables, a new class of infinite-state systems parametric in several dimensions. The method builds upon a specification and an assertional language based on the combination of multiset rewriting and constraints.We introduce new classes of parameterized systems for which verification of safety properties is decidable, and we introduce abstractions, defined at the level of constraints, to handle examples outside these classes. As case-study, we apply the method to verify fully automatically mutual exclusion properties for formulations of the ticket mutual exclusion algorithm parametric in the number of clients, servers, and in which both clients and servers have unbounded local data.

Keywords

Model Check Constraint System Atomic Formula Mutual Exclusion Safety Property 
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

  1. 1.
    P. A. Abdulla, K. Cerāns, B. Jonsson, and Y.-K. Tsay. General Decidability Theorems for Infinite-State Systems. In Proc. LICS’96, pp. 313–321, 1996.Google Scholar
  2. 2.
    P. A. Abdulla and B. Jonsson. Verifying Networks of Timed Processes. In Proc. TACAS’98, LNCS 1384, pp. 298–312, 1998.Google Scholar
  3. 3.
    P. A. Abdulla and B. Jonsson. Channel Representations in Protocol Verification. In Proc. CONCUR’2001, LNCS 2154, p. 1–15, 2001.Google Scholar
  4. 4.
    P. A. Abdulla and A. Nylén. Better is Better than Well: On Efficient Verification of Infinite-State Systems. In Proc. LICS’00, pp. 132–140, 2000.Google Scholar
  5. 5.
    T. Arons, A. Pnueli, S. Ruah, Y. Xu, and L. D. Zuck. Parameterized Verification with Automatically Computed Inductive Assertions. In Proc. CAV’01, LNCS 2102, pp. 221–234, 2001.Google Scholar
  6. 6.
    K. Baukus, S. Bensalem, Y. Lakhnech, and K. Stahl. Abstracting WS1S Systems to Verify Parameterized Networks. In Proc. TACAS’00, LNCS 1785, pp. 188–203, 2000.Google Scholar
  7. 7.
    A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular Model Checking. In Proc. CAV’00, LNCS 1855, pp. 403–418, 2000.Google Scholar
  8. 8.
    T. Bultan, R. Gerber, and W. Pugh. Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetics. In Proc. CAV’97, LNCS 1254, pp. 400–411, 1997.Google Scholar
  9. 9.
    I. Cervesato, N.A. Durgin, P.D. Lincoln, J.C. Mitchell, and A. Scedrov. A Metanotation for Protocol Analysis. In Proc. CSFW’99, p. 55–69, 1999.Google Scholar
  10. 10.
    G. Delzanno. Automatic Verification of Parameterized Cache Coherence Protocols. In Proc. CAV’00, LNCS 1855, pp. 53–68, 2000.Google Scholar
  11. 11.
    G. Delzanno. An Assertional Language for Systems Parametric in Several Dimensions. In Proc. VEPAS’ 01, ENTCS volume 50, issue 4, 2001.Google Scholar
  12. 12.
    G. Delzanno and A. Podelski. Model checking in CLP. In Proc. TACAS’99, LNCS 1579, pp. 223–239, 1999.Google Scholar
  13. 13.
    G. Delzanno, J.-F. Raskin, and L. Van Begin. Attacking Symbolic State Explosion. In Proc. CAV’01, LNCS 2102, pp. 298–310, 2001.Google Scholar
  14. 14.
    E.A. Emerson and K.S. Namjoshi. On Model Checking for Non-Deterministic Infinite-State Systems. In Proc. LICS’98, pp. 70–80, 1998.Google Scholar
  15. 15.
    J. Esparza, A. Finkel, and R. Mayr. On the Verification of Broadcast Protocols. In Proc. LICS’99, pp. 352–359, 1999.Google Scholar
  16. 16.
    F. Fioravanti, A. Pettorossi, M. Proietti. Verifcation of Sets of Infinite State Systems Using Program Transformation. In Proc. LOPSTR’01, pp. 55–66, 2001.Google Scholar
  17. 17.
    A. Finkel and P. Schnoebelen. Well-Structured Transition Systems Everywhere! Theoretical Computer Science, 256(1–2):63–92, 2001.zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    L. Fribourg. Constraint Logic Programming Applied to Model Checking. In Proc. LOPSTR’99, LNCS 1817, pp. 30–41, 1999.Google Scholar
  19. 19.
    S. M. German and A. P. Sistla. Reasoning about Systems with Many Processes. Journal of the ACM, 39(3):675–735, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    B. Jonsson and M. Nilsson. Transitive Closures of Regular Relations for Verifying Infinite-State Systems. In Proc. TACAS’00, LNCS 1785, pp. 220–234, 2000.Google Scholar
  21. 21.
    Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In Proc. CAV’97, LNCS 1254, pp. 424–435, 1997.Google Scholar
  22. 22.
    M. Nilsson. Regular Model Checking. PhD thesis, Department of Information Technology, Uppsala University, 2000.Google Scholar
  23. 23.
    A. Pnueli and E. Shahar. Liveness and Acceleration in Parameterized Verification. In Proc. CAV’00, LNCS 1855, pp. 328–343, 2000.Google Scholar
  24. 24.
    M. Rusinowitch and L. Vigneron. Automated Deduction with Associative and Commutative Operators. Applicable Algebra in Engineering, Communication and Computing, 6:23–56, 1995.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Marco Bozzano
    • 1
  • Giorgio Delzanno
    • 1
  1. 1.Dipartimento di Informatica e Scienze dell’InformazioneUniversità di GenovaGenovaItaly

Personalised recommendations