english only
EPFL > I&C > Tresor > Seminars
RESOURCES
Home
People
Seminars
Courses
Research Topics
Events
Useful Links

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
seminars:2010 [2010/07/19 14:26]
psuter
seminars:2010 [2010/08/27 10:50]
hojjat
Line 232: Line 232:
  
 In this talk, I will present a system, Snap, for automatically grouping related input bytes into fields and classifying each field and corresponding regions of code as critical or forgiving. Given an application and one or more inputs, Snap uses targeted input fuzzing in combination with dynamic execution and influence tracing to classify regions of input fields and code as critical or forgiving. Our experimental evaluation shows that Snap makes classifications with close to perfect precision (99%) and very good recall (between 99% and 73%, depending on the application). In this talk, I will present a system, Snap, for automatically grouping related input bytes into fields and classifying each field and corresponding regions of code as critical or forgiving. Given an application and one or more inputs, Snap uses targeted input fuzzing in combination with dynamic execution and influence tracing to classify regions of input fields and code as critical or forgiving. Our experimental evaluation shows that Snap makes classifications with close to perfect precision (99%) and very good recall (between 99% and 73%, depending on the application).
 +\\
 +\\
 +===== Solvers for Software Reliability and Security =====
  
 +  * 2010-07-23 - 15:15, [[http://​plan.epfl.ch/?​lang=en&​room=BC229|BC 229]], [[http://​people.csail.mit.edu/​vganesh|Dr. Vijay Ganesh]], MIT CSAIL
 +
 +Abstract:
 +
 +Constraint solvers play a central role in the construction of reliable and secure software, regardless of whether such software is based on formal methods, program analysis, testing or synthesis. In this talk, I will present two solvers namely, STP and HAMPI. STP extends SAT solvers with the theory of bit-vectors and arrays, and has enabled a new testing technique known as Concolic Testing. STP-enabled Concolic testers have been used to find hundreds of previously unknown bugs in Unix utilities, OS kernels, media players, and commercial software, some with approximately a million lines of code. HAMPI is designed for the analysis of string-manipulating programs and incorporates a rich theory of equality over bounded string variables, bounded regular expressions,​ and context-free grammars. HAMPI has been used to find many unknown SQL injection vulnerabilities in applications with more than 100,000 lines of PHP code using static and dynamic analysis. I will discuss techniques that make these solvers scale to large formulas obtained from real-world applications,​ and some related theoretical results.
 +
 +Bio:
 +
 +Dr. Vijay Ganesh is a Research Scientist at MIT since 2007. He completed his PhD in computer science from Stanford University in 2007, and Bachelor of Technology from College of Engineering,​ Trivandrum, India. His primary research interests are constraint solvers and their applications to software reliability,​ computer security and biology. His STP solver was the co-winner of the SMTCOMP competition for bit-vector solvers in 2006, and his paper on HAMPI won the ACM Distinguished Paper Award in 2009.