| Alternate document: Details Verifying an infinite family of inductions simultaneously using data independence and FDR (99) S.J. Creese, A.W. Roscoe |
S.J. Creese, Joy Reed  Home/Search
Context Related
| comlab.ox.ac.uk/oucl/res...inlncs.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: web.comlab.ox.ac.u...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Context of citations to this paper: More
.... and check relevant properties automatically using the FDR model checker, perhaps with various induction techniques (for example [CR99]) and data independence techniques (for example [Ros98,RL96] for transcending bounded state. A signi cant disadvantage of using Action...
.... and check relevant properties automatically using the FDR model checker, perhaps with various induction techniques (for example [9,10]) and data independence techniques (for example [21,22] for transcending bounded state. A signi cant disadvantage of using Action...
Cited by: More
Using CSP to Model and Analyze Transmission Control Protocol .. - Shahriari, Jalili (2004) (Correct)
Specification and verification of selected intrusion.. - Creese, (eds.) (2003) (Correct)
Malicious- and Accidental-Fault Tolerance for Internet.. - Powell, (eds.) (Correct)
Similar documents (at the sentence level):
11.3%: Automated Formal Analysis of Networks: FDR Models of.. - Reed, Jackson.. (1998) (Correct)
Active bibliography (related documents): More All
1.8: Deductive Reasoning versus Model Checking: Two Formal.. - Reed, Sinclair, Guigand (1999) (Correct)
0.4: Formal Verification of Arbitrary Network Topologies - Creese, Roscoe (1999) (Correct)
0.3: Parameterized Verification with Automatically Computed Inductive.. - Ruah (2001) (Correct)
Similar documents based on text: More All
0.5: Deadlock Checker User Guide and Technical Manual - Martin (1995) (Correct)
0.3: Verifying an infinite family of inductions simultaneously.. - Creese, Roscoe (Correct)
0.3: Compositional Verification of a Network of CSP Processes: using.. - Burton (Correct)
Related documents from co-citation: More All
9: Communicating Sequential Processes (context) - Hoare - 1985
8: The Theory and Practice of Concurrency (context) - Roscoe - 1997
5: Automated Formal Analysis of Networks: FDR Models of Arbitrary Topologies and Fl.. - Reed, Jackson et al. - 1998
BibTeX entry: (Update)
S.J. Creese and J. Reed, Verifying End-to-End Protocols Using Induction with CSP/FDR, Paper accepted for presentation at FMPPTA'99, Puerto Rico, April 1999. http://citeseer.ist.psu.edu/creese99verifying.html More
@inproceedings{ creese99verifying,
author = "S. J. Creese and Joy N. Reed",
title = "Verifying End-to-End Protocols using Induction with {CSP}/{FDR}",
booktitle = "{IPPS}/{SPDP} Workshops",
pages = "1243--1257",
year = "1999",
url = "citeseer.ist.psu.edu/creese99verifying.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985
733 RSVP: A New Resource ReSerVation Protocol - Zhang, Deering et al. - 1993
624 Computer Networks (context) - Tanenbaum - 1996
195 Theory and Practice of Concurrency (context) - Roscoe - 1998
126 A timed model for communicating sequential processes (context) - Reed, Roscoe - 1986
90 or Which Way to the Information Age (context) - Turner, in - 1986
87 Verifying properties of large sets of processes with network.. (context) - Wolper, Lovinfosse - 1989
72 Resource reSerVation Protocol (context) - Braden, Zhang et al. - 1996
54 Verifying parameterized networks using abstraction and regul.. - Clarke, Grumberg et al. - 1995
20 Failures Divergence Refinement (context) - Systems, Ltd
20 Specification and Proof in Real-time Systems (context) - Davies - 1991
12 Timed CSP: Theory and practice (context) - Davies, Jackson et al.
11 An Incremental Specification of the Slidingwindow Protocol (context) - Paliwoda, Sanders - 1991
9 Automated Formal Analysis of Networks: FDR Models of Arbitra.. - Reed, Jackson et al.
8 Tools for CSP and Timed CSP (context) - Scattergood - 1998
5 Experiences in Embedded Scheduling (context) - Jackson - 1996
5 Three Applications of Formal Methods at MITRE (context) - Guttman, Johnson
4 The Extended State Transition Language (context) - Rec - 1989
3 A Specification and Design of a Telephone Exchange (context) - Kay, Reed et al. - 1993
3 estelle-specs (context) - Specifications, louie et al.
3 Verifying an infinite family of inductions simultaneously us.. - Creese, Roscoe
3 Experience in the Development of an ISDN Layer 3 Service in .. (context) - Navarro, Martin - 1990
3 and the Development of Secure Systems (context) - Sinclair, Systems - 1997
2 ierarchical compression for model-checking CSP or How to che.. (context) - Roscoe, Gardiner et al.
2 Specification of the ISDN Linc Access Protocol for D-channel (context) - Groz, Phalippou et al.
2 An inductive technique for modelling arbitrarily configured .. (context) - Creese - 1997
2 A CSP Approach to Action Sysems (context) - Butler - 1992
2 An Industrial Experience on LOTOS-based Prototyping for Swit.. (context) - Leon, Yelmo et al.
2 Formal Methods Europe (context) - Sidle, Bus - 1993
2 An Algebraic-temporal Specification of CSMA/CD Protocol (context) - Jmail
2 The Specification and Verification of an Experimental ATM Si.. (context) - Barnard, Crosby - 1995
1 on theorem for processes, Proc. 8th Symposium on Principles .. (context) - Kurshan, McMillan et al. - 1989
1 Machine-Assisted Verification Usin Automated Theorem Proving.. (context) - Shankar
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://web.comlab.ox.ac.uk/oucl/research/areas/concurrency/publications.html): More
Verifying Determinism of Concurrent Systems Which Use.. - Lazic, Roscoe (1998) (Correct)
Formal Verification of Arbitrary Network Topologies - Creese, Roscoe (1999) (Correct)
Data Independence with Generalised Predicate Symbols - Lazic, Roscoe (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC