Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?

Yehia Abd Alrahman, Marina Andric, Alessandro Beggiato, Alberto Lluch-Lafuente. Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?. In Santiago Escobar, editor, Rewriting Logic and Its Applications - 10th International Workshop, WRLA 2014, Held as a Satellite Event of ETAPS, Grenoble, France, April 5-6, 2014, Revised Selected Papers. Volume 8663 of Lecture Notes in Computer Science, pages 21-41, Springer, 2014. [doi]

Abstract

Abstract is missing.