Simon Doherty

Orcid: 0000-0001-8822-1091

According to our database1, Simon Doherty authored at least 30 papers between 2004 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Unifying Operational Weak Memory Verification: An Axiomatic Approach.
ACM Trans. Comput. Log., 2022

Modularising Verification Of Durable Opacity.
Log. Methods Comput. Sci., 2022

Integrating Owicki-Gries for C11-Style Memory Models into Isabelle/HOL.
J. Autom. Reason., 2022

2021
Convolution and concurrency.
Math. Struct. Comput. Sci., 2021

Verifying correctness of persistent concurrent data structures: a sound and complete method.
Formal Aspects Comput., 2021

On Strong Observational Refinement and Forward Simulation.
CoRR, 2021

Brief Announcement: On Strong Observational Refinement and Forward Simulation.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

2020
Owicki-Gries Reasoning for C11 RAR (Artifact).
Dagstuhl Artifacts Ser., 2020

Integrating Owicki-Gries for C11-Style Memory Models into Isabelle/HOL.
CoRR, 2020

Relational Semigroups and Object-Free Categories.
CoRR, 2020

Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2020

Owicki-Gries Reasoning for C11 RAR.
Proceedings of the 34th European Conference on Object-Oriented Programming, 2020

2019
Verifying C11 programs operationally.
Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

Verifying Correctness of Persistent Concurrent Data Structures.
Proceedings of the Formal Methods - The Next 30 Years - Third World Congress, 2019

2018
Mechanized proofs of opacity: a comparison of two techniques.
Formal Aspects Comput., 2018

Causal Linearizability: Compositionality for Partially Ordered Executions.
CoRR, 2018

Brief Announcement: Generalising Concurrent Correctness to Weak Memory.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Making Linearizability Compositional for Partially Ordered Executions.
Proceedings of the Integrated Formal Methods - 14th International Conference, 2018

2017
Proving Opacity via Linearizability: A Sound and Complete Method.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2017

2016
Causal Linearizability.
CoRR, 2016

Reducing Opacity to Linearizability: A Sound and Complete Method.
CoRR, 2016

Linearizability and Causality.
Proceedings of the Software Engineering and Formal Methods - 14th International Conference, 2016

Proving Opacity of a Pessimistic STM.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2013
Towards formally specifying and verifying transactional memory.
Formal Aspects Comput., 2013

2010
Simpler Backward Simulation Proofs.
Proceedings of the Theory of Computing 2010, 2010

2009
Nonblocking Algorithms and Backward Simulation.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

2005
Verifying Concurrent Data Structures by Simulation.
Proceedings of the REFINE 2005 Workshop, 2005

2004
DCAS is not a silver bullet for nonblocking algorithm design.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Bringing practical lock-free synchronization to 64-bit applications.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Formal Verification of a Practical Lock-Free Queue Algorithm.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2004


  Loading...