<?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-18T20:16:56Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/81762" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/81762</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:description>139 p.</dc:description>
          <dc:contributor>Meseguer, José</dc:contributor>
          <dc:creator>Farzan, Azadeh</dc:creator>
          <dc:date>2015-09-25T20:20:22Z</dc:date>
          <dc:date>2015-09-25T20:20:22Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2007</dc:date>
          <dc:date>2007</dc:date>
          <dc:description>In the static category, the focus of this work is to provide an appropriate notion of static abstraction for concurrent programs, called control net, based on Petri nets which is used to show how two very important static analyses problems in the context of concurrency, namely atomicity  and dataflow analyses can be defined for the partially-ordered runs generated by the control net, and how clean algorithmic solutions can be provided to solve these problems. Experimental results suggest that these solutions are feasible in practice.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:20:22Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3269892.pdf: 5762130 bytes, checksum: 8b46f1f022c8b1440eb33c6d2f745ec0 (MD5)
  Previous issue date: 2007</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 83043
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/81762</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI3269892</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Computer Science</dc:subject>
          <dc:title>Static and Dynamic Formal Analysis of Concurrent Systems and Languages: A Semantics-Based Approach</dc:title>
          <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>
