Skip to main content

11 Verification

  • Chapter
  • First Online:
Protocol Engineering

Abstract

The protocol verification phase has the task to prove the logical correctness and operation of the protocol design as it is documented in the service and protocol specification. Its goal is to ensure prior to coding that all the specified design requirements are worked out accurately and of course to detect design errors. The protocol design is, strictly speaking, not finalized and the specification not completed, as long as its correctness has not been proven formally. Since the protocol specification forms the basis for various protocol implementations in different execution environments, great importance is attached to the protocol verification to ensure the functional feasibility of the protocol. This is the reason why protocol verification has been established as an independent stage in the protocol development process (cp. Chapter 9). The protocol verification phase, like protocol specification and protocol testing, is one of the most intensively explored stages of the protocol development process. Many approaches have been proposed and investigated. Some of them have contributed successfully to the detection of design errors in real-life protocols [West 89], [Holz 91], [Lai 98], [Gord 00]. In this chapter we give an overview of the most important methods of protocol verification and their fields of application.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 89.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    The service specification itself cannot be verified in this sense, as it is the reference against which the protocol is verified. But, it is possible to verify the consistency of the service specification.

  2. 2.

    The notation used to represent the transition between two states in a labeled transition system is \(S_ \Rightarrow ^\sigma = _{def} \exists s^{\prime}:s_\Rightarrow ^\sigma s^{\prime}.\)

References

  1. Baier, C.; Katoen, J.-P.; Larsen, K.G.: Principles of Model Checking. MIT Press, Cambridge, 2008.

    MATH  Google Scholar 

  2. Bowman, H.; Gomez, R.: Concurrency Theory. Springer, 2006.

    Google Scholar 

  3. Bryant, R. E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers C-35 (1986) 8: 677-691.

    Article  Google Scholar 

  4. CADP toolbox. http://www.inrialpes.fr/vasy/cadp/.

  5. Chow, C.; Gouda, M.G.; Lam, S.S.: A Discipline for Constructing Multiphase Communication Protocols. ACM Transactions on Computer Systems 3 (1985) 4: 315-343.

    Article  Google Scholar 

  6. Clarke, E.; Grumberg, O.; Peled, D.: Model Checking. MIT Press, Cambridge, 2000.

    Google Scholar 

  7. Annual IFIP Working Conference on formal description techniques. In 1996 it was combined with PSTV (Protocol Specification, Testing and Verification). Today it belongs to the DISCOTEC conference series. Proceedings of the FORTE conference cited here are, for instance, [Gotz 96a], [Kim 01] and [Koni 03].

    Google Scholar 

  8. Gordon, S.; Billington, J.: Analysing the WAP Class 2 Wireless Transaction Protocol Using Coloured Petri Nets. In: Nielsen, M; Simpson, D. (eds.): Application and Theory of Petri Nets 2000. LNCS 1825, Springer, pp. 207-226, 2000.

    Google Scholar 

  9. Herrmann, P.; Krumm, H.: A Framework for Modeling Transfer Protocols. Computer Networks 34 (2000) 2: 317-337.

    Article  Google Scholar 

  10. Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice Hall, Englewood Cliffs, 1991.

    Google Scholar 

  11. Holzmann, G.J.: The SPIN Model Checker Primer and Reference Manual. Addi-son-Wesley, Boston, 2004.

    Google Scholar 

  12. ISO, Information Processing Systems - Open Systems Interconnection - LOTOS -A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. IS 8807, 1988.

    Google Scholar 

  13. Krumm, H.: Projections of the Reachability Graph and Environment Models. In: Sifakis, J. (ed.): Automatic Verification Methods for Finite State Systems. LNCS 407, Berlin, 1990.

    Google Scholar 

  14. Lai, R.; Jirachiefpattana, A.: Communication Protocol Specification and Verification. Kluwer, Boston, 1998.

    Book  MATH  Google Scholar 

  15. Lam, S. S.; Shankar, A. U.: Protocol Verification via Projections. IEEE Transactions on Software Engineering 10 (1984) 4, 325-342.

    Article  Google Scholar 

  16. McMillan, K.L.: Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic, Dordrecht, 1993.

    Book  Google Scholar 

  17. Sommerville, I.: Software Engineering. Addison-Wesley, Reading, 2000.

    Google Scholar 

  18. West, C. H.: Protocol Validation in Complex Systems. In: Proceedings of 8th ACM Symposium on Principles of Distributed Computing, Austin, Texas, USA, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hartmut König .

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

König, H. (2012). 11 Verification. In: Protocol Engineering. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29145-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29145-6_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29144-9

  • Online ISBN: 978-3-642-29145-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics