Measuring Similarity of Binary Programs using Hungarian Algorithm
Download: Poster (PDF)
Date: 11 May 2017
Document Type: Presentations
Additional Documents: Paper
Associated Event: NDSS Symposium 2017
We introduce a similarity matrix based on n-grams and longest common sequences extracted from pairs of functions. Devising an adapted Hungarian algorithm for such features, we envision to get reasonable results for similarity analysis on different versions of the same functions.