Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude? (Q2945130): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56495846, #quickstatements; #temporary_batch_1706081078495 |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 21:16, 3 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude? |
scientific article |
Statements
Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude? (English)
0 references
9 September 2015
0 references