Analysing Applications Layered on Unilaterally Authenticating Protocols. - Thomas Gibson-Robinson; Gavin Lowe (Formal Aspects in Security and Trust, 2011)

The Meaning and Implementation of SKIP in CSP. - Thomas Gibson-Robinson; Michael Goldsmith (CPA, 2013)

Efficient Simulation of CSP-Like Languages. - Thomas Gibson-Robinson (CPA, 2013)

FDR3: the Future of CSP Model Checking. - Thomas Gibson-Robinson (CPA, 2013)

Using FDR to Model Check CSP-Like Languages. - Thomas Gibson-Robinson (CPA, 2013)

Analysing layered security protocols. - Thomas Gibson-Robinson (2013)

Computing Maximal Bisimulations. - Alexandre Boulgakov; Thomas Gibson-Robinson; A. W. Roscoe 001 (ICFEM, 2014)

Inferring social relationships from technology-level device connections. - Jason R. C. Nurse; Jess Pumphrey; Thomas Gibson-Robinson; Michael Goldsmith; Sadie Creese (PST, 2014)

FDR3 - A Modern Refinement Checker for CSP. - Thomas Gibson-Robinson; Philip J. Armstrong; Alexandre Boulgakov; A. W. Roscoe 001 (TACAS, 2014)

Practical Partial Order Reduction for CSP. - Thomas Gibson-Robinson; Henri Hansen; A. W. Roscoe 001; Xu Wang 001 (NFM, 2015)

Verifying layered security protocols. - Thomas Gibson-Robinson; Allaa Kamil; Gavin Lowe (J. Comput. Secur., 2015)

Tighter Reachability Criteria for Deadlock-Freedom Analysis. - Pedro R. G. Antonino; Thomas Gibson-Robinson; A. W. Roscoe 001 (FM, 2016)

Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving. - Pedro Antonino; Thomas Gibson-Robinson; A. W. Roscoe 001 (IFM, 2016)

Computing maximal weak and other bisimulations. - Alexandre Boulgakov; Thomas Gibson-Robinson; A. W. Roscoe 001 (Formal Aspects Comput., 2016)

Analytics for characterising and measuring the naturalness of online personae. - Jason R. C. Nurse; Arnau Erola; Thomas Gibson-Robinson; Michael Goldsmith; Sadie Creese (Secur. Informatics, 2016)

FDR3: a parallel refinement checker for CSP. - Thomas Gibson-Robinson; Philip J. Armstrong; Alexandre Boulgakov; A. W. Roscoe 001 (Int. J. Softw. Tools Technol. Transf., 2016)

FDR: From Theory to Industrial Application. - Thomas Gibson-Robinson; Guy H. Broadfoot; Gustavo Carvalho; Philippa J. Hopcroft; Gavin Lowe; Sidney C. Nogueira; Colin O'Halloran; Augusto Sampaio 001 (Concurrency, Security, and Puzzles, 2017)

Checking Static Properties Using Conservative SAT Approximations for Reachability. - Pedro Antonino; Thomas Gibson-Robinson; A. W. Roscoe 001 (SBMF, 2017)

The Automatic Detection of Token Structures and Invariants Using SAT Checking. - Pedro R. G. Antonino; Thomas Gibson-Robinson; A. W. Roscoe 001 (TACAS (2), 2017)

Verifying cyber attack properties. - Colin O'Halloran; Thomas Gibson-Robinson; Neil Brock (Sci. Comput. Program., 2017)

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving. - Pedro Antonino; Thomas Gibson-Robinson; A. W. Roscoe 001 (Formal Aspects Comput., 2019)

Symmetry reduction in CSP model checking. - Thomas Gibson-Robinson; Gavin Lowe (Int. J. Softw. Tools Technol. Transf., 2019)

Efficient Verification of Concurrent Systems Using Synchronisation Analysis and SAT/SMT Solving. - Pedro Antonino; Thomas Gibson-Robinson; A. W. Roscoe 001 (ACM Trans. Softw. Eng. Methodol., 2019)

Approximate verification of concurrent systems using token structures and invariants. - Pedro Antonino; Thomas Gibson-Robinson; A. W. Roscoe 001 (Int. J. Softw. Tools Technol. Transf., 2022)