Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A SPIN-based model checker for telecommunication protocols

  • Conference paper
  • First Online:
Model Checking Software (SPIN 2001)

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

Included in the following conference series:

Abstract

Telecommunication protocol standards have in the past and typically still use both an English description of the protocol (sometimes also followed with a behavioural SDL model) and an ASN.1 specification of the data-model, thus likely making the specification incomplete. ASN.1 is an ITU/ISO data definition language which has been developed to describe abstractly the values protocol data units can assume; this is of considerable interest for model checking as subtyping in ASN.1 can be used to constrain/construct the state space of the protocol accurately. However, with current practice, any change to the English description cannot easily be checked for consistency while protocols are being developed. In this work, we have developed a SPIN-based tool called EASN (Enhanced ASN.1) where the behaviour can be formally specified through a language based upon Promela for control structures but with data models from ASN.1. An attempt is also made to use international standards (X/Open std on ASN.1/C++ translation) as available so that the tool can be realised with pluggable components. One major design criterion is to enable incremental computation wherever possible (for example: hash values, consistency between alternate representations of state). We have used EASN to validate a simplified model of RLC (Radio Link Control) in the W-CDMA stack that imports datatypes from its associated ASN.1 model. In this paper, we discuss the motivation and design of the EASN language, the architecture and implementation of the verification tool for EASN and some preliminary performance indicators.

Thanks are due to Nokia Research Center, Helsinki for funding this work under SID project 99033. We thank Ari Ahtiainen and Markku Turunen of NRC for their initial project formulation and some key ideas in the software engineering aspects, Dinesh Shanbhag for helping us understand the ASN.1/C++ standard, and Matti Luukkainen, University of Helsinki, for many suggestions and criticisms.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Holzmann, Gerald J., Doron Peled, “The state of SPIN”, CAV’ 96.

    Google Scholar 

  2. Rob Gerth, Eindhoven University, “Concise Promela Reference”, August 1997, Soft-copy available with SPIN.

    Google Scholar 

  3. G. Gerth, D. Peled, M. Y. Vardi, P. Wolper, “Simple On-the-fly Automatic Verification of Linear Temporal Logic”, PSTV94.

    Google Scholar 

  4. Holzmann, G.J., Design and Validation of Computer Protocols, Prentice Hall, 1992.

    Google Scholar 

  5. Patrice Godefroid, “Partial-Order Methods for the Verification of Concurrent Systems-An Approach to the State-Explosion Problem”, PhD Thesis, University of Liege, Computer Science Department, Nov. ’94.

    Google Scholar 

  6. ASN.1/C++ Application Programming Interface, Part 1: Base Classes & Specific Interface, & Part 2: Generic Interface, NMF 040-1 & 2, Issue 1.0, Feb. 1998

    Google Scholar 

  7. Holzmann, G.J., SPIN Sources, Version 3.4.1, 15th August 2000; “Basic Spin Manual”, available with SPIN.

    Google Scholar 

  8. J. Geldenhuys, PJA de Villiers, ‘Runtime Efficient State Compaction in SPIN’, The 5th Intl SPIN Workshop on Theoretical Aspects of Model Checking.

    Google Scholar 

  9. Anindya Basu, ‘A Language-based Approach to Protocol Construction’, PhD Dissertation, Cornell Univ., Aug. '97

    Google Scholar 

  10. ASN.1/C++ Application Programming Interface, Issue 1.0 Draft 10a-Submission to X/Open August 21, 1996

    Google Scholar 

  11. Appendix A: The ASN.1 language, and Appendix B:The EASN Language, are only in the full paper; available at http://144.16.67.13/~ gopi/spin01/easn.ps.gz.

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shanbhag, V.K., Gopinath, K. (2001). A SPIN-based model checker for telecommunication protocols. In: Dwyer, M. (eds) Model Checking Software. SPIN 2001. Lecture Notes in Computer Science, vol 2057. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45139-0_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45139-0_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42124-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics