{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:58:45Z","timestamp":1750309125013,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T00:00:00Z","timestamp":1712880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1755890","CCF-1618132","CCF-2139845","CCF-2124116"],"award-info":[{"award-number":["CCF-1755890","CCF-1618132","CCF-2139845","CCF-2124116"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,4,12]]},"DOI":"10.1145\/3597503.3639171","type":"proceedings-article","created":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T16:43:26Z","timestamp":1712940206000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Scalable Relational Analysis via Relational Bound Propagation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5399-9661","authenticated-orcid":false,"given":"Clay","family":"Stevens","sequence":"first","affiliation":[{"name":"Iowa State University, Ames, Iowa, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6686-466X","authenticated-orcid":false,"given":"Hamid","family":"Bagheri","sequence":"additional","affiliation":[{"name":"University of Nebraska-Lincoln, Lincoln, Nebraska, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,4,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3395363.3397347"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2022.3179294"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377816.3381728"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950337"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2015.2419611"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2371401.2371416"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00165-016-0360-8"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568291"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2016.2587646"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-020-09932-6"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2018.00044"},{"volume-title":"Handbook of Modal Logic","author":"Blackburn Patrick","key":"e_1_3_2_1_12_1","unstructured":"Patrick Blackburn, Johan van Benthem, and Frank Wolter. 2006. Handbook of Modal Logic. Elsevier."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14279\/tuj.eceasst.10.145"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2019.02.055"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96145-3_3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2013.15"},{"key":"e_1_3_2_1_17_1","volume-title":"Distributed SAT-Based Computation of Relational Tight Bounds. In APV 2009: Intl. Symposium on Automatic Program Verification","author":"Galeotti Juan P.","year":"2009","unstructured":"Juan P. Galeotti, Nicol\u00e1s Rosner, Carlos L\u00f3pez Pombo, and Marcelo F. Frias. 2009. Distributed SAT-Based Computation of Relational Tight Bounds. In APV 2009: Intl. Symposium on Automatic Program Verification, R\u00edo Cuarto, Argentina, Feb 15, 2009, Unpublished. http:\/\/se.inf.ethz.ch\/old\/events\/apv\/files\/APV09-02.pdf"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1774088.1774560"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2013.6754925"},{"key":"e_1_3_2_1_20_1","volume-title":"Software Abstractions","author":"Jackson D.","unstructured":"D. Jackson. 2012. Software Abstractions (2nd ed.). MIT Press.","edition":"2"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2007.70225"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147249.1147259"},{"key":"e_1_3_2_1_23_1","unstructured":"Peter Kriens Sergey Bronnikov Burkhardt Renz and Daniel Jackson. 2023. Alloy models GitHub repository. https:\/\/github.com\/AlloyTools\/models."},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of FPL. 1--8.","author":"Liu Dong","year":"2016","unstructured":"Dong Liu and Benjamin Carri\u00f3n Sch\u00e4fer. 2016. Efficient and reliable High-Level Synthesis Design Space Explorer for FPGAs. In Proceedings of FPL. 1--8."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3275534"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985863"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149180"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699417"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001429"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2014.07.008"},{"key":"e_1_3_2_1_31_1","volume-title":"Towards making formal methods normal: meeting developers where they are. CoRR abs\/2010.16345","author":"Reid Alastair","year":"2020","unstructured":"Alastair Reid, Luke Church, Shaked Flur, Sarah de Haas, Maritza Johnson, and Ben Laurie. 2020. Towards making formal methods normal: meeting developers where they are. CoRR abs\/2010.16345 (2020). arXiv:2010.16345 https:\/\/arxiv.org\/abs\/2010.16345"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180172"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.485845"},{"key":"e_1_3_2_1_34_1","volume-title":"SAT 2005","author":"Sorensson Niklas","year":"2005","unstructured":"Niklas Sorensson and Niklas Een. 2005. Minisat v1. 13-a sat solver with conflict-clause minimization. SAT 2005, 53 (2005), 1--2."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3416507.3423188"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377811.3380365"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3533767.3534399"},{"key":"e_1_3_2_1_38_1","unstructured":"Clay Stevens and Hamid Bagheri. 2023. Project Website. https:\/\/sites.google.com\/view\/relational-bound-propagation\/home."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-022-00660-4"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71209-1_49"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91271-4_8"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2019.00031"}],"event":{"name":"ICSE '24: IEEE\/ACM 46th International Conference on Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS","Faculty of Engineering of University of Porto"],"location":"Lisbon Portugal","acronym":"ICSE '24"},"container-title":["Proceedings of the IEEE\/ACM 46th International Conference on Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597503.3639171","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3597503.3639171","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3597503.3639171","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:49:12Z","timestamp":1750286952000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597503.3639171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,12]]},"references-count":42,"alternative-id":["10.1145\/3597503.3639171","10.1145\/3597503"],"URL":"https:\/\/doi.org\/10.1145\/3597503.3639171","relation":{},"subject":[],"published":{"date-parts":[[2024,4,12]]},"assertion":[{"value":"2024-04-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}