{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T15:46:44Z","timestamp":1766159204182,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031388279"},{"type":"electronic","value":"9783031388286"}],"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-3-031-38828-6_1","type":"book-chapter","created":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T12:05:32Z","timestamp":1689768332000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["BIRD: A Binary Intermediate Representation for\u00a0Formally Verified Decompilation of\u00a0X86-64 Binaries"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-0989-3869","authenticated-orcid":false,"given":"Daniel","family":"Engel","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6625-1123","authenticated-orcid":false,"given":"Freek","family":"Verbeek","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8663-739X","authenticated-orcid":false,"given":"Binoy","family":"Ravindran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,20]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Barthe, G., Demange, D., Pichardie, D.: A formally verified SSA-based middle-end: Static single assignment meets compcert. In: Proceedings of the 21st European Conference on Programming Languages and Systems. p. 47\u201366. ESOP\u201912, Springer-Verlag, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28869-2_3","DOI":"10.1007\/978-3-642-28869-2_3"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Brumley, D., Jager, I., Avgerinos, T., Schwartz, E.J.: BAP: A binary analysis platform. In: Gopalakrishnan, G., Qadeer, S. (eds.) Computer Aided Verification. pp. 463\u2013469. Springer, Berlin Heidelberg, Berlin, Heidelberg (2011). 0.1007\/978-3-642-22110-1_37","DOI":"10.1007\/978-3-642-22110-1_37"},{"key":"1_CR3","unstructured":"Brumley, D., Lee, J., Schwartz, E.J., Woo, M.: Native x86 decompilation using semantics-preserving structural analysis and iterative control-flow structuring. In: USENIX Security Symposium (2013)"},{"key":"1_CR4","unstructured":"Burk, K., Pagani, F., Kruegel, C., Vigna, G.: Decomperson: How humans decompile and what we can learn from it. In: 31st USENIX Security Symposium (USENIX Security 22), pp. 2765\u20132782. USENIX Association, Boston, MA (Aug 2022) https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/burk"},{"key":"1_CR5","unstructured":"Canzanese, R., Oyer, M., Mancoridis, S., Kam, M.: A survey of reverse engineering tools for the 32-bit microsoft windows environment (01 2005)"},{"key":"1_CR6","unstructured":"Coq Development Team: The coq proof assistant. https:\/\/coq.inria.fr\/ Accessed 12 May 2023"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst. 13(4), 451\u2013490 (oct 1991). https:\/\/doi.org\/10.1145\/115372.115320","DOI":"10.1145\/115372.115320"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Dasgupta, S., Park, D., Kasampalis, T., Adve, V.S., Ro\u015fu, G.: A complete formal semantics of x86\u201364 user-level instruction set architecture. In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 1133\u20131148. PLDI 2019, Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3314221.3314601","DOI":"10.1145\/3314221.3314601"},{"key":"1_CR9","unstructured":"Eagle, C.: The IDA Pro Book: The Unofficial Guide to the World\u2019s Most Popular Disassembler. IT Pro, No Starch Press (2008). https:\/\/books.google.de\/books?id=BoFaZ1dB1H0C"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Hamlen, K.W., Fisher, D., Lundquist, G.R.: Source-free machine-checked validation of native code in coq. In: Proceedings of the 3rd ACM Workshop on Forming an Ecosystem Around Software Transformation, pp. 25\u201330. FEAST\u201919, Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3338502.3359759","DOI":"10.1145\/3338502.3359759"},{"key":"1_CR11","unstructured":"Hex Rays: Ida pro. https:\/\/hex-rays.com\/ida-pro\/ Accessed 12 May 2023"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Kennedy, A., Benton, N., Jensen, J.B., Dagand, P.E.: Coq: The world\u2019s best macro assembler? In: Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, pp. 13\u201324. PPDP \u201913, Association for Computing Machinery, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2505879.2505897","DOI":"10.1145\/2505879.2505897"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Kumar, R., Mullen, E., Tatlock, Z., Myreen, M.O.: Software verification with ITPs should use binary code extraction to reduce the TCB. In: Avigad, J., Mahboubi, A. (eds.) Interactive Theorem Proving, pp. 362\u2013369. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94821-8_21","DOI":"10.1007\/978-3-319-94821-8_21"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Lattner, C., Adve, V.: LLVM: a compilation framework for lifelong program analysis & transformation. In: International Symposium on Code Generation and Optimization, 2004. CGO 2004, pp. 75\u201386 (2004). https:\/\/doi.org\/10.1109\/CGO.2004.1281665","DOI":"10.1109\/CGO.2004.1281665"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Lattner, C., et al.: MLIR: Scaling compiler infrastructure for domain specific computation. In: 2021 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO), pp. 2\u201314 (2021). https:\/\/doi.org\/10.1109\/CGO51591.2021.9370308","DOI":"10.1109\/CGO51591.2021.9370308"},{"key":"1_CR16","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, http:\/\/xavierleroy.org\/publi\/compcert-CACM.pdf","DOI":"10.1145\/1538788.1538814"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Letouzey, P.: Extraction in coq: An overview. In: Beckmann, A., Dimitracopoulos, C., L\u00f6we, B. (eds.) Logic and Theory of Algorithms. pp. 359\u2013369. Springer, Berlin Heidelberg, Berlin, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69407-6_39","DOI":"10.1007\/978-3-540-69407-6_39"},{"key":"1_CR18","unstructured":"N. S. Agency: Ghidra. https:\/\/ghidra-sre.org\/Accessed 12 May 2023"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Naus, N., Verbeek, F., Ravindran, B.: A formal semantics for P-Code. In: 14th International Conference on Verified Software: Theories, Tools, and Experiments (2022). https:\/\/doi.org\/10.1007\/978-3-031-25803-9_7","DOI":"10.1007\/978-3-031-25803-9_7"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Palsberg, J.: Type-based analysis and applications. In: ACM SIGPLAN\/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (07 2001). https:\/\/doi.org\/10.1145\/379605.379635","DOI":"10.1145\/379605.379635"},{"key":"1_CR21","unstructured":"PNF Software: Jeb decompiler. https:\/\/www.pnfsoftware.com\/ Accessed 12 May 2023"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Schulte, E., Ruchti, J., Noonan, M., Ciarletta, D., Loginov, A.: Evolving exact decompilation. In: Shoshitaishvili, Y., Wang, R.F. (eds.) Workshop on Binary Analysis Research. San Diego, CA, USA (Feb 18\u201321 2018). https:\/\/doi.org\/10.14722\/bar.2018.23008, https:\/\/www.ndss-symposium.org\/ndss2018\/bar-workshop-programme\/","DOI":"10.14722\/bar.2018.23008"},{"key":"1_CR23","unstructured":"Vector 35 Inc.: Binary ninja. https:\/\/binary.ninja\/ Accessed 12 May 2023"},{"key":"1_CR24","unstructured":"Verbeek, F., Bharadwaj, A., Bockenek, J., Roessle, I., Weerwag, T., Ravindran, B.: X86 instruction semantics and basic block symbolic execution. Archive of Formal Proofs (Oct 2021). https:\/\/isa-afp.org\/entries\/X86_Semantics.html, Formal proof development"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Yakdan, K., Dechand, S., Gerhards-Padilla, E., Smith, M.: Helping johnny to analyze malware: A usability-optimized decompiler and malware analysis user study. In: 2016 IEEE Symposium on Security and Privacy (SP), pp. 158\u2013177. IEEE Computer Society, Los Alamitos, CA, USA (May 2016). https:\/\/doi.org\/10.1109\/SP.2016.18","DOI":"10.1109\/SP.2016.18"},{"key":"1_CR26","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) (Aug 2021). https:\/\/doi.org\/10.1145\/3473572","DOI":"10.1145\/3473572"}],"container-title":["Lecture Notes in Computer Science","Tests and Proofs"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38828-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:43:26Z","timestamp":1710344606000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38828-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031388279","9783031388286"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38828-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":"20 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tests and Proofs","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leicester","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"18 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2023","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":"tap2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/tap-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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","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":"8","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":"2","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":"57% - 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)"}}]}}