Skip to main content
SpringerLink
Log in

An automata-theoretic approach to protocol verification

  • Invited Papers
  • Conference paper
  • First Online:
Book cover CONCURRENCY 88 (CONCURRENCY 1988)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. Proc. 26th IEEE Symp. on Foundations of Computer Science, Portland, 1985, pp. 327–338.

    Google Scholar 

  2. Vardi, M.Y.: Verification of concurrent programs — the automata-theoretic framework. Proc. 2nd IEEE Symp. on Logic in Computer Science, Ithaca, 1987, pp. 167–176.

    Google Scholar 

  3. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. Proc. IEEE Symp. on Logic in Computer Science, Cambridge, 1986, pp. 332–344.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Almaden Research K53-802, 650 Harry Rd., 95120-6099, San Jose, CA, USA

    Moshe Y. Vardi

Authors
  1. Moshe Y. Vardi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frederich H. Vogt

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vardi, M.Y. (1988). An automata-theoretic approach to protocol verification. In: Vogt, F.H. (eds) CONCURRENCY 88. CONCURRENCY 1988. Lecture Notes in Computer Science, vol 335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50403-6_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-50403-6_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50403-0

  • Online ISBN: 978-3-540-45999-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation