Abstract
We investigate a technique, suitable for process algebraic, finite-state machine (model-checking) automated tools, for formally modelling arbitrary network topologies. We model aspects of a protocol for multiservice networks, and demonstrate how the technique can be used to verify end-to-end properties of protocols designed for arbitrary numbers of intermediate nodes. Our models are presented in a version of CSP allowing automatic verification with the FDR software tool. They encompass both inductive and non-inductive behaviours.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work was supported by in part by the US Office of Naval Research. Technical staff at Formal Systems (Europe) Ltd provided valuable advice on the use of FDR.
Preview
Unable to display preview. Download preview PDF.
References
D Barnard and Simon Crosby, The Specification and Verification of an Experimental ATM Signalling Protocol, Proc. IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV, Dembrinski and Sredniawa, eds, Warsaw, Poland, June 1995, Chapman Hall.
R Butler. A CSP Approach to Action Systems, DPhil Thesis, Oxford U., 1992.
R Braden, L Zhang, S. Berson, S. Herzog and S. Jamin. Resource reSerVation Protocol (RSVP), Ver. 1, Functional Spec. Internet Draft, IETF 1996.
E Clarke, O Grumberg and S Jha, Verifying parameterized networks using abstraction and regular languages, Proc. CONCUR’95, LNCS 962, Springer 1995.
S Creese, An inductive technique for modelling arbitrarily configured networks, MSc Thesis, Oxford U., 1997.
SJ Creese and AW Roscoe, Verifying an infinite family of inductions simultaneously using data independence and FDR, (Submitted).
J Davies, Specification and Proof in Real-time Systems, D.Phil Thesis, Oxford U., 1991.
Formal Systems (Europe) Ltd. Failures Divergence Refinement. User Manual and Tutorial, version 2.11.
Estelle Specifications, ftp://louie.udel.edu/pub/grope/estelle-specs
J Guttman and D Johnson, Three Applications of Formal Methods at MITRE, Formal Methods Europe, LNCS873, Naftolin, Denfir, Barcelona ’94.
R Groz, M Phalippou, 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
CAR Hoare. Communicating Sequential Processes. Prentice-Hall 1985.
ISO Rec. 9074, The Extended State Transition Language (Estelle), 1989.
ISO: Information Processing System—Open System Interconnection—LOTOS—A Formal Description Technique based on Temporal Ordering of Observational Behavior, IS8807, 1988.
DM Jackson. Experiences in Embedded Scheduling. Formal Methods Europe, Oxford, 1996.
M Jmail, An Algebraic-temporal Specification of CSMA/CD Protocol, Proc. IFIP WG6.1 Inter. Sym. on Protocol Spec., Testing and Verification XV, Dembrinski and Sredniawa, eds, Warsaw Poland, June ’95, Chapman Hall.
A Kay and JN Reed. A Rely and Guarantee Method for TCSP, A Specification and Design of a Telephone Exchange. IEEE TSE. 19,6 1993, pp 625–629.
RP Kurshan and M McMillan, A structural induction theorem for processes, Proc. 8th Symposium on Principles of Distributed Computing, 1989.
G Leon, J Yelmo, C Sanchez, F Carrasco and J Gil, An Industrial Experience on LOTOS-based Prototyping for Switching Systems Design, Formal Methods Europe, LNCS 670, Woodcock and Larsen, eds., Odense Denmark, ’93.
J Navarro and P Martin, Experience in the Development of an ISDN Layer 3 Service in LOTOS, Proc. Formal Description Techniques III, J Quemada, JA Manas, E Vazquez, eds, North-Holland, 1990.
K Paliwoda and JW Sanders. An Incremental Specification of the Sliding-window Protocol. Distributed Computing. May 1991, pp 83–94.
J Reed, D Jackson, B Deianov and G Reed, Automated Formal Analysis of Networks: FDR Models of Arbitrary Topologies and Flow-Control Mechanisms, ETAPS-FASE98 Fund. Approaches to Soft. Eng., Lisbon, LNCS 1382 Mar ’98.
AW Roscoe, PHB Gardiner, MH Goldsmith, JR Hulance, DM Jackson, JB Scattergood. H ierarchical compression for model-checking CSP or How to check 1020 dining philosphers for deadlock, Springer LNCS 1019.
GM Reed and AW Roscoe, A timed model for comounicating sequential processes, Proceedings of ICALP’86, Springer LNCS 226 (1986), 314–323; Theoretical Computer Science 58, 249–261.
AW Roscoe, Theory and Practice of Concurrency, Prentice Hall, 1998.
B Scattergood, Tools for CSP and Timed CSP, D.Phil Thesis, Oxford U., 1998.
N Shankar, Machine-Assisted Verification Usin Automated Theorem Proving and Model Checking, Math. Prog. Methodology, ed M Broy.
K Sidle, Pi Bus, Formal Methods Europe, Barcelona, 1993.
J Sinclair, Action Systems, Determinism, and the Development of Secure Systems, PHd Thesis, Open University, 1997.
AS Tanenbaum. Computer Networks. 3rd edition. Prentice-Hall 1996.
J Davies, D Jackson, G Reed, J Reed, A Roscoe, and S Schneider, Timed CSP: Theory and practice. Proc. REX Workshop, Nijmegen, LNCS 600, Springer, ’92.
JS Turner. New Directions in Communications (or Which Way to the Information Age). IEEE Commun. Magazine. vol 24, pp 8–15, Oct 1986.
P Wolper and V Lovinfosse, Verifying properties of large sets of processes with network invariants, Proc. International Workshop on Automatic Verification Methods for Finite-State Machines, LNCS 407, Springer-Verlaag, 1989.
LOTOS Bibliography, http://www.cs.stir.ac.uk/kjt/research/well/bib.html
L Zhang, S Deering, D Estrin, S Shenker and D. Zappala. RSVP: A New Resource ReSerVation Protocol. IEEE Network, September 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag
About this paper
Cite this paper
Creese, S.J., Reed, J. (1999). Verifying end-to-end protocols using induction with CSP/FDR. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0098006
Download citation
DOI: https://doi.org/10.1007/BFb0098006
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65831-3
Online ISBN: 978-3-540-48932-0
eBook Packages: Springer Book Archive