{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:52:22Z","timestamp":1729619542306,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1109\/pact.2011.70","type":"proceedings-article","created":{"date-parts":[[2012,1,6]],"date-time":"2012-01-06T19:28:47Z","timestamp":1325878127000},"page":"393-402","source":"Crossref","is-referenced-by-count":1,"title":["Exploiting Task Order Information for Optimizing Sequentially Consistent Java Programs"],"prefix":"10.1109","author":[{"given":"Christoph M.","family":"Angerer","sequence":"first","affiliation":[]},{"given":"Thomas R.","family":"Gross","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","first-page":"133","article-title":"Bulkcompiler: High-performance sequential consistency through cooperative compiler and hardware support","author":"ahn","year":"2009","journal-title":"Micro"},{"doi-asserted-by":"publisher","key":"22","DOI":"10.1109\/12.947002"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1007\/978-3-540-69330-7_11"},{"doi-asserted-by":"publisher","key":"23","DOI":"10.1145\/782814.782854"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1145\/1250662.1250697"},{"key":"15","first-page":"338","article-title":"An efficient algorithm for computing mhp information for concurrent java programs","author":"naumovich","year":"1999","journal-title":"ESEC\/FSE-7"},{"key":"16","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/1229428.1229471","article-title":"May-happen-in-parallel analysis of X10 programs","author":"agarwal","year":"2007","journal-title":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming PPOPP"},{"key":"13","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/379539.379553","article-title":"Pointer and escape analysis for multithreaded programs","author":"salcianu","year":"2001","journal-title":"PPoPP"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1145\/952532.952741"},{"key":"11","first-page":"487","article-title":"Laws of order: Expensive synchronization in concurrent algorithms cannot be eliminated","author":"attiya","year":"2011","journal-title":"POPL"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1145\/596980.596982"},{"doi-asserted-by":"publisher","key":"21","DOI":"10.1145\/42190.42277"},{"key":"3","first-page":"2","article-title":"Compiler techniques for high performance sequentially consistent java programs","author":"sura","year":"2005","journal-title":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming PPOPP"},{"doi-asserted-by":"publisher","key":"20","DOI":"10.1145\/1854273.1854312"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1007\/978-3-540-70592-5_3"},{"key":"1","first-page":"378","article-title":"The java memory model","author":"manson","year":"2005","journal-title":"POPL"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1145\/359545.359563"},{"year":"0","journal-title":"Multi-threaded benchmark suite","key":"7"},{"key":"6","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/504282.504288","article-title":"Object race detection","volume":"36","author":"von praun","year":"2001","journal-title":"Proceedings of the Conference on Object-Oriented Programming Systems Languages and Applications OOPSLA"},{"key":"5","first-page":"3","article-title":"Now happens-before later: Static schedule analysis of fine-grained parallelism with explicit happensbefore relationships","author":"angerer","year":"2010","journal-title":"SPLASH\/Onward"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1007\/978-3-642-19595-2_2"},{"key":"9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1504176.1504181","article-title":"How much parallelism is there in irregular applications?","author":"kulkarni","year":"2009","journal-title":"PPoPP"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/ISPASS.2009.4919639"}],"event":{"name":"2011 International Conference on Parallel Architectures and Compilation Techniques (PACT)","start":{"date-parts":[[2011,10,10]]},"location":"Galveston, TX, USA","end":{"date-parts":[[2011,10,14]]}},"container-title":["2011 International Conference on Parallel Architectures and Compilation Techniques"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6112806\/6113772\/06113847.pdf?arnumber=6113847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T08:57:44Z","timestamp":1686646664000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6113847\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/pact.2011.70","relation":{},"subject":[],"published":{"date-parts":[[2011,10]]}}}