基本信息
浏览量:24
职业迁徙
个人简介
My interests are broadly in the area of concurrency.
In recent years I have become interested in concurrent programming, particularly lock-free concurrent datatypes, and ways of analysing them:
I have developed a concurrent lock-free binomial heap, and argued for its correctness.
I have investigated how to test concurrent datatypes for linearizability.
I have investigated how to analyse lock-free code using the process algebra CSP and its model checker FDR; I have used these techniques to analyse a lock-free queue, and to discover the cause of a deadlock in a channel implementation.
I am also interested in verification, particularly of concurrent systems, using model checking techniques.
I have recently extended the technique of view abstraction, which can be used to verify systems with an unbounded number of similar components. In particular, I extended the technique to include components with an identity, where these identities could be passed between processes. I showed how to use these techniques to analyse concurrent datatypes based on linked lists.
I have (with Tom Gibson-Robinson) extended the model checker FDR to include symmetry reduction.
I have investigated parallel versions of Tarjan's Algorithm for finding loops or strongly connected components in a graph. This has various applications in model checking.
Previously I did a lot of work in the formal modelling and analysis of computer security.
In recent years I have become interested in concurrent programming, particularly lock-free concurrent datatypes, and ways of analysing them:
I have developed a concurrent lock-free binomial heap, and argued for its correctness.
I have investigated how to test concurrent datatypes for linearizability.
I have investigated how to analyse lock-free code using the process algebra CSP and its model checker FDR; I have used these techniques to analyse a lock-free queue, and to discover the cause of a deadlock in a channel implementation.
I am also interested in verification, particularly of concurrent systems, using model checking techniques.
I have recently extended the technique of view abstraction, which can be used to verify systems with an unbounded number of similar components. In particular, I extended the technique to include components with an identity, where these identities could be passed between processes. I showed how to use these techniques to analyse concurrent datatypes based on linked lists.
I have (with Tom Gibson-Robinson) extended the model checker FDR to include symmetry reduction.
I have investigated parallel versions of Tarjan's Algorithm for finding loops or strongly connected components in a graph. This has various applications in model checking.
Previously I did a lot of work in the formal modelling and analysis of computer security.
研究兴趣
论文共 100 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
Concurrency, Security, and Puzzlespp.162-184, (2017)
Concurrency, Security, and Puzzlespp.65-87, (2017)
semanticscholar(2016)
引用0浏览0引用
0
0
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn