{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:29Z","timestamp":1772164049231,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":77,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,11]],"date-time":"2016-01-11T00:00:00Z","timestamp":1452470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["279307: Graph Games"],"award-info":[{"award-number":["279307: Graph Games"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P23499-N23, S11407-N23"],"award-info":[{"award-number":["P23499-N23, S11407-N23"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,11]]},"DOI":"10.1145\/2837614.2837624","type":"proceedings-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T09:05:00Z","timestamp":1452157500000},"page":"733-747","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Algorithms for algebraic path properties in concurrent systems of constant treewidth components"],"prefix":"10.1145","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[{"name":"IST Austria, Austria"}]},{"given":"Amir Kafshdar","family":"Goharshady","sequence":"additional","affiliation":[{"name":"IST Austria, Austria"}]},{"given":"Rasmus","family":"Ibsen-Jensen","sequence":"additional","affiliation":[{"name":"IST Austria, Austria"}]},{"given":"Andreas","family":"Pavlogiannis","sequence":"additional","affiliation":[{"name":"IST Austria, Austria"}]}],"member":"320","published-online":{"date-parts":[[2016,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.53"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746594"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646229.681725"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(89)90031-0"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264320"},{"key":"e_1_3_2_1_6_1","volume-title":"On a Routing Problem. Quarterly of Applied Mathematics","author":"Bellman R.","year":"1958","unstructured":"R. Bellman . On a Routing Problem. Quarterly of Applied Mathematics , 1958 . R. Bellman. On a Routing Problem. Quarterly of Applied Mathematics, 1958."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90039-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167488"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30577-4_1"},{"key":"e_1_3_2_1_10_1","volume-title":"ICALP","author":"Bodlaender H. L.","year":"1988","unstructured":"H. L. Bodlaender . Dynamic programming on graphs with bounded treewidth . In ICALP , LNCS. Springer , 1988 . H. L. Bodlaender. Dynamic programming on graphs with bounded treewidth. In ICALP, LNCS. Springer, 1988."},{"key":"e_1_3_2_1_11_1","volume-title":"Acta Cybern.","author":"Bodlaender H. L.","year":"1993","unstructured":"H. L. Bodlaender . A tourist guide through treewidth . Acta Cybern. , 1993 . H. L. Bodlaender. A tourist guide through treewidth. Acta Cybern., 1993."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251219"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795289859"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604137"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11590156_28"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85778-5_4"},{"key":"e_1_3_2_1_17_1","volume-title":"Reliable Software Technologies - Ada-Europe","author":"Burgstaller B.","year":"2004","unstructured":"B. Burgstaller , J. Blieberger , and B. Scholz . On the tree width of ada programs . In Reliable Software Technologies - Ada-Europe 2004 . B. Burgstaller, J. Blieberger, and B. Scholz. On the tree width of ada programs. In Reliable Software Technologies - Ada-Europe 2004."},{"key":"e_1_3_2_1_18_1","unstructured":"2004.  2004."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429085"},{"key":"e_1_3_2_1_20_1","volume-title":"CAV","author":"Cerny P.","year":"2015","unstructured":"P. Cerny , E. M. Clarke , T. A. Henzinger , A. Radhakrishna , L. Ryzhyk , R. Samanta , and T. Tarrach . From non-preemptive to preemptive scheduling using synchronization synthesis . In CAV , 2015 . P. Cerny, E. M. Clarke, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta, and T. Tarrach. From non-preemptive to preemptive scheduling using synchronization synthesis. In CAV, 2015."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2958031.2958116"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1805950.1805953"},{"key":"e_1_3_2_1_23_1","volume-title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components. CoRR, abs\/1510.07565","author":"Chatterjee K.","year":"2015","unstructured":"K. Chatterjee , A. K. Goharshady , R. Ibsen-Jensen , and A. Pavlogiannis . Algorithms for algebraic path properties in concurrent systems of constant treewidth components. CoRR, abs\/1510.07565 , 2015 . URL http:\/\/arxiv.org\/abs\/1510.07565. K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. CoRR, abs\/1510.07565, 2015. URL http:\/\/arxiv.org\/abs\/1510.07565."},{"key":"e_1_3_2_1_24_1","volume-title":"CAV","author":"Chatterjee K.","year":"2015","unstructured":"K. Chatterjee , R. Ibsen-Jensen , and A. Pavlogiannis . Faster algorithms for quantitative verification in constant treewidth graphs . In CAV , 2015 . K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis. Faster algorithms for quantitative verification in constant treewidth graphs. In CAV, 2015."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676979"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676968"},{"key":"e_1_3_2_1_27_1","volume-title":"Part I: Sequential Algorithms. Algorithmica","author":"Chaudhuri S.","year":"1995","unstructured":"S. Chaudhuri and C. D. Zaroliagis . Shortest Paths in Digraphs of Small Treewidth . Part I: Sequential Algorithms. Algorithmica , 1995 . S. Chaudhuri and C. D. Zaroliagis. Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms. Algorithmica, 1995."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375620"},{"key":"e_1_3_2_1_29_1","volume-title":"Handbook of Theoretical Computer Science (Vol. B)","author":"Courcelle B.","year":"1990","unstructured":"B. Courcelle . Graph rewriting: An algebraic and logic approach . In Handbook of Theoretical Computer Science (Vol. B) . MIT Press , Cambridge, MA, USA , 1990 . B. Courcelle. Graph rewriting: An algebraic and logic approach. In Handbook of Theoretical Computer Science (Vol. B). MIT Press, Cambridge, MA, USA, 1990."},{"key":"e_1_3_2_1_30_1","volume-title":"Springer-Verlag","author":"De A.","year":"2011","unstructured":"A. De , D. D\u2019Souza , and R. Nasre . Dataflow analysis for dataracefree programs. ESOP\u201911\/ETAPS\u201911, pages 196\u2013215 . Springer-Verlag , 2011 . A. De, D. D\u2019Souza, and R. Nasre. Dataflow analysis for dataracefree programs. ESOP\u201911\/ETAPS\u201911, pages 196\u2013215. Springer-Verlag, 2011."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199461"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040291.1040292"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.21"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763507.1763521"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429086"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/155332.155349"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/646680.702325"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01917434"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213024"},{"key":"e_1_3_2_1_42_1","volume-title":"CONCUR.","author":"Harel D.","year":"1997","unstructured":"D. Harel , O. Kupferman , and M. Vardi . On the complexity of verifying concurrent transition systems . In CONCUR. 1997 . D. Harel, O. Kupferman, and M. Vardi. On the complexity of verifying concurrent transition systems. In CONCUR. 1997."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746609"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/222132.222146"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1595696.1595701"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-013-0274-1"},{"key":"e_1_3_2_1_48_1","volume-title":"Discrete Mathematics","author":"Karp R. M.","year":"1978","unstructured":"R. M. Karp . A characterization of the minimum cycle mean in a digraph . Discrete Mathematics , 1978 . R. M. Karp. A characterization of the minimum cycle mean in a digraph. Discrete Mathematics, 1978."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/512927.512945"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400882618-002"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/229542.229545"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37051-9_1"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792762"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-009-0078-9"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792761"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_32"},{"key":"e_1_3_2_1_57_1","volume-title":"Networks and Matroids","author":"Lawler E.","year":"1976","unstructured":"E. Lawler . Combinatorial Optimization : Networks and Matroids . Saunders College Publishing , 1976 . E. Lawler. Combinatorial Optimization: Networks and Matroids. Saunders College Publishing, 1976."},{"key":"e_1_3_2_1_58_1","volume-title":"Theoretical Computer Science","author":"Lehmann D. J.","year":"1977","unstructured":"D. J. Lehmann . Algebraic structures for transitive closure . Theoretical Computer Science , 1977 . D. J. Lehmann. Algebraic structures for transitive closure. Theoretical Computer Science, 1977."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926419"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11970-5_8"},{"key":"e_1_3_2_1_61_1","volume-title":"CAV","author":"Obdrz\u00e1lek J.","year":"2003","unstructured":"J. Obdrz\u00e1lek . Fast mu-calculus model checking when tree-width is bounded . In CAV , 2003 . J. Obdrz\u00e1lek. Fast mu-calculus model checking when tree-width is bounded. In CAV, 2003."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_7"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129734"},{"key":"e_1_3_2_1_64_1","first-page":"978","article-title":"Demand interprocedural program analysis using logic databases","volume":"296","author":"Reps T.","year":"1995","unstructured":"T. Reps . Demand interprocedural program analysis using logic databases . In Applications of Logic Databases , volume 296 . 1995 . ISBN 978 - 971 -4613-5926-5. T. Reps. Demand interprocedural program analysis using logic databases. In Applications of Logic Databases, volume 296. 1995. ISBN 978-1-4613-5926-5.","journal-title":"Applications of Logic Databases"},{"key":"e_1_3_2_1_65_1","volume-title":"ILPS","author":"Reps T.","year":"1997","unstructured":"T. Reps . Program analysis via graph reachability . ILPS , 1997 . T. Reps. Program analysis via graph reachability. ILPS, 1997."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199462"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90013-3"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(96)00072-2"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85114-1_19"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2697"},{"key":"e_1_3_2_1_71_1","volume-title":"CASCON \u201999","author":"Vall\u00e9e-Rai R.","year":"1999","unstructured":"R. Vall\u00e9e-Rai , P. Co , E. Gagnon , L. Hendren , P. Lam , and V. Sundaresan . Soot - a java bytecode optimization framework . In CASCON \u201999 . IBM Press , 1999 . R. Vall\u00e9e-Rai, P. Co, E. Gagnon, L. Hendren, P. Lam, and V. Sundaresan. Soot - a java bytecode optimization framework. In CASCON \u201999. IBM Press, 1999."},{"key":"e_1_3_2_1_72_1","volume-title":"Computing treewidth with libtw. Technical report","author":"van Dijk T.","year":"2006","unstructured":"T. van Dijk , J.-P. van den Heuvel , and W. Slob . Computing treewidth with libtw. Technical report , University of Utrecht , 2006 . T. van Dijk, J.-P. van den Heuvel, and W. Slob. Computing treewidth with libtw. Technical report, University of Utrecht, 2006."},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054010"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/1347375.1347389"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001440"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1142\/S012962649700036X"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/502949.502888"}],"event":{"name":"POPL '16: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"St. Petersburg FL USA","acronym":"POPL '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837624","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2837614.2837624","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:43:37Z","timestamp":1750211017000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,11]]},"references-count":77,"alternative-id":["10.1145\/2837614.2837624","10.1145\/2837614"],"URL":"https:\/\/doi.org\/10.1145\/2837614.2837624","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2914770.2837624","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,1,11]]},"assertion":[{"value":"2016-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}