| FDR3 — A Modern Refinement Checker for CSP T Gibson-Robinson, P Armstrong, A Boulgakov, AW Roscoe Tools and Algorithms for the Construction and Analysis of Systems, 187-201, 2014 | 358 | 2014 |
| FDR3: a parallel refinement checker for CSP T Gibson-Robinson, P Armstrong, A Boulgakov, AW Roscoe International Journal on Software Tools for Technology Transfer 18 (2), 149-167, 2016 | 69 | 2016 |
| Practical partial order reduction for CSP T Gibson-Robinson, H Hansen, AW Roscoe, X Wang NASA Formal Methods Symposium, 188-203, 2015 | 27 | 2015 |
| Tools for understanding identity S Creese, T Gibson-Robinson, M Goldsmith, D Hodges, D Kim, O Love, ... 2013 IEEE International Conference on Technologies for Homeland Security …, 2013 | 22 | 2013 |
| Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving P Antonino, T Gibson-Robinson, AW Roscoe International Conference on Integrated Formal Methods, 345-360, 2016 | 16 | 2016 |
| Computing maximal weak and other bisimulations A Boulgakov, T Gibson-Robinson, AW Roscoe Formal Aspects of Computing 28 (3), 381-407, 2016 | 16 | 2016 |
| Inferring social relationships from technology-level device connections JRC Nurse, J Pumphrey, T Gibson-Robinson, M Goldsmith, S Creese 2014 Twelfth Annual International Conference on Privacy, Security and Trust …, 2014 | 14 | 2014 |
| Symmetry reduction in CSP model checking T Gibson-Robinson, G Lowe International Journal on Software Tools for Technology Transfer 21 (5), 567-605, 2019 | 10 | 2019 |
| FDR: From Theory to Industrial Application T Gibson-Robinson, G Broadfoot, G Carvalho, P Hopcroft, G Lowe, ... Concurrency, Security, and Puzzles, 65-87, 2017 | 10 | 2017 |
| Tighter reachability criteria for deadlock-freedom analysis P Antonino, T Gibson-Robinson, AW Roscoe FM 2016: Formal Methods: 21st International Symposium, Limassol, Cyprus …, 2016 | 10 | 2016 |
| FDR into the cloud T Gibson-Robinson, AW Roscoe Communicating Process Architectures, 2014 | 10 | 2014 |
| Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving P Antonino, T Gibson-Robinson, AW Roscoe ACM Transactions on Software Engineering and Methodology (TOSEM) 28 (3), 1-43, 2019 | 9 | 2019 |
| The automatic detection of token structures and invariants using SAT checking P Antonino, T Gibson-Robinson, AW Roscoe International Conference on Tools and Algorithms for the Construction and …, 2017 | 8 | 2017 |
| TYGER: a tool for automatically simulating CSP-like languages in CSP T Gibson-Robinson MCompSci Thesis, University of Oxford, 2010 | 7 | 2010 |
| Computing maximal bisimulations A Boulgakov, T Gibson-Robinson, AW Roscoe International Conference on Formal Engineering Methods, 11-26, 2014 | 6 | 2014 |
| Checking Static Properties Using Conservative SAT Approximations for Reachability P Antonino, T Gibson-Robinson, AW Roscoe Brazilian Symposium on Formal Methods, 233-250, 2017 | 5 | 2017 |
| Verifying layered security protocols T Gibson-Robinson, A Kamil, G Lowe Journal of Computer Security 23 (3), 259-307, 2015 | 5 | 2015 |
| Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving P Antonino, T Gibson-Robinson, AW Roscoe Formal Aspects of Computing 31 (3), 375-409, 2019 | 4 | 2019 |
| Analysing applications layered on unilaterally authenticating protocols T Gibson-Robinson, G Lowe International Workshop on Formal Aspects in Security and Trust, 164-181, 2011 | 4 | 2011 |
| Efficient Simulation of CSP-Like Languages. T Gibson-Robinson CPA, 185-204, 2013 | 3 | 2013 |
Bill Roscoe (A.W. Roscoe)Emeritus Professor of Computer Science, Oxford UniversityVerified email at cs.ox.ac.uk