Thomas Gibson-Robinson

Int. J. Softw. Tools Technol. Transf., 2022

2019

Efficient Verification of Concurrent Systems Using Synchronisation Analysis and SAT/SMT Solving.

[BibT_eX]

[DOI]

ACM Trans. Softw. Eng. Methodol., 2019

Symmetry reduction in CSP model checking.

[BibT_eX]

[DOI]

Gavin Lowe

Int. J. Softw. Tools Technol. Transf., 2019

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2019

2017

Verifying cyber attack properties.

[BibT_eX]

[DOI]

Colin O'Halloran

Neil Brock

Sci. Comput. Program., 2017

The Automatic Detection of Token Structures and Invariants Using SAT Checking.

[BibT_eX]

[DOI]

Pedro R. G. Antonino

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Checking Static Properties Using Conservative SAT Approximations for Reachability.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods: Foundations and Applications - 20th Brazilian Symposium, 2017

FDR: From Theory to Industrial Application.

[BibT_eX]

[DOI]

Proceedings of the Concurrency, Security, and Puzzles, 2017

2016

FDR3: a parallel refinement checker for CSP.

[BibT_eX]

[DOI]

Philip J. Armstrong

Int. J. Softw. Tools Technol. Transf., 2016

Analytics for characterising and measuring the naturalness of online personae.

[BibT_eX]

[DOI]

Jason R. C. Nurse

Arnau Erola

Michael Goldsmith

Sadie Creese

Secur. Informatics, 2016

Computing maximal weak and other bisimulations.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2016

Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Integrated Formal Methods - 12th International Conference, 2016

Tighter Reachability Criteria for Deadlock-Freedom Analysis.

[BibT_eX]

[DOI]

Pedro R. G. Antonino

Proceedings of the FM 2016: Formal Methods, 2016

2015

Verifying layered security protocols.

[BibT_eX]

[DOI]

Allaa Kamil

Gavin Lowe

J. Comput. Secur., 2015

Practical Partial Order Reduction for CSP.

[BibT_eX]

[DOI]

Henri Hansen

Xu Wang

Proceedings of the NASA Formal Methods - 7th International Symposium, 2015

2014

FDR3 - A Modern Refinement Checker for CSP.

[BibT_eX]

[DOI]

Philip J. Armstrong

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014

Inferring social relationships from technology-level device connections.

[BibT_eX]

[DOI]

Jason R. C. Nurse

Jess Pumphrey

Michael Goldsmith

Sadie Creese

Proceedings of the 2014 Twelfth Annual International Conference on Privacy, 2014

Computing Maximal Bisimulations.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods and Software Engineering, 2014

2013

Analysing layered security protocols.

[BibT_eX]

[DOI]

PhD thesis, 2013

Using FDR to Model Check CSP-Like Languages.

[BibT_eX]

[DOI]

Proceedings of the 35th Communicating Process Architectures, 2013

FDR3: the Future of CSP Model Checking.

[BibT_eX]

[DOI]

Proceedings of the 35th Communicating Process Architectures, 2013

Efficient Simulation of CSP-Like Languages.

[BibT_eX]

[DOI]

Proceedings of the 35th Communicating Process Architectures, 2013

The Meaning and Implementation of SKIP in CSP.

[BibT_eX]

[DOI]

Michael Goldsmith

Proceedings of the 35th Communicating Process Architectures, 2013

2011

Analysing Applications Layered on Unilaterally Authenticating Protocols.

[BibT_eX]

[DOI]