| 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, 149-167, 2016 | 69 | 2016 |
| Computing maximal weak and other bisimulations A Boulgakov, T Gibson-Robinson, AW Roscoe Formal Aspects of Computing 28, 381-407, 2016 | 16 | 2016 |
| Computing maximal bisimulations A Boulgakov, T Gibson-Robinson, AW Roscoe International Conference on Formal Engineering Methods, 11-26, 2014 | 6 | 2014 |
| Improving scalability of exploratory model checking A Boulgakov University of Oxford, 2016 | 5 | 2016 |
| FDR3—a modern refinement checker for CSP T GRABR14 Gibson-Robinson, P Armstrong, A Boulgakov, AW Roscoe International conference on tools and algorithms for the construction and …, 2014 | 5 | 2014 |
| FDR3—A Modern Refinement Checker for CSP ABAWRT Gibson, PA Robinson Erika brahm and Klaus Havelund, editors, Tools and Algorithms for the …, 2014 | 5 | 2014 |
| Failures divergences refinement (FDR) version 4 T Gibson-Robinson, P Armstrong, A Boulgakov, AW Roscoe | 4 | 2016 |
| Failures Divergences Refinement (FDR) Version 3 (2013) T Gibson-Robinson, P Armstrong, A Boulgakov, A Roscoe | 4 | |
| Efficient multi-graph or rooted subgraph matching via merging A Boulgakov | 3 | 2018 |
| Flow-graph analysis of system calls for exploit detection A Desnos, E Petrova, A Boulgakov, R Neal, Z Mithra | 2 | 2018 |
| Matching a graph with a non-deterministic finite automaton A Boulgakov | 2 | 2018 |
| A Machine-Learned Model To Detect Malicious Code Using API-call N-grams From Static Analysis A Boulgakov, C Ren | 1 | 2020 |
| Static system-call graph generation A Boulgakov | 1 | 2018 |
| Indexing Software Packages and Detecting Malicious or Potentially Harmful Code using API-call N-Grams A Boulgakov US Patent App. 18/031,443, 2023 | | 2023 |
| Efficient Extraction of n-grams From a Grammar A Boulgakov | | 2020 |
| SIPping Wikipedia A Boulgakov, G Stark | | |
Bill Roscoe (A.W. Roscoe)Emeritus Professor of Computer Science, Oxford UniversityVerified email at cs.ox.ac.uk
