Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude? - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Yehia Abd Alrahman' in GoogleThis author has not been identified. Look up 'Marina Andric' in GoogleThis author has not been identified. Look up 'Alessandro Beggiato' in GoogleThis author has not been identified. Look up 'Alberto Lluch-Lafuente' in Google

runs on WebDSL