{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:42Z","timestamp":1772164062891,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T00:00:00Z","timestamp":1389139200000},"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,1,8]]},"DOI":"10.1145\/2535838.2535843","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T08:40:06Z","timestamp":1389688806000},"page":"529-540","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["Abstract acceleration of general linear loops"],"prefix":"10.1145","author":[{"given":"Bertrand","family":"Jeannet","sequence":"first","affiliation":[{"name":"INRIA, Grenoble, France"}]},{"given":"Peter","family":"Schrammel","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}]},{"given":"Sriram","family":"Sankaranarayanan","sequence":"additional","affiliation":[{"name":"University of Colorado, Boulder, CO, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,1,8]]},"reference":[{"key":"e_1_3_2_2_1_1","series-title":"LNCS","first-page":"117","volume-title":"SAS","author":"Alias C.","year":"2010","unstructured":"C. Alias , A. Darte , P. Feautrier , and L. Gonnord . Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs . In SAS , volume 6337 of LNCS , pages 117 -- 133 , 2010 . C. Alias, A. Darte, P. Feautrier, and L. Gonnord. Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs. In SAS, volume 6337 of LNCS, pages 117--133, 2010."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2010.09.002"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-008-0064-3"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781153"},{"key":"e_1_3_2_2_5_1","series-title":"LNCS","volume-title":"CAV","author":"Boigelot B.","year":"1996","unstructured":"B. Boigelot and P. Godefroid . Symbolic verification of communication protocols with infinite state spaces using QDDs . In CAV , volume 1102 of LNCS , July 1996 . B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In CAV, volume 1102 of LNCS, July 1996."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11319-2_11"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45069-6_39"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512770"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512770"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-009-0089-6"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2010.09.014"},{"key":"e_1_3_2_2_12_1","series-title":"LNCS","first-page":"33","volume-title":"ESOP","author":"Feret J.","year":"2004","unstructured":"J. Feret . Static analysis of digital filters . In ESOP , volume 2986 of LNCS , pages 33 -- 48 , 2004 . J. Feret. Static analysis of digital filters. In ESOP, volume 2986 of LNCS, pages 33--48, 2004."},{"key":"e_1_3_2_2_13_1","volume-title":"Numerical and Symbolic Abstract Domains","author":"Feret J.","year":"2005","unstructured":"J. Feret . Numerical abstract domains for digital filters . In Numerical and Symbolic Abstract Domains , 2005 . J. Feret. Numerical abstract domains for digital filters. In Numerical and Symbolic Abstract Domains, 2005."},{"key":"e_1_3_2_2_14_1","series-title":"LNCS","first-page":"145","volume-title":"FSTTCS","author":"Finkel A.","year":"2002","unstructured":"A. Finkel and J. Leroux . How to compose Presburger-accelerations: Applications to broadcast protocols . In FSTTCS , volume 2556 of LNCS , pages 145 -- 156 , 2002 . A. Finkel and J. Leroux. How to compose Presburger-accelerations: Applications to broadcast protocols. In FSTTCS, volume 2556 of LNCS, pages 145--156, 2002."},{"key":"e_1_3_2_2_15_1","series-title":"LNCS","volume-title":"ESOP","author":"Gaubert S.","year":"2007","unstructured":"S. Gaubert , E. Goubault , A. Taly , and S. Zennou . Static analysis by policy iteration on relational domains . In ESOP , volume 4421 of LNCS , 2007 . S. Gaubert, E. Goubault, A. Taly, and S. Zennou. Static analysis by policy iteration on relational domains. In ESOP, volume 4421 of LNCS, 2007."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2392389.2392396"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.12.048"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823230_10"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_48"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04761-9_23"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_52"},{"key":"e_1_3_2_2_22_1","unstructured":"B. Jeannet M. Argoud and G. Lalire. The INTERPROC interprocedural analyzer. http:\/\/pop-art.inrialpes.fr\/interproc\/interprocweb.cgi.  B. Jeannet M. Argoud and G. Lalire. The INTERPROC interprocedural analyzer. http:\/\/pop-art.inrialpes.fr\/interproc\/interprocweb.cgi."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535843"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00290339"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29709-0_20"},{"key":"e_1_3_2_2_26_1","series-title":"LNCS","first-page":"349","volume-title":"CSR","author":"Kov\u00e1cs L.","year":"2008","unstructured":"L. Kov\u00e1cs . Invariant generation for p-solvable loops with assignments . In CSR , volume 5010 of LNCS , pages 349 -- 359 , 2008 . L. Kov\u00e1cs. Invariant generation for p-solvable loops with assignments. In CSR, volume 5010 of LNCS, pages 349--359, 2008."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2001.0472"},{"key":"e_1_3_2_2_28_1","volume-title":"The Theory of Matrices","author":"Lancaster P.","year":"1984","unstructured":"P. Lancaster and M. Tismenetsky . The Theory of Matrices ( 2 nd edition). Academic Press , 1984 . P. Lancaster and M. Tismenetsky. The Theory of Matrices (2nd edition). Academic Press, 1984.","edition":"2"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/832308.837141"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11609773_23"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_21"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480899"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-32698-7_2"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185632.2185651"},{"key":"e_1_3_2_2_35_1","series-title":"LNCS","first-page":"686","volume-title":"CAV","author":"Sankaranarayanan S.","year":"2011","unstructured":"S. Sankaranarayanan and A. Tiwari . Relational abstractions for continuous and hybrid systems . In CAV , volume 6806 of LNCS , pages 686 -- 702 . Springer , 2011 . S. Sankaranarayanan and A. Tiwari. Relational abstractions for continuous and hybrid systems. In CAV, volume 6806 of LNCS, pages 686--702. Springer, 2011."},{"key":"e_1_3_2_2_36_1","series-title":"LNCS","first-page":"53","volume-title":"SAS","author":"Sankaranarayanan S.","year":"2004","unstructured":"S. Sankaranarayanan , H. B. Sipma , and Z. Manna . Constraint-based linear-relations analysis . In SAS , volume 3148 of LNCS , pages 53 -- 68 , 2004 . S. Sankaranarayanan, H. B. Sipma, and Z. Manna. Constraint-based linear-relations analysis. In SAS, volume 3148 of LNCS, pages 53--68, 2004."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_2"},{"key":"e_1_3_2_2_38_1","series-title":"LNCS","first-page":"233","volume-title":"SAS","author":"Schrammel P.","year":"2011","unstructured":"P. Schrammel and B. Jeannet . Logico-numerical abstract acceleration and application to the verification of data-flow programs . In SAS , volume 6887 of LNCS , pages 233 -- 248 , 2011 . P. Schrammel and B. Jeannet. Logico-numerical abstract acceleration and application to the verification of data-flow programs. In SAS, volume 6887 of LNCS, pages 233--248, 2011."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.12.051"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/11924661_11"},{"key":"e_1_3_2_2_41_1","series-title":"LNCS","first-page":"514","volume-title":"HSCC","author":"Tiwari A.","year":"2003","unstructured":"A. Tiwari . Approximate reachability for linear systems. In HSCC , volume 2623 of LNCS , pages 514 -- 525 . Springer , 2003 . A. Tiwari. Approximate reachability for linear systems. In HSCC, volume 2623 of LNCS, pages 514--525. Springer, 2003."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2004.1383661"}],"event":{"name":"POPL '14: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"San Diego California USA","acronym":"POPL '14","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535838.2535843","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2535838.2535843","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:24Z","timestamp":1750221564000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535838.2535843"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,8]]},"references-count":42,"alternative-id":["10.1145\/2535838.2535843","10.1145\/2535838"],"URL":"https:\/\/doi.org\/10.1145\/2535838.2535843","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2578855.2535843","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2014,1,8]]},"assertion":[{"value":"2014-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}