Improved algorithm for identification of switch tables in executable code

Improved algorithm for identification of switch tables in executable code

This paper introduces novel approach for identification of switch tables in executable code. Compared to existing solutions based on SSA intermediate representation and different propagation techniques, developed algorithm is more accurate and has greater flexibility. Set of iterative algorithms bas...

Full description

Bibliographic Details
Main Authors: Andrei Gedich, Artur Lazdin
Format: Article
Language:English
Published: FRUCT 2015-04-01
Series:Proceedings of the XXth Conference of Open Innovations Association FRUCT
Subjects:
disassembly
decompilation
executable code
switch table
jump table
switch-case
case statement
multiway branch
Online Access:https://www.fruct.org/publications/fruct17/files/Ged.pdf
Description
Summary:This paper introduces novel approach for identification of switch tables in executable code. Compared to existing solutions based on SSA intermediate representation and different propagation techniques, developed algorithm is more accurate and has greater flexibility. Set of iterative algorithms based on Pearson, weighted Pearson and Spearman correlation coefficients is introduced in this paper. Simple noise value filtering and improved segmentation algorithm are described.
ISSN:2305-7254
2343-0737

Similar Items