Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Yehia Abd Alrahman, Marina Andric, Alessandro Beggiato, Alberto Lluch-Lafuente
Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?
WRLA, 2014.

WRLA 2014
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{WRLA-2014-AlrahmanABL,
	author        = "Yehia Abd Alrahman and Marina Andric and Alessandro Beggiato and Alberto Lluch-Lafuente",
	booktitle     = "{Revised Selected Papers of the 10th International Workshop on Rewriting Logic and its Applications}",
	doi           = "10.1007/978-3-319-12904-4_2",
	isbn          = "978-3-319-12903-7",
	pages         = "21--41",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?}",
	volume        = 8663,
	year          = 2014,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.