<?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-19T21:40:07Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/24358" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/24358</identifier>
        <datestamp>2023-07-10</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>King, Samuel T.</dc:contributor>
          <dc:contributor>King, Samuel T.</dc:contributor>
          <dc:contributor>Arpaci-Dusseau, Remzi</dc:contributor>
          <dc:contributor>Amir, Eyal</dc:contributor>
          <dc:contributor>Adve, Vikram S.</dc:contributor>
          <dc:contributor>Marinov, Darko</dc:contributor>
          <dc:creator>Cozzie, Anthony E.</dc:creator>
          <dc:date>2011-05-25T14:37:57Z</dc:date>
          <dc:date>2013-05-26T10:00:22Z</dc:date>
          <dc:date>2011-05</dc:date>
          <dc:date>2011-05-25T14:37:57Z</dc:date>
          <dc:date>2011-05</dc:date>
          <dc:description>This thesis explores detecting patterns in the most general interface                                               
to computers: source and assembly program code.  Because writing                                                    
computer programs correctly is so difficult, there is a large                                                       
assortment of software engineering techniques devoted to making this                                                
process easier and more efficient.  Therefore, despite the huge space                                               
of possible programs, most programs written by humans will exhibit                                                  
some of the same patterns.                                                                                          
                                                                                                                    
Project Laika detects the data structures used by guest programs using                                              
unsupervised Bayesian learning.  Using these data structures, it can                                                
detect viruses with considerably better accuracy than ClamAV, a                                                     
leading industry solution.  Using high-level features makes Laika                                                   
considerably more resistant to polymorphic worms, because it requires                                               
them to preserve their high-level structure through their polymorphic                                               
transformations.                                                                                                    
                                                                                                                    
Project Macho generates Java programs from a combination of natural                                                 
language, example inputs, and a database of Java code.  Unlike past                                                 
natural language programming systems, which were basically verbose                                                  
versions of Visual Basic, Macho allows users to specify (small)                                                     
programs in high-level language and use examples to fill in the                                                     
details.  We were able to generate satisfactory solutions for basic                                                 
versions of several core utilities, including ls and grep, even when                                                
the natural language inputs were varied substantially.</dc:description>
          <dc:description>Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-12-06T15:03:41Z
Item was in collections:
University of Illinois Theses &amp; Dissertations (ID: 1)
No. of bitstreams: 1
Cozzie_Anthony.pdf: 643670 bytes, checksum: 1d423dd4dcf62aefab2c315069aae4b2 (MD5)</dc:description>
          <dc:description>Made available in DSpace on 2011-05-25T14:37:57Z (GMT). No. of bitstreams: 2
Cozzie_Anthony.pdf: 566818 bytes, checksum: fc8bb3d701a4f3c44d9041f9063548a9 (MD5)
license.txt: 4064 bytes, checksum: 643b28a61b329c69a95a08d6c13f588c (MD5)</dc:description>
          <dc:description>Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by William Ingram (wingram2@illinois.edu) on 2011-05-25T14:41:34Z
Item is restricted until 2013-05-25T14:41:28Z</dc:description>
          <dc:description>Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2013-05-26T10:00:22Z
Item was in collections:
University of Illinois Dissertations and Theses (ID: 204)
Dissertations and Theses - Computer Science (ID: 587)
No. of bitstreams: 2
Cozzie_Anthony.pdf: 566818 bytes, checksum: fc8bb3d701a4f3c44d9041f9063548a9 (MD5)
license.txt: 4064 bytes, checksum: 643b28a61b329c69a95a08d6c13f588c (MD5)</dc:description>
          <dc:description>Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2013-05-26T10:00:22Z</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/24358</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2010 Anthony Cozzie</dc:rights>
          <dc:subject>data structures</dc:subject>
          <dc:subject>programming patterns</dc:subject>
          <dc:subject>macho</dc:subject>
          <dc:title>Detecting and Combining Programming Patterns</dc:title>
          <degree>
            <discipline>Computer Science</discipline>
            <disciplineCode>0112</disciplineCode>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <department>Computer Science</department>
            <departmentCode>1434</departmentCode>
            <level>Dissertation</level>
            <name>Ph.D.</name>
            <program>PHD:Computer Science -UIUC</program>
            <programCode>10KS0112PHD</programCode>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
