Skip to main content
SpringerLink
Log in

Automated Formal Analysis of Networks

  • Chapter
Dependable Network Computing

Part of the book series: The Springer International Series in Engineering and Computer Science ((SECS,volume 538))

  • 87 Accesses

Abstract

We present new techniques for process algebraic, finite-state methods to formally analyse unbounded topologies and control-flow schemes for high-speed networks. A novel induction technique is described which can be used to verify end-to-end properties of certain arbitrarily configured networks. Additionally a formal model of an algorithm for regulating burstiness of network traffic is presented which incorporates discrete timing constraints. Our models are presented in CSP with automatic verification by the FDR model checker.

*

This work was supported by the US Office of Naval Research and a research grant from Oxford Brookes University. Technical staff at Formal Systems (Europe) Ltd provided valuable advice on the use of FDR.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ISO Recommendation 8807. Information processing system — open system interconnection — LOTOS — a formal description technique based on temporal ordering of observational behaviour, 1988.

    Google Scholar 

  2. ISO 9074. The extended state transition language (Estelle), 1989.

    Google Scholar 

  3. D. Barnard and Simon Crosby. The specification and verification of an experimental atm signalling protocol. In Dembrin-ski and Sredniawa, editors, Proc. IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV, Warsaw, Poland, June 1995. Chapman Hall.

    Google Scholar 

  4. M.J. Butler. A CSP Approach to Action Systems. DPhil thesis, University of Oxford, 1992.

    Google Scholar 

  5. R. Braden, L. Zhang, S. Berson, S. Herzog, and S. Jamin. Resource reservation protocol (rsvp) — version 1, functional specification. Internet Draft, Internet Engineering Task Force, 1996.

    Google Scholar 

  6. E.M. Clark, O. Grumberg, and S. Jha. Verfying parameterized networks using abstraction and regular languages. In Proceedings of CONCUR ′95, LNCS 962. Springer-Verlag, 1995.

    Google Scholar 

  7. S. Creese and J. Reed. Verifying end-to-end protocols using induction with CSP/FDR. In Proc of FMPPTA′99, LNCS 1586. Springer-Verlag, 1999.

    Google Scholar 

  8. S. Creese and A. W. Roscoe. Formal verification of arbitrary network topologies. In Proc of PDPTA′99. CSREA Press, 1999.

    Google Scholar 

  9. Sadie Creese. An inductive technique for modelling arbitrarily configured networks. Msc thesis, University of Oxford, 1997.

    Google Scholar 

  10. J. Davies. Specification and Proof in Real-time Systems. DPhil thesis, University of Oxford, 1991.

    Google Scholar 

  11. D. Dill. The Murø verification system. In Rajeev Alur and Thomas A Henzinger, editors, Computer-Aided Verification, CAV96, LNCS 1102, pages 390–393. Springer-Verlag, 1996.

    Google Scholar 

  12. J. Davies, D.M. Jackson, G.M. Reed, J.N. Reed, A.W. Roscoe, and S.A. Schneider. Timed CSP: Theory and practice. In Proceedings of REX Workshop, LNCS 600, Nijmegen, 1992. Springer-Verlag.

    Google Scholar 

  13. Formal Systems (Europe) Ltd. Failures Divergence Refinement. User Manual and Tutorial, version 2.11.

    Google Scholar 

  14. J.D. Guttman and D.M. Johnson. Three applications of formal methods at mitre. In T Denfir M Naftolin, editor, Formal Methods Europe, LNCS 873, Baxcelona, 1994. Springer-Verlag.

    Google Scholar 

  15. R. Groz, M. Phalippou, and M. Brossard. Specification of the isdn linc access protocol for d-channel (lapd), ccitt recommendation q.921. ftp://louie.udel.edu/pub/grope/estelle-specs/lapd.e.

  16. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.

    Google Scholar 

  17. G. Holzmann and D. Peled. The state of SPIN. In Rajeev Alur and Thomas A Henzinger, editors, Computer-Aided Verification, CAV96, LNCS 1102, pages 385–389. Springer-Verlag, 1996.

    Google Scholar 

  18. Internet. Estelle specs, ftp://louie.udel.edu/pub/grope/estelle-specs.

    Google Scholar 

  19. Internet. Lotos bib. http://www.cs.stir.ac.uk/kjt/research/well/bib.html.

    Google Scholar 

  20. D.M. Jackson. Experiences in embedded scheduling. In Formal Methods Europe, Oxford, 1996.

    Google Scholar 

  21. M. Jmail. An algebraic-temporal specification of a csma/cd protocol. In Dembrinski and Sredniawa, editors, Proc. IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV, Warsaw, Poland, June 1995. Chapman Hall.

    Google Scholar 

  22. R.P. Kurshan and M. McMillan. A structural induction theorem for processes. Proceedings of the Eight ACM Symposium on Princples of Distributed Computing, 1989.

    Google Scholar 

  23. A. Kay and J.N. Reed. A rely and guarantee method for TCSP, a specification and design of a telephone exchange. IEEE Trans. Soft. Eng., 19(6):625–629, June 1993.

    Article  Google Scholar 

  24. G. Leon, J.C. Yelmo, C. Sanchez, F.J. Carrasco, and J.J. Gil. An industrial experience on lotos-based prototyping for switching systems design. In JCP Woodcock and DG Larsen, editors, Formal Methods Europe, LNCS 670, Odense, Denmark, 1993. Springer-Verlag.

    Google Scholar 

  25. Zohar Manna et al. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Rajiv Alur and Thomas A Henzinger, editors, CAV96, LNCS 1102, pages 415–418. Springer-Verlag, 1996.

    Google Scholar 

  26. J. Navarro and P.S. Martin. Experience in the development of an isdn layer 3 service in lotos. In E Vazquez J Quemada, JA Manas, editor, Proc. Formal Description Techniques III, North-Holland, 1990.

    Google Scholar 

  27. J. Ouaknine and G. M. Reed. Model-checking temporal behaviour in CSP. In Proc of PDPTA ′99. CSREA Press, 1999.

    Google Scholar 

  28. K. Paliwoda and J.W. Sanders. An incremental specification of the sliding-window protocol. Distributed Computing, pages 83–94, May 1991.

    Google Scholar 

  29. A.W. Roscoe, P.H.B. Gardiner, M.H. Goldsmith, J.R. Hu-lance, D.M. Jackson, and J.B. Scattergood. Hierarchical compression for model-checking CSP or how to check 1020 dining philosphers for deadlock. LNCS 1019. Springer-Verlag.

    Google Scholar 

  30. J.N. Reed, D.M. Jackson, B. Deianov, and G.M. Reed. Automated formal analysis of networks: FDR models for arbitrary topologies and flow-control mechanisms. In Proceedings of Joint European Conferences on Theory and Practice of Software, ETAPS98, LNCS 1382. Springer-Verlag, 1998.

    Google Scholar 

  31. A.W. Roscoe. The Theory and Practice of Concurrency. Prentice Hall, 1997.

    Google Scholar 

  32. G.M. Reed and A.W. Roscoe. A timed model for communicating sequential processes. In Proceedings of ICALP′86, LNCS 226, pages 314–323. Springer-Verlag, 1986.

    Google Scholar 

  33. G.M. Reed and A.W. Roscoe. The timed failures-stability model for csp. Theoretical Computer Science, 211:85–127, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  34. J. Reed, J. Sinclar, and F. Guigand. Deductive reasoning versus model checking: Two formal approaches for system development. In Proc of Integrated Formal Methods ′99, 1999.

    Google Scholar 

  35. J. Reed, J. Sinclar, and G. M. Reed. Routing — a challenge to formal methods. In Proc of PDPTA′99. CSREA Press, 1999.

    Google Scholar 

  36. S. Rajan, N. Shankar, and M.K. Srivas. An integration of model-checking with automated proof checking. In CA V′95, LNCS 939, pages 84–97. Springer-Verlag, 1995.

    Google Scholar 

  37. B. Scattergood. Tools for CSP and Timed CSP. DPhil thesis, University of Oxford, (forthcoming 1998).

    Google Scholar 

  38. K. Seidel. Pi bus. In Formal Methods Europe, Barcelona, 1993.

    Google Scholar 

  39. N. Shankar. Machine-assisted verification usin automated theorem proving and model checking. In M Broy, editor, Math. Prog. Methodology.

    Google Scholar 

  40. J. Sinclair. Action Systems, Determinism, and the Development of Secure Systems. PhD thesis, Open University, 1998.

    Google Scholar 

  41. CMU — School of Computer Science Formal Methods-Model Checking. http://www.cs.cmu.edu/ mod-elcheck/modck.html.

    Google Scholar 

  42. A.S. Tanenbaum. Computer Networks. Prentice-Hall, third edition, 1996.

    Google Scholar 

  43. J.S. Turner. New directions in communications (or which way to the information age). IEEE Commun. Magazine, 24:8–15, October 1986.

    Article  Google Scholar 

  44. P. Wolper and V. Lovinfosse. Verfying properties of large sets of processes with network invariants. In Proceedings of the International workshop on Automatic Verification Methods for Finite-State Machines, LNCS 407. Springer-Verlag, 1989.

    Google Scholar 

  45. L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala. Rsvp: A new resource reservation protocol. IEEE Network, September 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Oxford Brookes University, Oxford, UK

    Joy Reed

  2. Praxis Critical Systems, Ltd, Bath, UK

    Dave Jackson

  3. Cornell University, Ithaca, NY, USA

    Borislav Deinov

  4. Oxford University, Oxford, UK

    Mike Reed

Authors
  1. Joy Reed
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dave Jackson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Borislav Deinov
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mike Reed
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Boston University, Boston, MA, USA

    Dimiter R. Avresky

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media New York

About this chapter

Cite this chapter

Reed, J., Jackson, D., Deinov, B., Reed, M. (2000). Automated Formal Analysis of Networks. In: Avresky, D.R. (eds) Dependable Network Computing. The Springer International Series in Engineering and Computer Science, vol 538. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4549-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-4549-1_7

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7053-6

  • Online ISBN: 978-1-4615-4549-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation