Please use this identifier to cite or link to this item: http://hdl.handle.net/11401/71535
Title: Using Type Inference and Abstract Interpretation for Static Binary Analysis
Authors: Sekar, R
Saberi, Alireza
Department of Computer Science
Issue Date: 1-Dec-2012
Publisher: The Graduate School, Stony Brook University: Stony Brook, NY.
Abstract: In recent years, many research efforts have been dedicated to detect vulnerabilities in software. Most of these techniques are based on source code analysis. However, source code-based analysis methods are ineffective when the program source code is not available. In such a case, binary analysis is the only option. Yet, all binary analysis methods have to address serious challenges such as indirect memory access, missing functions and data abstraction. Historically, these problems have been addressed using rather ad hoc techniques. However, recent research has begun to reverse this trend. In this thesis, we cover Value-Set Analysis (VSA) and Abstract Stack Analysis (ASA) that use abstract interpretation to address aforementioned challenges in a principled way. We then move on to binary analysis methods that try to recover the missing type information in binaries. We describe TIE, Howard and REWARD as three binary type analysis methods and compare their effectiveness.
Description: 34 pg.
URI: http://hdl.handle.net/1951/60269
http://hdl.handle.net/11401/71535
Appears in Collections:Stony Brook Theses and Dissertations Collection

Files in This Item:
File Description SizeFormat 
Saberi_grad.sunysb_0771M_11246.pdf3.27 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.