| [ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
S.D. Brookes. A model for communicating sequential processes. D.Phil., Oxford University, 1983.
S.D. Brookes and A.W. Roscoe. An improved failures model for communicating processes. In Proceedings of the Pittsburgh seminar on concurrency LNCS 197, pp281–305.
J.R. Burch, E.M. Clarke, D.L. Dill and L.J. Hwang. Symbolic model checking: 10 20 [10 to the power 20]states and beyond. In Proc. 5th IEEE Annual Symposium on Logic in Computer Science. IEEE Press, 1990.
C.A. Hoare. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, New Jersey, 1985.
L. Jategoankar, A. Meyer and A.W. Roscoe. Separating failures from divergence. In preparation.
G. Lowe. Pravda: A Tool for Verifying Probabilistic Processes. In Proceedings of the Workshop on Process Algebra and Performance Modelling, 1993.
G. Lowe. Casper: A Compiler for the Analysis of Security Protocols. In Proceedings of 10th IEEE Computer Security Foundations Workshop, 1997.
G. Lowe. Specification of communicating processes: temporal logic versus refusals-based refinement In Formal Aspects of Computing, 2008.
On timed models and full abstraction G. Lowe, J. Ouaknine In Proceedings of MFPS 05, ENTCS 155, 2006.
K. Melhorn. Graph Algorithms and NP Completeness. In EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1984.
A.W. Roscoe. Two papers on CSP. Technical Monograph PRG-67, Oxford University Computing Laboratory, 1988.
A.W. Roscoe. Unbounded Nondeterminism in CSP. In [Roscoe88]. Oxford University Programming Research Group, 1988. Also appears in Journal of Logic and Computation 3, 2 pp131–172.
A.W. Roscoe. Topology, computer science and the mathematics of convergence. In Topology and Category Theory in Computer Science (Reed, Roscoe and Wachter, eds). Oxford University Press, 1991.
A.W. Roscoe. Model-Checking CSP. In A Classical Mind, Essays in Honour of C.A.R. Hoare. Prentice-Hall, 1994.
A.W. Roscoe. CSP and determinism in security modelling. In IEEE Symposium on Security and Privacy, 1995.
A.W. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall, 1997.
A.W. Roscoe, et al. Hierarchical compression for model-checking CSP, or How to check 10 20 [10 to the power 20]dining philosophers for deadlock. In Proceedings of TACAS Symposium, Aarhus, Denmark, 1995.
A.W. Roscoe, J.C.P. Woodcock and L. Wulf. Non-interference through Determinism. In European Symposium on Research in Computer Security, volume 875 of Lecture Notes in Computer Science, pp33–53, 1994.
J.N. Reed, A.W. Roscoe, J.E. Sinclair. Responsiveness and stable revivals In Formal Ascpects of Computing volume 19, No 3, August 2007, pp303–319
A.W. Roscoe
Revivals, Stuckness and the Hierarchy of CSP Models
To appear: http://web.comlab.ox.ac.uk//files/1274/revivalspub.pdf
J.B. Scattergood. The Semantics and Implementation of Machine-Readable CSP. D.Phil., Oxford University Computing Laboratory, 1998.
| [ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] |
This document was generated by Phil Armstrong on May 17, 2012 using texi2html 1.82.