List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Checking static properties using conservative SAT approximations for reachability Lecture Notes in Computer Science | 2022-11-04 | 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 |
| 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 |
| FDR: from theory to industrial application | 2018-03-26 | Paper |
| Computing maximal weak and other bisimulations Formal Aspects of Computing | 2017-02-14 | Paper |
| FDR3 -- a modern refinement checker for CSP Tools and Algorithms for the Construction and Analysis of Systems | 2015-02-10 | Paper |
Research outcomes over time
This page was built for person: Thomas Gibson-Robinson
