{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T06:26:39Z","timestamp":1748413599947,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030959524"},{"type":"electronic","value":"9783030959531"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95953-1_15","type":"book-chapter","created":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T19:49:53Z","timestamp":1644954593000},"page":"215-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Verification of\u00a0Vectorization of\u00a0Signal Transforms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7067-1462","authenticated-orcid":false,"given":"Patrick","family":"Brinich","sequence":"first","affiliation":[]},{"given":"Jeremy","family":"Johnson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,16]]},"reference":[{"key":"15_CR1","volume-title":"Optimizing Compilers for Modern Architectures: A Dependence-based Approach","author":"R Allen","year":"2002","unstructured":"Allen, R., Kennedy, K.: Optimizing Compilers for Modern Architectures: A Dependence-based Approach. Morgan Kaufmann Publishers, San Francisco (2002)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Almeida, J.B., et al.: The last mile: high-assurance and high-speed cryptographic implementations. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 965\u2013982 (2020)","DOI":"10.1109\/SP40000.2020.00028"},{"key":"15_CR3","doi-asserted-by":"publisher","unstructured":"Barthe, G., Crespo, J.M., Gulwani, S., Kunz, C., Marron, M.: From relational verification to simd loop synthesis. In: Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 123\u2013134. PPoPP 2013, Association for Computing Machinery, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2442516.2442529","DOI":"10.1145\/2442516.2442529"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-22792-9_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G Barthe","year":"2011","unstructured":"Barthe, G., Gr\u00e9goire, B., Heraud, S., B\u00e9guelin, S.Z.: Computer-aided security proofs for the working cryptographer. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 71\u201390. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_5"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1007\/11946441_74","volume-title":"Parallel and Distributed Processing and Applications","author":"A Bonelli","year":"2006","unstructured":"Bonelli, A., Franchetti, F., Lorenz, J., P\u00fcschel, M., Ueberhuber, C.W.: Automatic performance optimization of the discrete fourier transform on distributed memory computers. In: Guo, M., Yang, L.T., Di Martino, B., Zima, H.P., Dongarra, J., Tang, F. (eds.) ISPA 2006. LNCS, vol. 4330, pp. 818\u2013832. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11946441_74"},{"key":"15_CR6","unstructured":"Brinich, P.: Formal Verification of SPIRAL Generated Code. Master\u2019s thesis, Drexel University (2020)"},{"key":"15_CR7","unstructured":"Cadar, C., Dunbar, D., Engler, D.: Klee: unassisted and automatic generation of high-coverage tests for complex systems programs. In: Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation, pp. 209\u2013224. OSDI 2008, USENIX Association, USA (2008)"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"Collingbourne, P., Cadar, C., Kelly, P.H.: Symbolic crosschecking of floating-point and simd code. In: Proceedings of the Sixth Conference on Computer Systems, pp. 315\u2013328. EuroSys 2011, Association for Computing Machinery, New York, NY, USA (2011). https:\/\/doi.org\/10.1145\/1966445.1966475","DOI":"10.1145\/1966445.1966475"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Dutta, S.: Validation of parallelizing transformations of sequential programs. Concurr. Comput. Pract. Exp. 29(8), e3958 (2017). https:\/\/doi.org\/10.1002\/cpe.3958, https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/cpe.3958, e3958 cpe.3958","DOI":"10.1002\/cpe.3958"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"103","author":"M Felleisen","year":"1992","unstructured":"Felleisen, M., Hieb, R.: The revised report on the syntactic theories of sequential control and state. Theor. Comput. Sci. 103(2), 235\u2013271 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90014-7","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/MCS.2016.2643244","volume":"37","author":"F Franchetti","year":"2017","unstructured":"Franchetti, F., et al.: High-assurance SPIRAL: end-to-end guarantees for robot and car control. IEEE Control Syst. Mag. 37(2), 82\u2013103 (2017)","journal-title":"IEEE Control Syst. Mag."},{"issue":"11","key":"15_CR12","doi-asserted-by":"publisher","first-page":"1935","DOI":"10.1109\/JPROC.2018.2873289","volume":"106","author":"F Franchetti","year":"2018","unstructured":"Franchetti, F., et al.: SPIRAL: extreme performance portability. Proc. IEEE 106(11), 1935\u20131968 (2018)","journal-title":"Proc. IEEE"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-642-03034-5_18","volume-title":"Domain-Specific Languages","author":"F Franchetti","year":"2009","unstructured":"Franchetti, F., de Mesmay, F., McFarlin, D., P\u00fcschel, M.: Operator language: a program generation framework for fast kernels. In: Taha, W.M. (ed.) DSL 2009. LNCS, vol. 5658, pp. 385\u2013409. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03034-5_18"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-71351-7_28","volume-title":"High Performance Computing for Computational Science - VECPAR 2006","author":"F Franchetti","year":"2007","unstructured":"Franchetti, F., Voronenko, Y., P\u00fcschel, M.: A rewriting system for the vectorization of signal transforms. In: Dayd\u00e9, M., Palma, J.M.L.M., Coutinho, \u00c1.L.G.A., Pacitti, E., Lopes, J.C. (eds.) VECPAR 2006. LNCS, vol. 4395, pp. 363\u2013377. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71351-7_28"},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"Franchetti, F., Voronenko, Y., P\u00fcschel, M.: FFT program generation for shared memory: SMP and multicore (January 2006). https:\/\/doi.org\/10.1145\/1188455.1188575","DOI":"10.1145\/1188455.1188575"},{"key":"15_CR16","doi-asserted-by":"publisher","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969). https:\/\/doi.org\/10.1145\/363235.363259","DOI":"10.1145\/363235.363259"},{"key":"15_CR17","doi-asserted-by":"publisher","unstructured":"Leroy, X.: Formal verification of a realistic compiler. Commun. ACM 52(7), 107\u2013115 (2009). https:\/\/doi.org\/10.1145\/1538788.1538814","DOI":"10.1145\/1538788.1538814"},{"issue":"2","key":"15_CR18","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/JPROC.2004.840306","volume":"93","author":"M P\u00fcschel","year":"2005","unstructured":"P\u00fcschel, M., et al.: SPIRAL: code generation for dsp transforms. Proc. IEEE 93(2), 232\u2013275 (2005)","journal-title":"Proc. IEEE"},{"key":"15_CR19","unstructured":"The Coq Development Team: The Coq Reference Manual, version 8.9.1 (2019). available electronically at https:\/\/coq.inria.fr\/distrib\/V8.9.1\/refman\/"},{"key":"15_CR20","unstructured":"Wolfe, M., Wolfe, M.: High Performance Compilers for Parallel Computing. Addison-Wesley, Boston (1996)"},{"key":"15_CR21","doi-asserted-by":"publisher","unstructured":"Xiong, J., Johnson, J., Johnson, R., Padua, D.: SPL: a language and compiler for DSP algorithms. In: Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation (PLDI 2001), pp. 298\u2013308. Snowbird, Utah (June 2001). https:\/\/doi.org\/10.1145\/378795.378860","DOI":"10.1145\/378795.378860"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95953-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T19:55:35Z","timestamp":1644954935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95953-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030959524","9783030959531"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95953-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LCPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Languages and Compilers for Parallel Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lcpc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"79% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}