Context-Sensitive Flow Graph and Projective Single Assignment Form for Resolving Context-Dependency of Binary Code
| Title | Context-Sensitive Flow Graph and Projective Single Assignment Form for Resolving Context-Dependency of Binary Code |
| Publication Type | Conference Paper |
| Year of Publication | 2018 |
| Authors | Izumida, Tomonori, Mori, Akira, Hashimoto, Masatomo |
| Conference Name | Proceedings of the 13th Workshop on Programming Languages and Analysis for Security |
| Publisher | ACM |
| Conference Location | New York, NY, USA |
| ISBN Number | 978-1-4503-5993-1 |
| Keywords | binary code analysis, coding theory, compositionality, context-dependency, cryptography, Metrics, pubcrawl, resilience, Resiliency, security, static single assignment |
| 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. |
| URL | https://dl.acm.org/citation.cfm?doid=3264820.3264826 |
| DOI | 10.1145/3264820.3264826 |
| Citation Key | izumida_context-sensitive_2018 |