Name
Title | ||
|---|---|---|
Context-Sensitive Flow Graph and Projective Single Assignment Form for Resolving Context-Dependency of Binary Code |
Abstract | ||
|---|---|---|
Program analysis on binary code is considered as difficult because one has to resolve destinations of indirect jumps. However, there is another difficulty of context-dependency that matters when one processes binary programs that are not compiler generated. In this paper, we propose a novel approach for tackling these difficulties and describe a way to reconstruct a control flow from a binary program with no extra assumptions than the operational meaning of machine instructions.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3264820.3264826 | CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security
Toronto
Canada
October, 2018 |
Keywords | Field | DocType |
Binary code analysis, static single assignment, context-dependency | Control flow graph,Computer science,Binary code,Control flow,Theoretical computer science,Compiler,Program analysis,Static single assignment form,Binary number,Projective test | Conference |
ISBN | Citations | PageRank |
978-1-4503-5993-1 | 0 | 0.34 |
References | Authors | |
16 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomonori Izumida | 1 | 15 | 2.28 |
| Akira Mori | 2 | 8 | 2.60 |
| Masatomo Hashimoto | 3 | 68 | 5.97 |