S. J. Creese, A. W. Roscoe  Home/Search
Context Related
| comlab.ox.ac.uk/oucl/rese...vegas.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 show how data independence results can be used to generalise an inductive proof from binary to arbitrary branching tree networks. The example used is modelled on the RSVP Resource Reservation Protocol. Of particular interest is the need for a separate lower-level induction which is itself closely tied to data independence. The inductions combine the use of the process algebra CSP to model systems and their specifications, and the FDR tool to discharge the various proof obligations. (Update)
Similar documents based on text: More All
0.4: Internalising agents in CSP protocol models - Broadfoot, Roscoe (2002) (Correct)
0.3: Verifying an infinite family of inductions simultaneously.. - Creese, Roscoe (Correct)
0.3: Verifying an infinite family of inductions simultaneously.. - Creese, Roscoe (1999) (Correct)
Related documents from co-citation: More All
2: Data independent induction over structured networks - Creese, Roscoe - 2000
BibTeX entry: (Update)
S.J. Creese and A.W. Roscoe. Formal verification of arbitrary network topologies. In Proc. of the Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA'99). CSREA Press, 1999. http://citeseer.ist.psu.edu/creese99formal.html More
@inproceedings{ creese99formal,
author = "S. Creese and A. Roscoe",
title = "Formal verification of arbitrary network topologies",
booktitle = "Proc. of the Int. Conf. on Parallel and Distributed Processing Techniques
and Applications (PDPTA'99)",
publisher = "CSREA Press",
year = "1999",
url = "citeseer.ist.psu.edu/creese99formal.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985
195 The theory and practice of concurrency (context) - Roscoe - 1998
116 A Structural Induction Theorem for Processes (context) - Kurshan, McMillan - 1989
96 Expressing interesting properties of programs in proposition.. (context) - Wolper - 1986
87 Verifying Properties of Large Sets of Processes with Network.. (context) - Wolper, Lovinfosse - 1989
27 A semantic study of data-independence with applications to t.. (context) - Lazi'c - 1999
22 Formal Systems (context) - Refinement, User - 1992
15 Verifying Determinism of Concurrent Systems Which Use Unboun.. (context) - Lazi'c, Roscoe - 1998
10 Verifying End-to-End Protocols Using Induction with CSP/FDR - Creese, Reed - 1999
9 Automated Formal Analysis of Networks: FDR Models of Arbitra.. - Reed, Jackson et al. - 1998
5 An Inductive Technique for FDR (context) - Creese - 1997
3 Verifying an infinite family of inductions simultaneously us.. - Creese, Roscoe
3 Oxford University Computing Laboratory Technical Report (context) - Creese, Roscoe
3 Data independence with predicate symbols (context) - Lazi'c, Roscoe
Documents on the same site (http://web.comlab.ox.ac.uk/oucl/research/areas/concurrency/publications.html): More
Verifying End-to-End Protocols Using Induction with CSP/FDR - Creese, Reed (1999) (Correct)
Verifying Determinism of Concurrent Systems Which Use.. - Lazic, Roscoe (1998) (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