{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:19Z","timestamp":1772164039686,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,22]],"date-time":"2011-10-22T00:00:00Z","timestamp":1319241600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,10,22]]},"DOI":"10.1145\/2048066.2048085","type":"proceedings-article","created":{"date-parts":[[2011,10,25]],"date-time":"2011-10-25T08:23:06Z","timestamp":1319530986000},"page":"207-224","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["HAWKEYE"],"prefix":"10.1145","author":[{"given":"Omer","family":"Tripp","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Greta","family":"Yorsh","sequence":"additional","affiliation":[{"name":"ARM, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Field","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mooly","family":"Sagiv","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,10,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Chord: A static and dynamic program-analysis framework for java.  Chord: A static and dynamic program-analysis framework for java."},{"key":"e_1_3_2_1_2_1","unstructured":"Cobertura: A test coverage tool for java. http:\/\/cobertura.sourceforge.net.  Cobertura: A test coverage tool for java. http:\/\/cobertura.sourceforge.net."},{"key":"e_1_3_2_1_3_1","unstructured":"The jfilesync java file synchronization utility. http:\/\/jfilesync.sourceforge.net.  The jfilesync java file synchronization utility. http:\/\/jfilesync.sourceforge.net."},{"key":"e_1_3_2_1_4_1","unstructured":"The jgrapht java graph library. http:\/\/www.jgrapht.org.  The jgrapht java graph library. http:\/\/www.jgrapht.org."},{"key":"e_1_3_2_1_5_1","unstructured":"The weblech download and mirror tool. http:\/\/sourceforge.net\/projects\/weblech\/+.  The weblech download and mirror tool. http:\/\/sourceforge.net\/projects\/weblech\/+."},{"key":"e_1_3_2_1_6_1","unstructured":"The weka machine-learning library. http:\/\/sourceforge.net\/projects\/weka.  The weka machine-learning library. http:\/\/sourceforge.net\/projects\/weka."},{"key":"e_1_3_2_1_7_1","volume-title":"Parallelizing compiler techniques based on linear inequalities. Technical report","author":"Amarasinghe Saman P","year":"1997","unstructured":"Saman P Amarasinghe . Parallelizing compiler techniques based on linear inequalities. Technical report , 1997 . Saman P Amarasinghe. Parallelizing compiler techniques based on linear inequalities. Technical report, 1997."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/197405.197406"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167488"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604156"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1743546.1743572"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/954186.954208"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/24039.24041"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.546613"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/IWMSE.2009.5071383"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345237"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289507"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.53994"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706304"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504181"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993562"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250759"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11688839_5"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869459.1869494"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(98)00021-0"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/360051.360224"},{"key":"e_1_3_2_1_28_1","volume-title":"Axiomatic Proof Techniques for Parallel Programs. Outstanding Dissertations in the Computer Sciences","author":"Owicki Susan S.","year":"1975","unstructured":"Susan S. Owicki . Axiomatic Proof Techniques for Parallel Programs. Outstanding Dissertations in the Computer Sciences . Garland Publishing , New York , 1975 . Susan S. Owicki. Axiomatic Proof Techniques for Parallel Programs. Outstanding Dissertations in the Computer Sciences. Garland Publishing, New York, 1975."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/786775.787215"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/231379.231390"},{"key":"e_1_3_2_1_31_1","first-page":"14","volume-title":"IPPS","author":"Martin","year":"1996","unstructured":"Martin C. Rinard and Pedro C. Diniz. Commutativity analysis: A technique for automatically parallelizing pointer-based computations . In IPPS , pages 14 -- 22 , 1996 . Martin C. Rinard and Pedro C. Diniz. Commutativity analysis: A technique for automatically parallelizing pointer-based computations. In IPPS, pages 14--22, 1996."},{"key":"e_1_3_2_1_32_1","first-page":"414","volume-title":"Euro-Par","author":"Martin","year":"1996","unstructured":"Martin C. Rinard and Pedro C. Diniz. Semantic foundations of commutativity analysis . In Euro-Par , Vol. I , pages 414 -- 423 , 1996 . Martin C. Rinard and Pedro C. Diniz. Semantic foundations of commutativity analysis. In Euro-Par, Vol. I, pages 414--423, 1996."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11408901_26"},{"key":"e_1_3_2_1_34_1","first-page":"221","article-title":"Building a bridge between pointer aliases and program dependences","volume":"8","author":"Ross John L.","year":"1998","unstructured":"John L. Ross and Mooly Sagiv . Building a bridge between pointer aliases and program dependences . Nordic Journal of Computing , 8 : 221 -- 235 , 1998 . John L. Ross and Mooly Sagiv. Building a bridge between pointer aliases and program dependences. Nordic Journal of Computing, 8:221--235, 1998.","journal-title":"Nordic Journal of Computing"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00590-9_28"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250748"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2004.08.006"}],"event":{"name":"SPLASH '11: Conference on Systems, Programming, and Applications: Software for Humanity","location":"Portland Oregon USA","acronym":"SPLASH '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2048066.2048085","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2048066.2048085","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:31Z","timestamp":1750225711000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2048066.2048085"}},"subtitle":["effective discovery of dataflow impediments to parallelization"],"short-title":[],"issued":{"date-parts":[[2011,10,22]]},"references-count":37,"alternative-id":["10.1145\/2048066.2048085","10.1145\/2048066"],"URL":"https:\/\/doi.org\/10.1145\/2048066.2048085","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2076021.2048085","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,10,22]]},"assertion":[{"value":"2011-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}