Attackers only need to find a single exploitable bug in order to install malware, bots, and viruses on a vulnerable user's computer. Unfortunately, bugs are plentiful. For example, the Ubuntu Linux distribution bug management database currently lists over 58,000 open bugs. Thus, the question is not whether an attacker can find a bug, but which bugs an attacker can exploit.

This research investigates novel techniques, approaches, and algorithms for finding exploitable bugs. The ability to deterimine whether a bug is exploitable or not will allow developers to prioritize bug reports so that the most security-critical bugs are fixed first. The techniques investigated will also help developers distribute patches safely.

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Network Systems (CNS)
Application #
0953751
Program Officer
Nina Amla
Project Start
Project End
Budget Start
2010-03-01
Budget End
2015-02-28
Support Year
Fiscal Year
2009
Total Cost
$425,899
Indirect Cost
Name
Carnegie-Mellon University
Department
Type
DUNS #
City
Pittsburgh
State
PA
Country
United States
Zip Code
15213