{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:14:58Z","timestamp":1750306498076,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,18]],"date-time":"2016-01-18T00:00:00Z","timestamp":1453075200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,18]]},"DOI":"10.1145\/2854065.2854083","type":"proceedings-article","created":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T13:18:57Z","timestamp":1452604737000},"page":"188-196","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Axiomatic semantics for compiler verification"],"prefix":"10.1145","author":[{"given":"Steven","family":"Sch\u00e4fer","sequence":"first","affiliation":[{"name":"Saarland University, Germany"}]},{"given":"Sigurd","family":"Schneider","sequence":"additional","affiliation":[{"name":"Saarland University, Germany"}]},{"given":"Gert","family":"Smolka","sequence":"additional","affiliation":[{"name":"Saarland University, Germany"}]}],"member":"320","published-online":{"date-parts":[[2016,1,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/390013.808479"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1932681.1863590"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(72)90034-0"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/360933.360975"},{"key":"e_1_3_2_1_5_1","first-page":"1976","article-title":"A discipline of programming. Prentice-Hall Series in Automatic Computation","volume":"1","author":"Dijkstra Edsger W","year":"1976","journal-title":"Englewood Cliffs: Prentice-Hall"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Robert W. Floyd . Assigning Meanings to Programs. In J. T. Schwartz editor Proceedings of a Symposium on Applied Mathematics volume 19 of Mathematical Aspects of Computer Science pages 19\u2013 31 Providence 1967 . American Mathematical Society . Robert W. Floyd. Assigning Meanings to Programs. In J. T. Schwartz editor Proceedings of a Symposium on Applied Mathematics volume 19 of Mathematical Aspects of Computer Science pages 19\u201331 Providence 1967. American Mathematical Society.","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"e_1_3_2_1_7_1","unstructured":"Georges Gonthier Assia Mahboubi and Enrico Tassi. A small scale reflection extension for the Coq system. 2008. Georges Gonthier Assia Mahboubi and Enrico Tassi. A small scale reflection extension for the Coq system. 2008."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2431407"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538788.1538814"},{"volume-title":"Massachusetts Institute of Technology","year":"1969","author":"Morris James Hiram","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","volume-title":"APPSEM 2000","volume":"2395","author":"Pitts Andrew M.","year":"2000"},{"first-page":"374","volume-title":"Interactive Theorem Proving","author":"Sch\u00e4fer Steven","key":"e_1_3_2_1_13_1"},{"volume-title":"Technical University Munich","year":"2006","author":"Norbert","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Sigurd Schneider Gert Smolka and Sebastian Hack . A linear first-order functional intermediate language for verified compilers. In Christian Urban and Xingyuan Zhang editors Interactive Theorem Proving - 6th International Conference ITP 2015 Nanjing China August 24-27 2015 Proceedings volume 9236 of Lecture Notes in Computer Science pages 344\u2013 358 . Springer 2015. Sigurd Schneider Gert Smolka and Sebastian Hack. A linear first-order functional intermediate language for verified compilers. In Christian Urban and Xingyuan Zhang editors Interactive Theorem Proving - 6th International Conference ITP 2015 Nanjing China August 24-27 2015 Proceedings volume 9236 of Lecture Notes in Computer Science pages 344\u2013358. Springer 2015.","DOI":"10.1007\/978-3-319-22102-1_23"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487241.2487248"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660193.2660201"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/151145"}],"event":{"name":"CPP 2016: Certified Proofs and Programs","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"St. Petersburg FL USA","acronym":"CPP 2016"},"container-title":["Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854065.2854083","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2854065.2854083","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:47Z","timestamp":1750225727000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854065.2854083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,18]]},"references-count":18,"alternative-id":["10.1145\/2854065.2854083","10.1145\/2854065"],"URL":"https:\/\/doi.org\/10.1145\/2854065.2854083","relation":{},"subject":[],"published":{"date-parts":[[2016,1,18]]},"assertion":[{"value":"2016-01-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}