{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:29:55Z","timestamp":1742930995701,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":7,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819975839"},{"type":"electronic","value":"9789819975846"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-7584-6_1","type":"book-chapter","created":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T00:05:39Z","timestamp":1699488339000},"page":"3-8","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Verifying Compiler Optimisations"],"prefix":"10.1007","author":[{"given":"Ian J.","family":"Hayes","sequence":"first","affiliation":[]},{"given":"Mark","family":"Utting","sequence":"additional","affiliation":[]},{"given":"Brae J.","family":"Webb","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,9]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Nipkow, T., Wenzel, M., Paulson, L.C.: Isabelle\/HOL: A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002) https:\/\/doi.org\/10.1007\/3-540-45949-9","DOI":"10.1007\/3-540-45949-9"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S1571-0661(04)80210-X","volume":"51","author":"D Plump","year":"2002","unstructured":"Plump, D.: Essentials of term graph rewriting. Electron. Notes Theor. Comput. Sci. 51, 277\u2013289 (2002). https:\/\/doi.org\/10.1016\/S1571-0661(04)80210-X","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"1_CR3","unstructured":"Stadler, L., W\u00fcrthinger, T., Simon, D., Wimmer, C., M\u00f6ssenb\u00f6ck, H.: Graal IR: an extensible declarative intermediate representation. In: Proceedings of the Asia-Pacific Programming Languages and Compilers Workshop. APPLC \u201913, pp. 1\u20139, February 2013"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Utting, M., Webb, B.J., Hayes, I.J.: Differential testing of a verification framework for compiler optimizations (case study). In: FormaliSE 2023. IEEE (2023)","DOI":"10.1109\/FormaliSE58978.2023.00015"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Webb, B.J., Hayes, I.J., Utting, M.: Verifying term graph optimizations using Isabelle\/HOL. In: Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs. CPP 2023, pp. 320\u2013333. Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3573105.3575673","DOI":"10.1145\/3573105.3575673"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Webb, B.J., Utting, M., Hayes, I.J.: A formal semantics of the GraalVM intermediate representation. In: Hou, Z., Ganesh, V. (eds.) ATVA 2021. LNCS, vol. 12971, pp. 111\u2013126. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88885-5_8","DOI":"10.1007\/978-3-030-88885-5_8"},{"key":"1_CR7","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 \u201911, pp. 283\u2013294. Association for Computing Machinery, New York, NY, USA (2011). https:\/\/doi.org\/10.1145\/1993498.1993532","DOI":"10.1145\/1993498.1993532"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-7584-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T22:06:24Z","timestamp":1703109984000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-7584-6_1"}},"subtitle":["(Invited Paper)"],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819975839","9789819975846"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-7584-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICFEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Engineering Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brisbane, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfem2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/formal-analysis.com\/icfem\/2023\/","order":11,"name":"conference_url","label":"Conference URL","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":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","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":"13","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":"38% - 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":"2","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)"}},{"value":"This proceedings includes one invited paper and eight doctoral symposium papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}