2026-09-19T21:14:39Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/108050 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Rosu, Grigore Abir, Michael 2020-08-26T21:58:05Z 2020-08-26T21:58:05Z 2020-05-14 2020-05 In this thesis, we further develop part of the K framework, a framework for specifying and executing the formal semantics of languages. We dive into the LLVM backend, one of the engines for concrete execution, and implement key functionality that is present in the other concrete execution engine. We then add a new interface that is unique to the LLVM backend, making this backend diverge from the other backend. Finally, with the backend caught up and divergent, we implement and evaluate pattern matching optimization strategies. Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2020-08-25 without embargo terms The student, Michael Abir, accepted the attached license on 2020-05-12 at 15:03. The student, Michael Abir, submitted this Thesis for approval on 2020-05-12 at 17:22. This Thesis was approved for publication on 2020-05-14 at 10:49. DSpace SAF Submission Ingestion Package generated from Vireo submission #15363 on 2020-08-25 at 17:14:23 Made available in DSpace on 2020-08-26T21:58:05Z (GMT). No. of bitstreams: 2 ABIR-THESIS-2020.pdf: 697435 bytes, checksum: 9bcdc746acd0405efe9fc204454ccbe4 (MD5) LICENSE.txt: 4209 bytes, checksum: 21ac68bd71b0e83081a7b2ee769f9dbb (MD5) Previous issue date: 2020-05-14 application/pdf http://hdl.handle.net/2142/108050 en Copyright 2020 Michael Abir programming languages, rewriting-based execution, optimization Closing the gap in the LLVM backend of K text Thesis Computer Science Computer Science University of Illinois at Urbana-Champaign Thesis M.S.