#### Filter Results:

- Full text PDF available (106)

#### Publication Year

1983

2017

- This year (3)
- Last 5 years (25)
- Last 10 years (67)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- A. W. Roscoe
- 2005

ion is another important idea of which we will see much more later, especially Chapter 12. (End of example)

- Stephen D. Brookes, C. A. R. Hoare, A. W. Roscoe
- J. ACM
- 1984

A mathematical model for communicating sequential processes isgiven, and a number of its interesting and useful properties arestated and proved. The possibilities of nondetermimsm are fullytaken into account.

- A. W. Roscoe
- Texts in Computer Science
- 2010

- George M. Reed, A. W. Roscoe
- ICALP
- 1986

The parallel language CSP [9], an earlier version of which was described in [7], has become a major tool for the analysis of structuring methods and proof systems involving parallelism. The significance of CSP is in the elegance by which a few simply stated constructs (e.g., sequential and parallel composition, nondeterministic choice, concealment, andâ€¦ (More)

- Steve A. Schneider, Jim Davies, D. M. Jackson, George M. Reed, Joy N. Reed, A. W. Roscoe
- REX Workshop
- 1991

- Stephen D. Brookes, A. W. Roscoe
- Seminar on Concurrency
- 1984

We extend the failures inode] of communicating processes to allow' a more satisfactory treatment of divergence in addition to deadlock. The relationship between the revised model and the old model is discussed, and we make some connections with various models proposed by other authors. 1 . In troduct ion . The papers [3,4] introduced the failure sets modelâ€¦ (More)

- A. W. Roscoe
- IEEE Symposium on Security and Privacy
- 1995

We show how a variety of confidentiality properties can be expressed in terms of the abstraction mechanisms that CSP provides. We argue that determinism of the abstracted low-security viewpoint provides the best type of property. By changing the form of abstraction mechanism we are able to model different assumptions about how systems behave, includingâ€¦ (More)

We study data nets, a generalisation of Petri nets in which tokens carry data from linearlyordered infinite domains and in which whole-place operations such as resets and transfers are possible. Data nets subsume several known classes of infinite-state systems, including multiset rewriting systems and polymorphic systems with arrays. We show thatâ€¦ (More)

- A. W. Roscoe
- CSFW
- 1995

We discuss the issues involved in modelling and verifying key-exchange protocols within the framework of CSP and its model-checking tool FDR. Expressing such protocols within a process algebra forces careful consideration of exception handling, and makes it natural to consider the closely connected issues of commitment and no-loss-of service. We argue thatâ€¦ (More)

FDR3 is a complete rewrite of the CSP refinement checker FDR2, incorporating a significant number of enhancements. In this paper we describe the operation of FDR3 at a high level and then give a detailed description of several of its more important innovations. This includes the new multi-core refinement-checking algorithm that is able to achieve a nearâ€¦ (More)