{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:18Z","timestamp":1772163978466,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,4,11]],"date-time":"2011-04-11T00:00:00Z","timestamp":1302480000000},"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,4,11]]},"DOI":"10.1145\/1967677.1967681","type":"proceedings-article","created":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T08:01:35Z","timestamp":1302595295000},"page":"21-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Task-level analysis for a language with async\/finish parallelism"],"prefix":"10.1145","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[{"name":"Complutense University of Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Puri","family":"Arenas","sequence":"additional","affiliation":[{"name":"Complutense University of Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samir","family":"Genaim","sequence":"additional","affiliation":[{"name":"Complutense University of Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damiano","family":"Zanardini","sequence":"additional","affiliation":[{"name":"Technical University of Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,4,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480887"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-010-9174-1"},{"key":"e_1_3_2_1_3_1","series-title":"LNCS","first-page":"157","volume-title":"Proc. of ESOP'07","author":"Albert E.","year":"2007","unstructured":"E. Albert , P. Arenas , S. Genaim , G. Puebla , and D. Zanardini . Cost Analysis of Java Bytecode . In Proc. of ESOP'07 , volume 4421 of LNCS , pages 157 -- 172 . Springer , 2007 . E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini. Cost Analysis of Java Bytecode. In Proc. of ESOP'07, volume 4421 of LNCS, pages 157--172. Springer, 2007."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92188-2_5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806651.1806671"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/278283.278285"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375634.1375655"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094852"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375634.1375656"},{"key":"e_1_3_2_1_11_1","series-title":"LNCS","first-page":"2","volume-title":"Proc. of SAS'10","author":"M.","year":"2010","unstructured":"M. F\\\"ahndrich. Static Verification for Code Contracts . In Proc. of SAS'10 , volume 6337 of LNCS , pages 2 -- 5 . Springer , 2010 . M. F\\\"ahndrich. Static Verification for Code Contracts. In Proc. of SAS'10, volume 6337 of LNCS, pages 2--5. Springer, 2010."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480898"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11957-6_16"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693024_3"},{"key":"e_1_3_2_1_15_1","volume-title":"Partial Evaluation and Automatic Program Generation","author":"Jones N.D.","year":"1993","unstructured":"N.D. Jones , C.K. Gomard , and P. Sestoft . Partial Evaluation and Automatic Program Generation . Prentice Hall , New York , 1993 . N.D. Jones, C.K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, New York, 1993."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693459"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134650.1134659"},{"key":"e_1_3_2_1_18_1","series-title":"LIPIcs","first-page":"259","volume-title":"Proc. of RTA'10","author":"Otto C.","year":"2010","unstructured":"C. Otto , M. Brockschmidt , C. von Essen , and J. Giesl . Automated Termination Analysis of Java Bytecode by Term Rewriting . In Proc. of RTA'10 , volume 6 of LIPIcs , pages 259 -- 276 , 2010 . C. Otto, M. Brockschmidt, C. von Essen, and J. Giesl. Automated Termination Analysis of Java Bytecode by Term Rewriting. In Proc. of RTA'10, volume 6 of LIPIcs, pages 259--276, 2010."},{"key":"e_1_3_2_1_19_1","series-title":"LNCS","first-page":"368","volume-title":"Proc. of RV'10","author":"Raman R.","year":"2010","unstructured":"R. Raman , J. Zhao , V. Sarkar , M. T. Vechev , and E. Yahav . Efficient data race detection for async-finish parallelism . In Proc. of RV'10 , volume 6418 of LNCS , pages 368 -- 383 . Springer , 2010 . R. Raman, J. Zhao, V. Sarkar, M. T. Vechev, and E. Yahav. Efficient data race detection for async-finish parallelism. In Proc. of RV'10, volume 6418 of LNCS, pages 368--383. Springer, 2010."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11539452_28"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1709093.1709095"},{"key":"e_1_3_2_1_22_1","series-title":"LNCS","first-page":"170","volume-title":"Proc. of SAS'07","author":"Wei W. Zou T.","year":"2007","unstructured":"W. Zou T. Wei , J. Mao and Y. Chen . A new algorithm for identifying loops in decompilation . In Proc. of SAS'07 , volume 4634 of LNCS , pages 170 -- 183 , 2007 . W. Zou T. Wei, J. Mao and Y. Chen. A new algorithm for identifying loops in decompilation. In Proc. of SAS'07, volume 4634 of LNCS, pages 170--183, 2007."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542431.1542451"},{"key":"e_1_3_2_1_24_1","series-title":"LNCS","first-page":"70","volume-title":"Proc. of VMCAI'03","author":"Unnikrishnan L.","year":"2003","unstructured":"L. Unnikrishnan , S. D. Stoller , and Y. A. Liu . Optimized Live Heap Bound Analysis . In Proc. of VMCAI'03 , volume 2575 of LNCS , pages 70 -- 85 . Springer , 2003 . L. Unnikrishnan, S. D. Stoller, and Y. A. Liu. Optimized Live Heap Bound Analysis. In Proc. of VMCAI'03, volume 2575 of LNCS, pages 70--85. Springer, 2003."},{"key":"e_1_3_2_1_25_1","first-page":"125","volume-title":"Proc. of CASCON'99","author":"Vallee-Rai R.","year":"1999","unstructured":"R. Vallee-Rai , L. Hendren , V. Sundaresan , P. Lam , E. Gagnon , and P. Co . Soot - a Java Optimization Framework . In Proc. of CASCON'99 , pages 125 -- 135 . IBM, 1999 . R. Vallee-Rai, L. Hendren, V. Sundaresan, P. Lam, E. Gagnon, and P. Co. Soot - a Java Optimization Framework. In Proc. of CASCON'99, pages 125--135. IBM, 1999."},{"key":"e_1_3_2_1_26_1","series-title":"LNCS","first-page":"455","volume-title":"Proc. of SAS'10","author":"Vechev M. T.","year":"2010","unstructured":"M. T. Vechev , E. Yahav , R. Raman , and V. Sarkar . Automatic Verification of Determinism for Structured Parallel Programs . In Proc. of SAS'10 , volume 6337 of LNCS , pages 455 -- 471 . Springer , 2010 . M. T. Vechev, E. Yahav, R. Raman, and V. Sarkar. Automatic Verification of Determinism for Structured Parallel Programs. In Proc. of SAS'10, volume 6337 of LNCS, pages 455--471. Springer, 2010."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361016"}],"event":{"name":"LCTES '11: SIGPLAN\/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems","location":"Chicago IL USA","acronym":"LCTES '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 2011 SIGPLAN\/SIGBED conference on Languages, compilers and tools for embedded systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1967677.1967681","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1967677.1967681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:52:30Z","timestamp":1750229550000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1967677.1967681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,11]]},"references-count":26,"alternative-id":["10.1145\/1967677.1967681","10.1145\/1967677"],"URL":"https:\/\/doi.org\/10.1145\/1967677.1967681","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2016603.1967681","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,4,11]]},"assertion":[{"value":"2011-04-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}