Relaxed-memory concurrency and verified compilation

DOI10.1145/1926385.1926393zbMath1284.68152OpenAlexW4247648759MaRDI QIDQ5408530

Suresh Jagannathan, Jaroslav Ševčík, Peter Sewell, Viktor Vafeiadis, F. Zappa Nardelli

Publication date: 10 April 2014

Published in: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1926385.1926393

zbMATH Keywords

semanticsrelaxed memory modelsverifying compilation

Mathematics Subject Classification ID

Related Items (3)

Possible values: exploring a concept for concurrency ⋮ Verifying Optimizations for Concurrent Programs ⋮ Lem: A Lightweight Tool for Heavyweight Semantics

This page was built for publication: Relaxed-memory concurrency and verified compilation