| Publication | Date of Publication | Type |
|---|
A fine-grained semantics for arrays and pointers under weak memory models
Formal Methods | 2023-08-17 | Paper |
Parallelized sequential composition and hardware weak memory models
Software Engineering and Formal Methods | 2023-05-26 | Paper |
A wide-spectrum language for verification of programs on weak memory models
(available as arXiv preprint) | 2021-05-04 | Paper |
Linearizability on hardware weak memory models
Formal Aspects of Computing | 2020-07-27 | Paper |
An algebra of synchronous atomic steps
(available as arXiv preprint) | 2020-01-03 | Paper |
A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency
Formal Aspects of Computing | 2019-05-10 | Paper |
Designing a semantic model for a wide-spectrum language with concurrency
Formal Aspects of Computing | 2017-11-29 | Paper |
An operational semantics for object-oriented concepts based on the class hierarchy
Formal Aspects of Computing | 2016-08-05 | Paper |
Modelling and analysing neural networks using a hybrid process algebra
Theoretical Computer Science | 2016-03-31 | Paper |
Balancing expressiveness in formal approaches to concurrency
Formal Aspects of Computing | 2015-11-10 | Paper |
| Verifying concurrent data structures by simulation | 2013-12-04 | Paper |
Don't care non-determinism in logic program refinement
Electronic Notes in Theoretical Computer Science | 2013-07-24 | Paper |
Structural operational semantics through context-dependent behaviour
The Journal of Logic and Algebraic Programming | 2011-09-12 | Paper |
A semantics for behavior trees using CSP with specification commands
Science of Computer Programming | 2011-07-18 | Paper |
Refinement of Higher-Order Logic Programs
Logic Based Program Synthesis and Transformation | 2011-03-04 | Paper |
Trace-based derivation of a scalable lock-free stack algorithm
Formal Aspects of Computing | 2009-05-27 | Paper |
CSP with Hierarchical State
Lecture Notes in Computer Science | 2009-02-24 | Paper |
A general technique for proving lock-freedom
Science of Computer Programming | 2009-02-19 | Paper |
Verifying Lock-Freedom Using Well-Founded Orders
Theoretical Aspects of Computing – ICTAC 2007 | 2008-09-17 | Paper |
Calculating modules in contextual logic program refinement
Theory and Practice of Logic Programming | 2008-01-21 | Paper |
Program Development in Computational Logic
Lecture Notes in Computer Science | 2005-12-23 | Paper |
A refinement calculus for logic programs
Theory and Practice of Logic Programming | 2004-03-01 | Paper |
| scientific article; zbMATH DE number 1973216 (Why is no real title available?) | 2003-09-01 | Paper |
| scientific article; zbMATH DE number 1303988 (Why is no real title available?) | 1999-11-02 | Paper |
| scientific article; zbMATH DE number 1104390 (Why is no real title available?) | 1998-06-01 | Paper |
