{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T17:06:23Z","timestamp":1761930383261,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031681493"},{"type":"electronic","value":"9783031681509"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-68150-9_9","type":"book-chapter","created":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T12:02:22Z","timestamp":1724155342000},"page":"152-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Verifying a\u00a0Radio Telescope Pipeline Using HaliVer: Solving Nonlinear and\u00a0Quantifier Challenges"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0330-5016","authenticated-orcid":false,"given":"Lars B.","family":"van den Haak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2071-9624","authenticated-orcid":false,"given":"Anton","family":"Wijs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4467-072X","authenticated-orcid":false,"given":"Marieke","family":"Huisman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3529-6182","authenticated-orcid":false,"given":"Mark","family":"van den Brand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,21]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-319-66845-1_7","volume-title":"Integrated Formal Methods","author":"S Blom","year":"2017","unstructured":"Blom, S., Darabi, S., Huisman, M., Oortwijn, W.: The VerCors tool set: verification of parallel and concurrent software. In: Polikarpova, N., Schneider, S. (eds.) IFM 2017. LNCS, vol. 10510, pp. 102\u2013110. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66845-1_7"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bornat, R., Calcagno, C., O\u2019Hearn, P., Parkinson, M.: Permission accounting in separation logic. In: POPL, pp. 259\u2013270 (2005)","DOI":"10.1145\/1047659.1040327"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-319-94144-8_23","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2018","author":"A Cimatti","year":"2018","unstructured":"Cimatti, A., Griggio, A., Irfan, A., Roveri, M., Sebastiani, R.: Experimenting on solving nonlinear integer arithmetic with incremental linearization. In: Beyersdorff, O., Wintersteiger, C. (eds.) SAT 2018. LNCS, vol. 10929, pp. 383\u2013398. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_23"},{"issue":"OOPSLA1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3527328","volume":"6","author":"B Cl\u00e9ment","year":"2022","unstructured":"Cl\u00e9ment, B., Cohen, A.: End-to-end translation validation for the halide language. Proc. ACM Program. Lang. 6(OOPSLA1), 1\u201330 (2022). https:\/\/doi.org\/10.1145\/3527328","journal-title":"Proc. ACM Program. Lang."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"A20","DOI":"10.1051\/0004-6361\/202244316","volume":"669","author":"H Gan","year":"2023","unstructured":"Gan, H., et al.: Assessing the impact of two independent direction-dependent calibration algorithms on the LOFAR 21 cm signal power spectrum - and applications to an observation of a field flanking the north celestial pole. Astron. Astrophys. 669, A20 (2023). https:\/\/doi.org\/10.1051\/0004-6361\/202244316","journal-title":"Astron. Astrophys."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01700692","volume":"38","author":"K G\u00f6del","year":"1931","unstructured":"G\u00f6del, K.: \u00dcber formal unentscheidbare S\u00e4tze der principia mathematica und verwandter Systeme I. Monatshefte Math. Phys. 38, 173\u2013198 (1931)","journal-title":"Monatshefte Math. Phys."},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Hamaker, J.P., Bregman, J.D., Sault, R.J.: Understanding radio polarimetry. I. Mathematical foundations. Astron. Astrophys. Suppl. Ser. 117(1), 137\u2013147 (1996). https:\/\/doi.org\/10.1051\/aas:1996146","DOI":"10.1051\/aas:1996146"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Hozzov\u00e1, P., Bend\u00edk, J., Nutz, A., Rodeh, Y.: Overapproximation of non-linear integer arithmetic for smart contract verification. In: EPiC Series in Computing, vol.\u00a094, pp. 257\u2013269. EasyChair (2023). https:\/\/doi.org\/10.29007\/h4p7","DOI":"10.29007\/h4p7"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-319-52234-0_18","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"D Jovanovi\u0107","year":"2017","unstructured":"Jovanovi\u0107, D.: Solving nonlinear integer arithmetic with MCSAT. In: Bouajjani, A., Monniaux, D. (eds.) VMCAI 2017. LNCS, vol. 10145, pp. 330\u2013346. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52234-0_18"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-319-45641-6_21","volume-title":"Computer Algebra in Scientific Computing","author":"G Kremer","year":"2016","unstructured":"Kremer, G., Corzilius, F., \u00c1brah\u00e1m, E.: A generalised branch-and-bound approach and its application in SAT modulo nonlinear integer arithmetic. In: Gerdt, V., Koepf, W., Seiler, W., Vorozhtsov, E. (eds.) CASC 2016. LNCS, vol. 9890, pp. 315\u2013335. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45641-6_21"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Leiserson, C.E., et al.: There\u2019s plenty of room at the top: what will drive computer performance after Moore\u2019s law? Sci. (New York, N.Y.) 368(6495) (2020). https:\/\/doi.org\/10.1126\/science.aam9744","DOI":"10.1126\/science.aam9744"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Liu, A., Bernstein, G.L., Chlipala, A., Ragan-Kelley, J.: Verified tensor-program optimization via high-level scheduling rewrites. Proc. ACM on Program. Lang. 6(POPL), 55:1\u201355:28 (2022). https:\/\/doi.org\/10.1145\/3498717","DOI":"10.1145\/3498717"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-662-49122-5_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P M\u00fcller","year":"2016","unstructured":"M\u00fcller, P., Schwerhoff, M., Summers, A.: Viper - a verification infrastructure for permission-based reasoning. In: Jobstmann, B., Leino, K. (eds.) VMCAI 2016. LNCS, vol. 9583, pp. 41\u201362. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49122-5_2"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-319-41528-4_22","volume-title":"Computer Aided Verification","author":"P M\u00fcller","year":"2016","unstructured":"M\u00fcller, P., Schwerhoff, M., Summers, A.J.: Automatic verification of iterated separating conjunctions using symbolic execution. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 405\u2013425. Springe, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_22"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1145\/3150211","volume":"61","author":"J Ragan-Kelley","year":"2017","unstructured":"Ragan-Kelley, J., et al.: Halide: decoupling algorithms from schedules for high-performance image processing. Commun. ACM 61(1), 106\u2013115 (2017). https:\/\/doi.org\/10.1145\/3150211","journal-title":"Commun. ACM"},{"issue":"6","key":"9_CR17","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1145\/2499370.2462176","volume":"48","author":"J Ragan-Kelley","year":"2013","unstructured":"Ragan-Kelley, J., Barnes, C., Adams, A., Paris, S., Durand, F., Amarasinghe, S.: Halide: a language and compiler for optizing parallelism, locality, and recomputation in image processing pipelines. SIGPLAN Not. 48(6), 519\u2013530 (2013). https:\/\/doi.org\/10.1145\/2499370.2462176","journal-title":"SIGPLAN Not."},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-030-99527-0_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"\u00d6 Sakar","year":"2022","unstructured":"Sakar, \u00d6., Safari, M., Huisman, M., Wijs, A.: Alpinist: an annotation-aware GPU program optimizer. In: Fisman, D., Rosu, G. (eds.) TACAS 2022. LNCS, vol. 13244, pp. 332\u2013332. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_18"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"van den Haak, L.B.: Artifact for: HaliVer: deductive verification and scheduling languages join forces. Zenodo (2023). https:\/\/doi.org\/10.5281\/zenodo.10047853","DOI":"10.5281\/zenodo.10047853"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-031-57256-2_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"LB van den Haak","year":"2024","unstructured":"van den Haak, L.B., Wijs, A., Huisman, M., van den Brand, M.: HaliVer: deductive verification and scheduling languages join forces. In: Finkbeiner, B., Kov\u00e1cs, L. (eds.) TACAS 2024. LNCS, vol. 14572, pp. 71\u201389. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57256-2_4"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Industrial Critical Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68150-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T12:03:36Z","timestamp":1724155416000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68150-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031681493","9783031681509"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68150-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"21 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FMICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Methods for Industrial Critical Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fmics2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.fm24.polimi.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}