{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T17:40:08Z","timestamp":1749318008285,"version":"3.41.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031937057","type":"print"},{"value":"9783031937064","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-93706-4_6","type":"book-chapter","created":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T17:22:39Z","timestamp":1749316959000},"page":"91-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Vellvm: Formalizing the\u00a0Informal LLVM"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3469-7219","authenticated-orcid":false,"given":"Calvin","family":"Beck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4486-7222","authenticated-orcid":false,"given":"Hanxi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3516-1512","authenticated-orcid":false,"given":"Steve","family":"Zdancewic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,8]]},"reference":[{"key":"6_CR1","unstructured":"A selection of bugs discovered in clang\/vellvm with genllvm (2024). https:\/\/github.com\/vellvm\/vellvm\/issues?q=is%3Aissue+label%3Aqc-discovered-bug+"},{"key":"6_CR2","unstructured":"Extractvalue with packed struct with vector off-by-one error (2025). https:\/\/github.com\/llvm\/llvm-project\/issues\/124061"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Beck, C., Yoon, I., Chen, H., Zakowski, Y., Zdancewic, S.: A two-phase infinite\/finite low-level memory model (2024). https:\/\/doi.org\/10.5281\/zenodo.12518800","DOI":"10.5281\/zenodo.12518800"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Beck, C., Yoon, I., Chen, H., Zakowski, Y., Zdancewic, S.: A two-phase infinite\/finite low-level memory model: reconciling integer-pointer casts, finite space, and undef at the LLVM IR level of abstraction. Proc. ACM Program. Lang. 8(ICFP) (2024). https:\/\/doi.org\/10.1145\/3674652","DOI":"10.1145\/3674652"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Chappe, N., He, P., Henrio, L., Zakowski, Y., Zdancewic, S.: Choice trees: representing nondeterministic, recursive, and impure programs in coq. Proc. ACM Program. Lang. 7(POPL) (2023). https:\/\/doi.org\/10.1145\/3571254","DOI":"10.1145\/3571254"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Chappe, N., Henrio, L., Zakowski, Y.: Monadic interpreters for concurrent memory models: executable semantics of a concurrent subset of LLVM IR. In: CPP 2025. Association for Computing Machinery (2025). https:\/\/perso.ens-lyon.fr\/nicolas.chappe\/muvellvm-concurrency-draft.pdf","DOI":"10.1145\/3703595.3705890"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Choi, J., Vijayaraghavan, M., Sherman, B., Chlipala, A., Arvind: Kami: a platform for high-level parametric hardware specification and its modular verification. Proc. ACM Program. Lang. 1(ICFP) (2017). https:\/\/doi.org\/10.1145\/3110268","DOI":"10.1145\/3110268"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Delaware, B., Pit-Claudel, C., Gross, J., Chlipala, A.: Fiat: deductive synthesis of abstract data types in a proof assistant. In: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, pp. 689\u2013700. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2676726.2677006","DOI":"10.1145\/2676726.2677006"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-319-17524-9_34","volume-title":"NASA Formal Methods","author":"G Eakman","year":"2015","unstructured":"Eakman, G., Reubenstein, H., Hawkins, T., Jain, M., Manolios, P.: Practical formal verification of domain-specific language applications. In: Havelund, K., Holzmann, G., Joshi, R. (eds.) NASA Formal Methods, pp. 443\u2013449. Springer, Cham (2015)"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Hoang, T., Trunov, A., Lampropoulos, L., Sergey, I.: Random testing of a higher-order blockchain language (experience report). Proc. ACM Program. Lang. 6(ICFP) (2022). https:\/\/doi.org\/10.1145\/3547653","DOI":"10.1145\/3547653"},{"key":"6_CR11","unstructured":"Lattner, C., Adve, V.: LLVM: a compilation framework for lifelong program analysis & transformation. In: Proceedings of the 2004 International Symposium on Code Generation and Optimization (CGO 2004), Palo Alto, California (2004)"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Li, L., Gunter, E.: K-LLVM: a relatively complete semantics of LLVM IR. In: 34rd European Conference on Object-Oriented Programming, ECOOP 2020, Berlin, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2020.7","DOI":"10.4230\/LIPIcs.ECOOP.2020.7"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Liang, S., Hudak, P., Jones, M.: Monad transformers and modular interpreters. In: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1995, pp. 333\u2013343. Association for Computing Machinery, New York (1995). https:\/\/doi.org\/10.1145\/199448.199528","DOI":"10.1145\/199448.199528"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Livinskii, V., Babokin, D., Regehr, J.: Random testing for C and C++ compilers with YARPGen. Proc. ACM Program. Lang. 4(OOPSLA), 1\u201325 (2020). https:\/\/doi.org\/10.1145\/3428264","DOI":"10.1145\/3428264"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Livinskii, V., Babokin, D., Regehr, J.: Fuzzing loop optimizations in compilers for C++ and data-parallel languages. Proc. ACM Program. Lang. 7(PLDI), 1826\u20131847 (2023). https:\/\/doi.org\/10.1145\/3591295","DOI":"10.1145\/3591295"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Lopes, N.P., Lee, J., Hur, C.K., Liu, Z., Regehr, J.: Alive2: bounded translation validation for LLVM. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, PLDI 2021, pp. 65\u201379. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3453483.3454030","DOI":"10.1145\/3453483.3454030"},{"key":"6_CR17","unstructured":"Maguire, S.: ecstasy: a ghc.generics based entity component system (2018). https:\/\/hackage.haskell.org\/package\/ecstasy"},{"key":"6_CR18","unstructured":"Maguire, S.: Why take ecstasy (2018). https:\/\/reasonablypolymorphic.com\/blog\/why-take-ecstasy\/index.html"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Memarian, K., et al.: Into the depths of C: elaborating the de facto standards. In: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2016, pp. 1\u201315. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2908080.2908081","DOI":"10.1145\/2908080.2908081"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-319-22102-1_22","volume-title":"Interactive Theorem Proving","author":"Z Paraskevopoulou","year":"2015","unstructured":"Paraskevopoulou, Z., Hri\u0163cu, C., D\u00e9n\u00e8s, M., Lampropoulos, L., Pierce, B.C.: Foundational property-based testing. In: Urban, C., Zhang, X. (eds.) ITP 2015. LNCS, vol. 9236, pp. 325\u2013343. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22102-1_22"},{"key":"6_CR21","unstructured":"LLVM-admin team: LLVM (2024). https:\/\/llvm.org\/"},{"key":"6_CR22","unstructured":"LLVM-admin team: LLVM Language Reference Manual (2024). https:\/\/llvm.org\/docs\/LangRef.html, documentation"},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Xia, L., et al.: Interaction trees: representing recursive and impure programs in coq. Proc. ACM Program. Lang. 4(POPL) (2019). https:\/\/doi.org\/10.1145\/3371119","DOI":"10.1145\/3371119"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Yang, X., Chen, Y., Eide, E., Regehr, J.: Finding and understanding bugs in C compilers. In: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2011, pp. 283\u2013294. Association for Computing Machinery, New York (2011). https:\/\/doi.org\/10.1145\/1993498.1993532","DOI":"10.1145\/1993498.1993532"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Zakowski, Y., Beck, C., Yoon, I., Zaichuk, I., Zaliva, V., Zdancewic, S.: Modular, compositional, and executable formal semantics for LLVM IR. Proc. ACM Program. Lang. 5(ICFP) (2021). https:\/\/doi.org\/10.1145\/3473572","DOI":"10.1145\/3473572"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Zakowski, Y., Beck, C., Yoon, I., Zaichuk, I., Zaliva, V., Zdancewic, S.: Modular, compositional, and executable formal semantics for LLVM IR. Proc. ACM Program. Lang. 5(ICFP) (2021)","DOI":"10.1145\/3473572"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-63618-0_3","volume-title":"Software Verification","author":"V Zaliva","year":"2020","unstructured":"Zaliva, V., Zaichuk, I., Franchetti, F.: Verified translation between purely functional and imperative domain specific languages in HELIX. In: Christakis, M., Polikarpova, N., Duggirala, P.S., Schrammel, P. (eds.) NSV\/VSTTE -2020. LNCS, vol. 12549, pp. 33\u201349. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63618-0_3"},{"key":"6_CR28","unstructured":"Zdancewic, S., et\u00a0al.: Vellvm (2024). https:\/\/github.com\/vellvm\/vellvm"},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Zhao, J., Nagarakatte, S., Martin, M.M., Zdancewic, S.: Formal verification of SSA-based optimizations for LLVM. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2013, pp. 175\u2013186. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2491956.2462164","DOI":"10.1145\/2491956.2462164"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-93706-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T17:22:42Z","timestamp":1749316962000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-93706-4_6"}},"subtitle":["(Experience Report)"],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031937057","9783031937064"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-93706-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"8 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hampton Roads, VA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/shemesh.larc.nasa.gov\/nfm2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}