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

Lecture Notes in Computer Science - Germany

doi 10.1007/978-3-319-12904-4_2