{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/88962"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/88962","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Rule-based optimization with K-framework","abstract":"The thesis discusses pre-compiler optimization using rule-based rewriting. Our goal is to facilitate the proof of correctness of the process of program optimization. A source-to-source optimizer based on the proposed strategy can be a preprocessor to a certified compiler such as CompCert and this way it will facilitate the process of certification of a sophisticated compiler. In fact, CompCert is highly assured but it trades off the assurance with efficiency. Unlike other compilers like Intel C compiler or GNU C compiler, CompCert does not optimize aggressively. The paper will discuss optimization rules implemented using the K-framework and how much efficiency improvement achieved by use of our optimization rules.","abstract_html":"The thesis discusses pre-compiler optimization using rule-based rewriting. Our goal is to facilitate the proof of correctness of the process of program optimization. A source-to-source optimizer based on the proposed strategy can be a preprocessor to a certified compiler such as CompCert and this way it will facilitate the process of certification of a sophisticated compiler. In fact, CompCert is highly assured but it trades off the assurance with efficiency. Unlike other compilers like Intel C compiler or GNU C compiler, CompCert does not optimize aggressively. The paper will discuss optimization rules implemented using the K-framework and how much efficiency improvement achieved by use of our optimization rules.","abstract_has_math":false,"creators":["Seo, Seokje"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Padua, David"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016-03-02T19:33:21Z","date_published":"2016-03-02T19:33:21Z","updated_at":"2026-07-22T22:26:32Z","subjects":["Rule-Based","Optimization","K-Framework","pre-compiler"],"languages":["en"],"rights":["Copyright 2015 Seokje Seo"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/88962","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Padua, David"]},{"key":"dc:creator","label":"Author","values":["Seo, Seokje"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2016-03-02T19:33:21Z","2015-10-20","2015-12"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Rule-Based","Optimization","K-Framework","pre-compiler"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2015 Seokje Seo"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/88962"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The thesis discusses pre-compiler optimization using rule-based rewriting. Our goal is to facilitate the proof of correctness of the process of program optimization. A source-to-source optimizer based on the proposed strategy can be a preprocessor to a certified compiler such as CompCert and this way it will facilitate the process of certification of a sophisticated compiler. In fact, CompCert is highly assured but it trades off the assurance with efficiency. Unlike other compilers like Intel C compiler or GNU C compiler, CompCert does not optimize aggressively. The paper will discuss optimization rules implemented using the K-framework and how much efficiency improvement achieved by use of our optimization rules.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2016-03-02 without embargo terms","The student, Seokje Seo, accepted the attached license on 2015-10-17 at 02:41.","The student, Seokje Seo, submitted this Thesis for approval on 2015-10-19 at 13:16.","This Thesis was approved for publication on 2015-10-20 at 14:34.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8726 on 2016-03-02 at 12:49:33","Made available in DSpace on 2016-03-02T19:33:21Z (GMT). No. of bitstreams: 2 SEO-THESIS-2015.pdf: 238922 bytes, checksum: 454dedb65b9e2cf1b927324a59a722cc (MD5) LICENSE.txt: 4207 bytes, checksum: c3f2be2e52a12ea388cd52e608ad17be (MD5) Previous issue date: 2015-10-20"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Rule-based optimization with K-framework"]}]}],"canonical_facts":{"dc:contributor":["Padua, David"],"dc:creator":["Seo, Seokje"],"dc:date":["2016-03-02T19:33:21Z","2015-10-20","2015-12"],"dc:description":["The thesis discusses pre-compiler optimization using rule-based rewriting. Our goal is to facilitate the proof of correctness of the process of program optimization. A source-to-source optimizer based on the proposed strategy can be a preprocessor to a certified compiler such as CompCert and this way it will facilitate the process of certification of a sophisticated compiler. In fact, CompCert is highly assured but it trades off the assurance with efficiency. Unlike other compilers like Intel C compiler or GNU C compiler, CompCert does not optimize aggressively. The paper will discuss optimization rules implemented using the K-framework and how much efficiency improvement achieved by use of our optimization rules.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2016-03-02 without embargo terms","The student, Seokje Seo, accepted the attached license on 2015-10-17 at 02:41.","The student, Seokje Seo, submitted this Thesis for approval on 2015-10-19 at 13:16.","This Thesis was approved for publication on 2015-10-20 at 14:34.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8726 on 2016-03-02 at 12:49:33","Made available in DSpace on 2016-03-02T19:33:21Z (GMT). No. of bitstreams: 2 SEO-THESIS-2015.pdf: 238922 bytes, checksum: 454dedb65b9e2cf1b927324a59a722cc (MD5) LICENSE.txt: 4207 bytes, checksum: c3f2be2e52a12ea388cd52e608ad17be (MD5) Previous issue date: 2015-10-20"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/88962"],"dc:language":["en"],"dc:rights":["Copyright 2015 Seokje Seo"],"dc:subject":["Rule-Based","Optimization","K-Framework","pre-compiler"],"dc:title":["Rule-based optimization with K-framework"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:32Z"}