| Publication | Date of Publication | Type |
|---|
Optimally-fair exchange of secrets via delay encryption and commutative blinding
| 2024-07-17 | Paper |
Optimally-fair multi-party exchange without trusted parties
| 2024-06-05 | Paper |
The consensus machine: formalising consensus in the presence of malign agents
| 2024-02-28 | Paper |
Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
| 2023-04-13 | Paper |
Unbounded nondeterminism in CSP
Lecture Notes in Computer Science | 2023-04-12 | Paper |
Checking static properties using conservative SAT approximations for reachability
Lecture Notes in Computer Science | 2022-11-04 | Paper |
CSP: A Practical Process Algebra
Theories of Programming | 2022-02-14 | Paper |
Non-interference through determinism
| 2021-12-20 | Paper |
The automatic detection of token structures and invariants using SAT checking
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
Translating between models of concurrency
Acta Informatica | 2020-05-26 | Paper |
Key agreement via protocols
| 2020-03-03 | Paper |
Tighter reachability criteria for deadlock-freedom analysis
| 2020-01-03 | Paper |
Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
Formal Aspects of Computing | 2019-06-03 | Paper |
Process algebra and model checking
Handbook of Model Checking | 2018-07-20 | Paper |
Reducing complex CSP models to traces via priority
| 2018-04-23 | Paper |
Computing maximal weak and other bisimulations
Formal Aspects of Computing | 2017-02-14 | Paper |
The expressiveness of CSP with priority
| 2016-12-16 | Paper |
Rigorous development of component-based systems using component metadata and patterns
Formal Aspects of Computing | 2016-10-28 | Paper |
Confluence thanks to extensional determinism
Electronic Notes in Theoretical Computer Science | 2015-07-10 | Paper |
FDR3 -- a modern refinement checker for CSP
Tools and Algorithms for the Construction and Analysis of Systems | 2015-02-10 | Paper |
Machine-verifiable responsiveness
| 2013-12-04 | Paper |
On the relationship between web services security and traditional protocols
| 2013-10-08 | Paper |
A static analysis framework for livelock freedom in CSP
Logical Methods in Computer Science | 2013-09-26 | Paper |
Slow abstraction via priority
Theories of Programming and Formal Methods | 2013-08-16 | Paper |
Checking noninterference in timed CSP
Formal Aspects of Computing | 2013-03-22 | Paper |
Short-output universal hash functions and their use in fast and secure data authentication
Fast Software Encryption | 2013-01-08 | Paper |
SAT-solving in CSP trace refinement
Science of Computer Programming | 2012-07-20 | Paper |
Static Livelock Analysis in CSP
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
CSP is expressive enough for \(\pi\)
Reflections on the Work of C.A.R. Hoare | 2010-10-26 | Paper |
Insight, inspiration and collaboration
Reflections on the Work of C.A.R. Hoare | 2010-10-26 | Paper |
Understanding concurrent systems
Texts in Computer Science | 2010-03-10 | Paper |
Local search in model checking
Automated Technology for Verification and Analysis | 2009-12-01 | Paper |
Integrated Formal Methods
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Revivals, stuckness and the hierarchy of CSP models
The Journal of Logic and Algebraic Programming | 2009-03-20 | Paper |
Nets with Tokens Which Carry Data
Petri Nets and Other Models of Concurrency – ICATPN 2007 | 2009-03-11 | Paper |
Nets with tokens which carry data
| 2009-02-12 | Paper |
The Three Platonic Models of Divergence-Strict CSP
Theoretical Aspects of Computing - ICTAC 2008 | 2009-01-27 | Paper |
Authenticating ad hoc networks by comparison of short digests
Information and Computation | 2008-04-16 | Paper |
Responsiveness and stable revivals
Formal Aspects of Computing | 2007-09-06 | Paper |
On the expressive power of CSP refinement
Formal Aspects of Computing | 2005-12-13 | Paper |
Communicating Sequential Processes. The First 25 Years
Lecture Notes in Computer Science | 2005-11-29 | Paper |
Communicating Sequential Processes. The First 25 Years
Lecture Notes in Computer Science | 2005-11-29 | Paper |
On model checking data-independent systems with arrays without reset
Theory and Practice of Logic Programming | 2005-04-15 | Paper |
Responsiveness of interoperating components
Formal Aspects of Computing | 2005-02-24 | Paper |
scientific article; zbMATH DE number 1418468 (Why is no real title available?)
| 2000-03-19 | Paper |
The timed failures -- Stability model for CSP
Theoretical Computer Science | 1999-01-12 | Paper |
scientific article; zbMATH DE number 1107504 (Why is no real title available?)
| 1998-01-21 | Paper |
Fixed points without completeness
Theoretical Computer Science | 1997-02-28 | Paper |
Unbounded Non-determinism in CSP
Journal Of Logic And Computation | 1994-11-29 | Paper |
An Alternative Order for the Failures Model
Journal Of Logic And Computation | 1993-06-29 | Paper |
Concepts of digital topology
Topology and its Applications | 1993-04-01 | Paper |
Acyclic monotone normality
Topology and its Applications | 1993-04-01 | Paper |
A lattice of conditions on topological spaces II
Fundamenta Mathematicae | 1992-06-27 | Paper |
scientific article; zbMATH DE number 17695 (Why is no real title available?)
| 1992-06-26 | Paper |
Star covering properties
Topology and its Applications | 1992-06-25 | Paper |
Deadlock analysis in networks of communicating processes
Distributed Computing | 1991-01-01 | Paper |
A timed model for communicating sequential processes
Theoretical Computer Science | 1988-01-01 | Paper |
The laws of Occam programming
Theoretical Computer Science | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4050970 (Why is no real title available?)
| 1988-01-01 | Paper |
The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
SIAM Journal on Computing | 1988-01-01 | Paper |
Laws of programming
Communications of the ACM | 1987-01-01 | Paper |
The pursuit of deadlock freedom
Information and Computation | 1987-01-01 | Paper |
Corrigenda: laws of programming
Communications of the ACM | 1987-01-01 | Paper |
scientific article; zbMATH DE number 3956423 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3902016 (Why is no real title available?)
| 1985-01-01 | Paper |
A Lattice of Conditions on Topological Spaces
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3926230 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3902017 (Why is no real title available?)
| 1985-01-01 | Paper |
Characterizations of Simply-Connected Finite Polyhedra in 3-Space
Bulletin of the London Mathematical Society | 1985-01-01 | Paper |
A theory of binary digital pictures
Computer Vision, Graphics, and Image Processing | 1985-01-01 | Paper |
Continuous analogs of axiomatized digital surfaces
Computer Vision, Graphics, and Image Processing | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3958214 (Why is no real title available?)
| 1985-01-01 | Paper |
A Theory of Communicating Sequential Processes
Journal of the ACM | 1984-01-01 | Paper |
Criteria for Metrisability
| 1984-01-01 | Paper |
