Compositional verification of compiler optimisations on relaxed memory

DOI10.1007/978-3-319-89884-1_36zbMath1418.68044arXiv1802.05918OpenAlexW2964237197MaRDI QIDQ2324020

Mark Batty, Alexey Gotsman, Mike Dodds

Publication date: 13 September 2019

Full work available at URL: https://arxiv.org/abs/1802.05918

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Modular Relaxed Dependencies in Weak Memory Concurrency

This page was built for publication: Compositional verification of compiler optimisations on relaxed memory