Show simple item record

dc.contributor.authorXu, Yifan
dc.contributor.authorZhou, Anchengcheng
dc.contributor.authorYin, Grace
dc.contributor.authorAgrawal, Kunal
dc.contributor.authorLee, I-Ting
dc.contributor.authorSchardl, Tao
dc.date.accessioned2022-10-24T16:54:42Z
dc.date.available2022-10-24T16:54:42Z
dc.date.issued2021-07-06
dc.identifier.isbn978-1-4503-8070-6
dc.identifier.urihttps://hdl.handle.net/1721.1/145965
dc.publisherACM|Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures CD-ROMen_US
dc.relation.isversionofhttps://doi.org/10.1145/3409964.3461825en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceACM|Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures CD-ROMen_US
dc.titleBrief Announcement: Efficient Access History for Race Detectionen_US
dc.typeArticleen_US
dc.identifier.citationXu, Yifan, Zhou, Anchengcheng, Yin, Grace, Agrawal, Kunal, Lee, I-Ting et al. 2021. "Brief Announcement: Efficient Access History for Race Detection."
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.identifier.mitlicensePUBLISHER_POLICY
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2022-10-20T07:50:09Z
dc.language.rfc3066en
dc.rights.holderThe author(s)
dspace.date.submission2022-10-20T07:50:10Z
mit.licensePUBLISHER_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record