*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************
Title: Combining Logical and Probabilistic Reasoning in Program Analysis
Xin Zhang
Ph.D. Student
School of Computer Science
College of Computing
Georgia Institute of Technology
Date: Friday, April 21, 2017
Time: 2:00pm-4:00pm EDT
Location: Levine 612 (University of Pennsylvania)
Committee:
-----------------------
Prof. Mayur Naik (Advisor), Computer and Information Science, University of Pennsylvania
Prof. William Harris, School of Computer Science, Georgia Institute of Technology
Prof. Santosh Pande, School of Computer Science, Georgia Institute of Technology
Abstract:
-----------------------
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.
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.
Xin Zhang
School of Computer Science
College of Computing
Georgia Institute of Technology
http://www.cc.gatech.edu/~xzhang36/
