{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T02:45:16Z","timestamp":1774838716812,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["163117"],"award-info":[{"award-number":["163117"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1145\/3009837.3009885","type":"proceedings-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T16:20:29Z","timestamp":1482423629000},"page":"46-59","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":61,"title":["Fast polyhedra abstract domain"],"prefix":"10.1145","author":[{"given":"Gagandeep","family":"Singh","sequence":"first","affiliation":[{"name":"ETH Zurich, Switzerland"}]},{"given":"Markus","family":"P\u00fcschel","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}]},{"given":"Martin","family":"Vechev","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2017,1]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"ELINA\n  : ETH Library for Numerical Analysis. http:\/\/elina.ethz.ch.  ELINA: ETH Library for Numerical Analysis. http:\/\/elina.ethz.ch."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2007.08.001"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49674-9_55"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781153"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(68)90115-8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512770"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.02.003"},{"key":"e_1_3_2_1_8_1","first-page":"211","volume-title":"Exploiting Sparsity in Difference-Bound Matrices","author":"Gange G.","unstructured":"G. Gange , J. A. Navas , P. Schachte , H. S\u00f8ndergaard , and P. J. Stuckey . Exploiting Sparsity in Difference-Bound Matrices , pages 189\u2013 211 . 2016. G. Gange, J. A. Navas, P. Schachte, H. S\u00f8ndergaard, and P. J. Stuckey. Exploiting Sparsity in Difference-Bound Matrices, pages 189\u2013211. 2016."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21690-4_20"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-006-0013-2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53413-7_12"},{"key":"e_1_3_2_1_12_1","first-page":"129","volume-title":"Principles and Practice of Constraint Programming","author":"Imbert J. L.","year":"1993","unstructured":"J. L. Imbert . Fourier\u2019s elimination : Which to choose ? Principles and Practice of Constraint Programming , pages 117\u2013 129 , 1993 . J. L. Imbert. Fourier\u2019s elimination: Which to choose? Principles and Practice of Constraint Programming, pages 117\u2013129, 1993."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_52"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93900-9_20"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1363686.1363736"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/645774.668110"},{"key":"e_1_3_2_1_18_1","first-page":"17","volume-title":"Proc. European Symposium on Programming (ESOP)","author":"Min\u00e9 A.","year":"2004","unstructured":"A. Min\u00e9 . Relational abstract domains for the detection of floatingpoint run-time errors . In Proc. European Symposium on Programming (ESOP) , pages 3\u2013 17 , 2004 . A. Min\u00e9. Relational abstract domains for the detection of floatingpoint run-time errors. In Proc. European Symposium on Programming (ESOP), pages 3\u201317, 2004."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-8609-1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2010.09.011"},{"key":"e_1_3_2_1_21_1","first-page":"73","volume-title":"Proc. Contributions to the theory of games","volume":"2","author":"Motzkin T. S.","unstructured":"T. S. Motzkin , H. Raiffa , G. L. Thompson , and R. M. Thrall . The double description method . In Proc. Contributions to the theory of games , vol. 2 , pages 51\u2013 73 . 1953. T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall. The double description method. In Proc. Contributions to the theory of games, vol. 2, pages 51\u201373. 1953."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292552"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11547662_23"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2014.08.002"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2738000"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35873-9_23"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54833-8_22"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10936-7_19"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996869"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_15"}],"event":{"name":"POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages","location":"Paris France","acronym":"POPL '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009885","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3009837.3009885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:05:34Z","timestamp":1750259134000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009885"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":29,"alternative-id":["10.1145\/3009837.3009885","10.1145\/3009837"],"URL":"https:\/\/doi.org\/10.1145\/3009837.3009885","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3093333.3009885","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,1]]},"assertion":[{"value":"2017-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}