The benefits of duality in verifying concurrent programs under TSO (Q4608655)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6851927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The benefits of duality in verifying concurrent programs under TSO |
scientific article; zbMATH DE number 6851927 |
Statements
21 March 2018
0 references
weak memory models
0 references
reachability problem
0 references
parameterized verification
0 references
The Benefits of Duality in Verifying Concurrent Programs under TSO (English)
0 references
0.9086913466453552
0 references
0.7887414693832397
0 references
0.7612362504005432
0 references
0.7556602954864502
0 references
0.7522965669631958
0 references
