"Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models ..."

Yehia Abd Alrahman et al. (2014)

> Home

Details and statistics

DOI: 10.1007/978-3-319-12904-4_2

access: open

type: Conference or Workshop Paper

metadata version: 2018-11-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/wrla/AlrahmanABL14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wrla/AlrahmanABL14
Yehia Abd Alrahman, Marina Andric, Alessandro Beggiato, Alberto Lluch-Lafuente:
Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude? WRLA 2014: 21-41

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.