<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-05-15T04:00:53Z</responseDate>
  <request metadataPrefix="oai_dc" verb="GetRecord" identifier="oai:ipsj.ixsq.nii.ac.jp:00016672">https://ipsj.ixsq.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:ipsj.ixsq.nii.ac.jp:00016672</identifier>
        <datestamp>2025-01-22T23:44:26Z</datestamp>
        <setSpec>934:935:959:961</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>A Type System for Verification of Compiler Optimizations</dc:title>
          <dc:title>A Type System for Verification of Compiler Optimizations</dc:title>
          <dc:creator>YUTAKA, MATSUNO</dc:creator>
          <dc:creator>HIROYUKI, SATO</dc:creator>
          <dc:creator>Yutaka, Matsuno</dc:creator>
          <dc:creator>Hiroyuki, Sato</dc:creator>
          <dc:subject>通常論文</dc:subject>
          <dc:description>This paper presents a type theoretical framework for the verification of compiler optimizations. Though today's compiler optimizations are fairly advanced  there is still not an appropriate theoretical framework for the verification of compiler optimizations. To establish a generalized framework  we introduce assignment types for variables  which represent how the value of variables will be calculated in a program. First we introduce our type system. Second we prove soundness of our type system meaning that if types of return values are equal in two programs  the programs are equivalent. Soundness ensures that many structure preserving optimizations preserve program semantics. Then by extending the notion of type equality to order relation  we redefine several optimizations and prove that they also preserve program semantics.</dc:description>
          <dc:description>This paper presents a type theoretical framework for the verification of compiler optimizations. Though today's compiler optimizations are fairly advanced, there is still not an appropriate theoretical framework for the verification of compiler optimizations. To establish a generalized framework, we introduce assignment types for variables, which represent how the value of variables will be calculated in a program. First we introduce our type system. Second we prove soundness of our type system meaning that if types of return values are equal in two programs, the programs are equivalent. Soundness ensures that many structure preserving optimizations preserve program semantics. Then by extending the notion of type equality to order relation, we redefine several optimizations and prove that they also preserve program semantics.</dc:description>
          <dc:description>journal article</dc:description>
          <dc:publisher>情報処理学会</dc:publisher>
          <dc:date>2004-07-15</dc:date>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>情報処理学会論文誌プログラミング（PRO）</dc:identifier>
          <dc:identifier>SIG09(PRO22)</dc:identifier>
          <dc:identifier>45</dc:identifier>
          <dc:identifier>14</dc:identifier>
          <dc:identifier>24</dc:identifier>
          <dc:identifier>1882-7802</dc:identifier>
          <dc:identifier>AA11464814</dc:identifier>
          <dc:identifier>https://ipsj.ixsq.nii.ac.jp/record/16672/files/IPSJ-TPRO4509003.pdf</dc:identifier>
          <dc:language>eng</dc:language>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
