» The complexity of verifying memory coherence

| Sorted by Date | Classified by Faculty |

Jason F. Cantin, Mikko H. Lipasti, and James E. Smith. The complexity of verifying memory coherence. In SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003), pp. 254-255, ACM, 2003.

Download

(unavailable)

Abstract

(unavailable)

BibTeX

 @inproceedings{DBLP:conf/spaa/CantinLS03,
   author    = {Jason F. Cantin and
                Mikko H. Lipasti and
                James E. Smith},
   editor    = {Arnold L. Rosenberg and
                Friedhelm Meyer auf der Heide},
   title     = {The complexity of verifying memory coherence},
   booktitle = {{SPAA} 2003: Proceedings of the Fifteenth Annual {ACM} Symposium on
                Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego,
                California, {USA} (part of {FCRC} 2003)},
   pages     = {254--255},
   publisher = {{ACM}},
   year      = {2003},
   url       = {https://doi.org/10.1145/777412.777457},
   doi       = {10.1145/777412.777457},
   timestamp = {Wed, 21 Nov 2018 11:11:22 +0100},
   biburl    = {https://dblp.org/rec/conf/spaa/CantinLS03.bib},
   bibsource = {dblp computer science bibliography, https://dblp.org}
 }

---

Generated by bib.pl (written by Patrick Riley ) on Mon Sep 27, 2021 15:47:01 time=1207019082