| dc.identifier.uri | http://hdl.handle.net/1951/60269 | |
| dc.identifier.uri | http://hdl.handle.net/11401/71535 | |
| dc.description.sponsorship | This work is sponsored by the Stony Brook University Graduate School in compliance with the requirements for completion of degree. | en_US |
| dc.format | Monograph | |
| dc.format.medium | Electronic Resource | en_US |
| dc.language.iso | en_US | |
| dc.publisher | The Graduate School, Stony Brook University: Stony Brook, NY. | |
| dc.type | Thesis | |
| dcterms.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. | |
| dcterms.available | 2013-05-24T16:38:20Z | |
| dcterms.available | 2015-04-24T14:47:50Z | |
| dcterms.contributor | Sekar, R | en_US |
| dcterms.creator | Saberi, Alireza | |
| dcterms.dateAccepted | 2013-05-24T16:38:20Z | |
| dcterms.dateAccepted | 2015-04-24T14:47:50Z | |
| dcterms.dateSubmitted | 2013-05-24T16:38:20Z | |
| dcterms.dateSubmitted | 2015-04-24T14:47:50Z | |
| dcterms.description | Department of Computer Science | en_US |
| dcterms.extent | 34 pg. | en_US |
| dcterms.format | Monograph | |
| dcterms.format | Application/PDF | en_US |
| dcterms.identifier | http://hdl.handle.net/1951/60269 | |
| dcterms.identifier | http://hdl.handle.net/11401/71535 | |
| dcterms.issued | 2012-12-01 | |
| dcterms.language | en_US | |
| dcterms.provenance | Made available in DSpace on 2013-05-24T16:38:20Z (GMT). No. of bitstreams: 1
StonyBrookUniversityETDPageEmbargo_20130517082608_116839.pdf: 41286 bytes, checksum: 425a156df10bbe213bfdf4d175026e82 (MD5)
Previous issue date: 1 | en |
| dcterms.provenance | Made available in DSpace on 2015-04-24T14:47:50Z (GMT). No. of bitstreams: 3
StonyBrookUniversityETDPageEmbargo_20130517082608_116839.pdf.jpg: 1934 bytes, checksum: c116f0e1e7be19420106a88253e31f2e (MD5)
StonyBrookUniversityETDPageEmbargo_20130517082608_116839.pdf.txt: 336 bytes, checksum: 84c0f8f99f2b4ae66b3cc3ade09ad2e9 (MD5)
StonyBrookUniversityETDPageEmbargo_20130517082608_116839.pdf: 41286 bytes, checksum: 425a156df10bbe213bfdf4d175026e82 (MD5)
Previous issue date: 1 | en |
| dcterms.publisher | The Graduate School, Stony Brook University: Stony Brook, NY. | |
| dcterms.subject | Abstract Interpretation, Static Binary Analysis, Type Inference | |
| dcterms.subject | Computer science | |
| dcterms.title | Using Type Inference and Abstract Interpretation for Static Binary Analysis | |
| dcterms.type | Thesis | |
