{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T05:13:06Z","timestamp":1767849186668,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T00:00:00Z","timestamp":1403308800000},"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":[[2014,6,21]]},"DOI":"10.1145\/2612669.2612685","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"226-235","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Automatic complexity analysis of explicitly parallel programs"],"prefix":"10.1145","author":[{"given":"Torsten","family":"Hoefler","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Grzegorz","family":"Kwasniewski","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2014,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Lecture Notes in Computer Science","first-page":"117","volume-title":"Static Analysis","author":"Alias C.","year":"2011","unstructured":"C. Alias , A. Darte , P. Feautrier , and L. Gonnord . Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs . In Static Analysis , volume 6337 of Lecture Notes in Computer Science , pages 117 -- 133 . Springer , 2011 . C. Alias, A. Darte, P. Feautrier, and L. Gonnord. Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs. In Static Analysis, volume 6337 of Lecture Notes in Computer Science, pages 117--133. Springer, 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1465482.1465560"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/125826.125925"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375527.1375580"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2148600.2148602"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.4.769"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCGrid.2012.123"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2480359.2429078"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11970-5_16"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/231191.231193"},{"key":"e_1_3_2_1_11_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-3-642-17511-4_7","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"Blanc R.","year":"2010","unstructured":"R. Blanc , T. Henzinger , T. Hottelier , and L. Kovacs . ABC: Algebraic Bound Computation for Loops . In E. Clarke and A. Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning , volume 6355 of LNCS , pages 103 -- 118 . Springer , 2010 . R. Blanc, T. Henzinger, T. Hottelier, and L. Kovacs. ABC: Algebraic Bound Computation for Loops. In E. Clarke and A. Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, volume 6355 of LNCS, pages 103--118. Springer, 2010."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503277"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2004.11.019"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063396"},{"key":"e_1_3_2_1_17_1","first-page":"1","volume-title":"Structured programming","author":"Dijkstra E. W.","year":"1972","unstructured":"E. W. Dijkstra . Structured programming . chapter Notes on Structured Programming, pages 1 -- 82 . Academic Press Ltd ., London, UK, UK, 1972 . E. W. Dijkstra. Structured programming. chapter Notes on Structured Programming, pages 1--82. Academic Press Ltd., London, UK, UK, 1972."},{"key":"e_1_3_2_1_18_1","first-page":"197","volume-title":"High Performance Computing for Computational Science","author":"Goodale T.","year":"2003","unstructured":"T. Goodale , G. Allen , G. Lanfermann , J. Mass\u00f3 , T. Radke , E. Seidel , and J. Shalf . The cactus framework and toolkit: Design and applications . In High Performance Computing for Computational Science , pages 197 -- 227 . Springer , 2003 . T. Goodale, G. Allen, G. Lanfermann, J. Mass\u00f3, T. Radke, E. Seidel, and J. Shalf. The cactus framework and toolkit: Design and applications. In High Performance Computing for Computational Science, pages 197--227. Springer, 2003."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063348.2063356"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11549468_24"},{"key":"e_1_3_2_1_21_1","volume-title":"Measurement, Simulation, and Modeling","author":"Jain R.","year":"2008","unstructured":"R. Jain . The Art Of Computer Systems Performance Analysis : Techniques for Experimental Design , Measurement, Simulation, and Modeling . Wiley , 2008 . R. Jain. The Art Of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling. Wiley, 2008."},{"key":"e_1_3_2_1_22_1","volume-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1 J.","year":"1992","unstructured":"J. J\u00e1J\u00e1 . An Introduction to Parallel Algorithms . Addison Wesley Longman Publishing Co., Inc. , Redwood City, CA, USA , 1992 . J. J\u00e1J\u00e1. An Introduction to Parallel Algorithms. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA, 1992."},{"key":"e_1_3_2_1_23_1","first-page":"869","volume-title":"Handbook of Theoretical Computer Science (Vol. A)","author":"Karp R. M.","year":"1990","unstructured":"R. M. Karp and V. Ramachandran . Handbook of Theoretical Computer Science (Vol. A) . chapter Parallel Algorithms for Shared-memory Machines, pages 869 -- 941 . MIT Press , Cambridge, MA, USA , 1990 . R. M. Karp and V. Ramachandran. Handbook of Theoretical Computer Science (Vol. A). chapter Parallel Algorithms for Shared-memory Machines, pages 869--941. MIT Press, Cambridge, MA, USA, 1990."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/582034.582071"},{"key":"e_1_3_2_1_25_1","volume-title":"The Art of Computer Programming","author":"Knuth D. E.","unstructured":"D. E. Knuth . Sorting and Searching , The Art of Computer Programming , Volume 3: (2Nd Ed.) Sorting and Searching. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA, 1998 . D. E. Knuth. Sorting and Searching, The Art of Computer Programming, Volume 3: (2Nd Ed.) Sorting and Searching. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA, 1998."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/977395.977673"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229428.1229479"},{"key":"e_1_3_2_1_28_1","volume-title":"Introduction to Algorithms","author":"Leiserson C. E.","year":"2001","unstructured":"C. E. Leiserson , R. L. Rivest , C. Stein , and T. H. Cormen . Introduction to Algorithms . The MIT press , 2001 . C. E. Leiserson, R. L. Rivest, C. Stein, and T. H. Cormen. Introduction to Algorithms. The MIT press, 2001."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005691"},{"key":"e_1_3_2_1_30_1","series-title":"LNCS","first-page":"373","volume-title":"Static Analysis","author":"Matringe N.","year":"2011","unstructured":"N. Matringe , A. Moura , and R. Rebiha . Generating invariants for non-linear hybrid systems by linear algebraic methods . In Static Analysis , volume 6337 of LNCS , pages 373 -- 389 . Springer , 2011 . N. Matringe, A. Moura, and R. Rebiha. Generating invariants for non-linear hybrid systems by linear algebraic methods. In Static Analysis, volume 6337 of LNCS, pages 373--389. Springer, 2011."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005285.1005324"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_31"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90013-X"},{"issue":"42","key":"e_1_3_2_1_34_1","first-page":"230","article-title":"On Computable Numbers, with an Application to the Entscheidungsproblem","volume":"2","author":"Turing A. M.","year":"1936","unstructured":"A. M. Turing . On Computable Numbers, with an Application to the Entscheidungsproblem . Proc. London Math. Soc. , 2 ( 42 ): 230 -- 265 , 1936 . A. M. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. Proc. London Math. Soc., 2(42):230--265, 1936.","journal-title":"Proc. London Math. Soc."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.20"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693493"},{"key":"e_1_3_2_1_37_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/978-3-642-23702-7_22","volume-title":"Static Analysis","author":"Zuleger F.","year":"2011","unstructured":"F. Zuleger , S. Gulwani , M. Sinn , and H. Veith . Bound analysis of imperative programs with the size-change abstraction . In E. Yahav, editor, Static Analysis , volume 6887 of Lecture Notes in Computer Science , pages 280 -- 297 . Springer Berlin Heidelberg , 2011 . F. Zuleger, S. Gulwani, M. Sinn, and H. Veith. Bound analysis of imperative programs with the size-change abstraction. In E. Yahav, editor, Static Analysis, volume 6887 of Lecture Notes in Computer Science, pages 280--297. Springer Berlin Heidelberg, 2011."}],"event":{"name":"SPAA '14: 26th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Prague Czech Republic","acronym":"SPAA '14","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612685","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2612669.2612685","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:34Z","timestamp":1750230094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612685"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":37,"alternative-id":["10.1145\/2612669.2612685","10.1145\/2612669"],"URL":"https:\/\/doi.org\/10.1145\/2612669.2612685","relation":{},"subject":[],"published":{"date-parts":[[2014,6,21]]},"assertion":[{"value":"2014-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}