Operational semantics with semicommutations
From MaRDI portal
Publication:2043812
DOI10.1016/j.jlamp.2021.100677OpenAlexW3137608481MaRDI QIDQ2043812
Hendrik Maarand, Tarmo Uustalu
Publication date: 3 August 2021
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2021.100677
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial derivatives of regular expressions and finite automaton constructions
- Theorem proving in higher order logics. 22nd international conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings
- Semi-commutations
- The equational theory of pomsets
- Stateless model checking for TSO and PSO
- A structural approach to operational semantics
- A wide-spectrum language for verification of programs on weak memory models
- Combinatorial problems of commutation and rearrangements
- A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions
- Brookes Is Relaxed, Almost!
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- On Thin Air Reads Towards an Event Structures Model of Relaxed Memory
- ON THE ZAPPA-SZÉP PRODUCT
- Modular Relaxed Dependencies in Weak Memory Concurrency
- Relaxed memory models
- Dynamic partial-order reduction for model checking software
- Software Verification for Weak Memory via Program Transformation
- A promising semantics for relaxed-memory concurrency
- Inhomogeneous sorting
- Operational semantics of a weak memory model with channel synchronization
- Computer aided verification. 10th international conference, CAV'98, Vancouver, BC, Canada, June 28 -- July 2, 1998. Proceedings
