2011 - Member of Academia Europaea
2011 - Fellow of the Royal Academy of Engineering (UK)
A. W. Roscoe focuses on Theoretical computer science, Communicating sequential processes, Programming language, Model checking and Deadlock. His specific area of interest is Theoretical computer science, where A. W. Roscoe studies Process calculus. His JCSP study in the realm of Communicating sequential processes interacts with subjects such as Algebra of Communicating Processes and Notation.
His work on Concurrency, Operational semantics and GRASP is typically connected to Semantic theory of truth as part of general Programming language study, connecting several disciplines of science. A. W. Roscoe combines subjects such as Distributed computing, Key exchange, Formal specification, Formal verification and Exception handling with his study of Model checking. His Deadlock course of study focuses on Parallel language and Recursion and Nondeterministic algorithm.
His scientific interests lie mostly in Theoretical computer science, Programming language, Model checking, Concurrency and Algorithm. His Theoretical computer science research incorporates elements of Range, Semantics, Deadlock and Communicating sequential processes. He has researched Communicating sequential processes in several fields, including Bounded function and Nondeterministic algorithm.
His work in the fields of Compiler, Mutual exclusion and Software development overlaps with other areas such as Notation. His research in Model checking intersects with topics in Decidability, Data independence, Set, Type and Static analysis. His Concurrency study combines topics in areas such as Discrete mathematics and Mathematical proof.
Theoretical computer science, Programming language, Model checking, Algorithm and Deadlock are his primary areas of study. A. W. Roscoe does research in Theoretical computer science, focusing on Process calculus specifically. In general Programming language, his work in Communicating sequential processes and Solidity is often linked to TRACE linking many areas of study.
His research integrates issues of Representation and Bounded function in his study of Model checking. His study in Algorithm is interdisciplinary in nature, drawing from both Construct, Supercomputer, Cloud computing and Divergence. His work deals with themes such as Metadata, Series and Reachability, which intersect with Deadlock.
The scientist’s investigation covers issues in Theoretical computer science, Model checking, Algorithm, Process calculus and Programming language. The Theoretical computer science study combines topics in areas such as Cryptographic hash function, Hash chain, Deadlock analysis, Range and Deadlock. His studies deal with areas such as Bounded function and Static analysis as well as Model checking.
His Bounded function research incorporates themes from Operational semantics, Communicating sequential processes, Development and Concurrency. His work carried out in the field of Process calculus brings together such families of science as Compiler and Scale. His Programming language research is multidisciplinary, incorporating perspectives in Time complexity and Metadata.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
The Theory and Practice of Concurrency
A. W. Roscoe.
A Theory of Communicating Sequential Processes
S. D. Brookes;C. A. R. Hoare;A. W. Roscoe.
Journal of the ACM (1984)
Laws of programming
C. A. R. Hoare;I. J. Hayes;He Jifeng;C. C. Morgan.
Communications of The ACM (1987)
Understanding Concurrent Systems
A. W. Roscoe.
A classical mind (1994)
A timed model for communicating sequential processes
G. M. Reed;A. W. Roscoe.
Theoretical Computer Science (1988)
An Improved Failures Model for Communicating Processes
Stephen D. Brookes;A. W. Roscoe.
international conference on concurrency theory (1984)
The laws of Occam programming
A. W. Roscoe;C. A. R. Hoare.
CSP and determinism in security modelling
ieee symposium on security and privacy (1995)
FDR3 — A Modern Refinement Checker for CSP
Thomas Gibson-Robinson;Philip Armstrong;Alexandre Boulgakov;Andrew W. Roscoe.
tools and algorithms for construction and analysis of systems (2014)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: