The following pages link to John Derrick (Q202499):
Displaying 15 items.
- An Observational Approach to Defining Linearizability on Weak Memory Models (Q5082193) (← links)
- (Q5101340) (← links)
- Verifying Opacity of a Transactional Mutex Lock (Q5206950) (← links)
- A Framework for Correctness Criteria on Weak Memory Models (Q5206951) (← links)
- Model checking stochastic automata (Q5267439) (← links)
- Algebraic Methodology and Software Technology (Q5312975) (← links)
- More Relational Concurrent Refinement: Traces and Partial Relations (Q5403469) (← links)
- (Q5677488) (← links)
- ZB 2005: Formal Specification and Development in Z and B (Q5703814) (← links)
- ZB 2005: Formal Specification and Development in Z and B (Q5703819) (← links)
- Understanding, Explaining, and Deriving Refinement (Q5861785) (← links)
- Specification, refinement and verification of concurrent systems -- an integration of Object-\(Z\) and \(CSP\) (Q5943269) (← links)
- (Q6083440) (← links)
- Making Linearizability Compositional for Partially Ordered Executions (Q6104493) (← links)
- Verifying correctness of persistent concurrent data structures (Q6535948) (← links)