Skip to main content
SpringerLink
Log in

Model-Checking and Abstraction to the Aid of Parameterized Systems

  • Conference paper
  • First Online:
Verification, Model Checking, and Abstract Interpretation (VMCAI 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2575))

Abstract

Parameterized systems are systems that involve numerous instantiations of the same finite-state module. Examples of parameterized systems include tele-communication protocols, bus protocols, cache coherence protocols, and many other protocols that underly current state-of-the-art systems. Formal verification of parameterized systems is known to be undecidable [AK86] and thus cannot be automated. Recent research has shown that in many cases it is possible to use abstraction methods to generate a finite-state systems from a parameterized systems. The finite-state system can then be model-checked. If successful, it is possible to conclude that the original parameterized system satisfies its requirements. Otherwise, it is often the case that the counter-example produced by the model checker can indicate an error in the original parameterized system. This combined technique allows for automatic verification of parameterized systems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. K. R. Apt and D. Kozen. Limits for automatic program verification of finite-state concurrent systems. Information Processing Letters, 22(6), 1986.

    Google Scholar 

  2. T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. Zuck. Parameterized verification with automatically computed inductive assertions. In Proc. 13th Intl. Conference on Computer Aided Verification (CAV’01), volume 2102 ofLect. Notes in Comp. Sci., Springer-Verlag, pages 221–234, 2001.

    Google Scholar 

  3. Y. Kesten, A. Pnueli, E. Shahar, and L. Zuck. Network invariants in action. In Proceedings of Concur’02, volume 2421 of LNCS. Springer-Verlag, 2002.

    Google Scholar 

  4. L. Zuck, A. Pnueli, and Y. Kesten. Automatic verification of free choice. In Proc. of the 3rd workshop on Verification, Model Checking, and Abstract Interpretation, volume 2294 of LNCS, 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Weizmann Institute of Science and New York University, USA

    Amir Pnueli

  2. New York University, USA

    Lenore Zuck

Authors
  1. Amir Pnueli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lenore Zuck
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, New York University, 715 Broadway (7th floor), NY 10003, NewYork, USA

    Lenore D. Zuck

  2. College of Computer Science, Northeastern University, 360 Huntington Ave., 02115, Boston, MA, USA

    Paul C. Attie

  3. Computer Science Department, Venice University C’Foscari, Via Torino 155, 30170, Mestre-Venezia, Italy

    Agostino Cortesi

  4. Department of Computer Science and Electrical Engineering, West Virginia University, 26505, Morgantown, WV, USA

    Supratik Mukhopadhyay

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pnueli, A., Zuck, L. (2003). Model-Checking and Abstraction to the Aid of Parameterized Systems. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2003. Lecture Notes in Computer Science, vol 2575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36384-X_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-36384-X_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00348-9

  • Online ISBN: 978-3-540-36384-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation