Context-Sensitive Flow Graph and Projective Single Assignment Form for Resolving Context-Dependency of Binary Code (PLAS2018) Context-Sensitive Flow Graph and Projective Single Assignment Form for Resolving Context-Dependency of Binary Code

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.

Tomonori Izumida, Akira Mori, Masatomo Hashimoto. Context-Sensitive Flow Graph and Projective Single Assignment Form for Resolving Context-Dependency of Binary Code. In Proceedings of the 13th Workshop on Programming Languages and Analysis for Security (PLAS 2018), pp. 48-53, 2018. [ACM DL] [IIJ-II]