<node id="590486">
  <nid>590486</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1492434082</created>
  <changed>1492434082</changed>
  <title><![CDATA[PhD Proposal by Xin Zhang]]></title>
  <body><![CDATA[<p><strong>Title</strong>: Combining Logical and Probabilistic Reasoning in Program Analysis<br />
<br />
Xin Zhang<br />
Ph.D. Student<br />
School of Computer Science<br />
College of Computing<br />
Georgia Institute of Technology</p>

<p><br />
<strong>Date</strong>: Friday, April 21, 2017<br />
<strong>Time</strong>: 2:00pm-4:00pm EDT<br />
<strong>Location</strong>: Levine 612 (University of Pennsylvania)<br />
<br />
<strong>Committee</strong>:<br />
-----------------------<br />
Prof. Mayur Naik (Advisor), Computer and Information Science, University of Pennsylvania<br />
Prof. William Harris, School of Computer Science, Georgia Institute of Technology<br />
Prof. Santosh Pande, School of Computer Science, Georgia Institute of Technology<br />
<br />
<strong>Abstract</strong>:<br />
-----------------------<br />
Software is becoming increasingly pervasive and complex. These trends expose masses of users to unintended software failures and deliberate cyber-attacks. A widely adopted solution to enforce software quality is automated program analysis. Existing program analyses are expressed in the form of logical rules that are handcrafted by experts. While such a logic-based approach provides many benefits, it cannot handle uncertainty and lacks the ability to learn and adapt. This in turn hinders the accuracy, scalability, and usability of program analysis tools in practice.<br />
<br />
We seek to address these limitations by proposing a methodology and framework for incorporating probabilistic reasoning directly into existing program analyses that are based on logical reasoning. The framework consists of a frontend, which automatically integrates probabilities into a logical analysis by synthesizing a system of weighted constraints, and a backend, which is a learning and inference engine for such constraints. We demonstrate that the combined approach can benefit a number of important applications of program analysis and thereby facilitate more widespread adoption of this technology. We also describe new algorithmic techniques to solve very large instances of weighted constraints that arise not only in our domain but also in other domains such as Big Data analytics and statistical AI.</p>

<p>Xin Zhang<br />
School of Computer Science<br />
College of Computing<br />
Georgia Institute of Technology<br />
<a href="http://www.cc.gatech.edu/~xzhang36/">http://www.cc.gatech.edu/~xzhang36/</a><br />
&nbsp;</p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Combining Logical and Probabilistic Reasoning in Program Analysis]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2017-04-21T15:00:00-04:00]]></value>
      <value2><![CDATA[2017-04-21T17:00:00-04:00]]></value2>
      <rrule><![CDATA[]]></rrule>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_time>
  <field_fee>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_fee>
  <field_extras>
      </field_extras>
  <field_audience>
          <item>
        <value><![CDATA[Public]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_location>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_phone>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_phone>
  <field_url>
    <item>
      <url><![CDATA[]]></url>
      <title><![CDATA[]]></title>
            <attributes><![CDATA[]]></attributes>
    </item>
  </field_url>
  <field_email>
    <item>
      <email><![CDATA[]]></email>
    </item>
  </field_email>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>221981</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[Graduate Studies]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1788</tid>
        <value><![CDATA[Other/Miscellaneous]]></value>
      </item>
      </field_categories>
  <field_keywords>
          <item>
        <tid>102851</tid>
        <value><![CDATA[Phd proposal]]></value>
      </item>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
