<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<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-09-20T02:15:37Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/104795" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/104795</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Roşu, Grigore</dc:contributor>
          <dc:contributor>Roşu, Grigore</dc:contributor>
          <dc:contributor>Adve, Vikram</dc:contributor>
          <dc:contributor>Miller, Andrew</dc:contributor>
          <dc:contributor>Bjørner, Nikolaj</dc:contributor>
          <dc:creator>Park, Daejun</dc:creator>
          <dc:date>2019-08-23T19:51:44Z</dc:date>
          <dc:date>2019-08-23T19:51:44Z</dc:date>
          <dc:date>2019-04-09</dc:date>
          <dc:date>2019-05</dc:date>
          <dc:description>"We present language-independent formal methods that are parameterized by the operational semantics of languages. We provide the theory, implementation, and extensive evaluation of the language-parametric formal methods. Specifically, we consider two formal analyses: program verification and program equivalence.
First, we propose a novel notion of bisimulation, which we call cut-bisimulation, allowing the two programs to semantically synchronize at relevant ""cut"" points, but to evolve independently otherwise. Employing the cut-bisimulation, we develop a language-independent equivalence checking algorithm, parameterized by the input and output language semantics, to prove equivalence of programs written in possibly different languages. We implement the algorithm in the K framework, yielding the first language-parametric program equivalence checker.
To demonstrate the practical feasibility of the language-parametric formal methods, we instantiate a language-independent deductive program verifier by plugging-in four real-world language semantics, C, Java, JavaScript, and Ethereum Virtual Machine (EVM), and use them to verify full functional correctness of challenging heap-manipulating programs and high-profile commercial smart contracts. In particular, to the best of our knowledge, the JavaScript and EVM verifiers are the first deductive program verifier for these languages."</dc:description>
          <dc:description>Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2019-08-22 without embargo terms</dc:description>
          <dc:description>The student, Daejun Park, accepted the attached license on 2019-04-08 at 23:27.</dc:description>
          <dc:description>The student, Daejun Park, submitted this Dissertation for approval on 2019-04-08 at 23:32.</dc:description>
          <dc:description>This Dissertation was approved for publication on 2019-04-09 at 09:29.</dc:description>
          <dc:description>DSpace SAF Submission Ingestion Package generated from Vireo submission #13528 on 2019-08-22 at 14:42:21</dc:description>
          <dc:description>Made available in DSpace on 2019-08-23T19:51:44Z (GMT). No. of bitstreams: 2
PARK-DISSERTATION-2019.pdf: 1191120 bytes, checksum: 7af3f4a7c8d39554c05f9452fb11a000 (MD5)
LICENSE.txt: 4208 bytes, checksum: 66de8493a06d73172fa93f89c996c92b (MD5)
  Previous issue date: 2019-04-09</dc:description>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://hdl.handle.net/2142/104795</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2019 Daejun Park</dc:rights>
          <dc:subject>Program verification</dc:subject>
          <dc:subject>Program equivalence</dc:subject>
          <dc:title>Semantics-based program verification</dc:title>
          <dc:type>text</dc:type>
          <dc:type>text</dc:type>
          <degree>
            <department>Computer Science</department>
            <discipline>Computer Science</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
