search

nirizr / rematch

REmatch, a complete binary diffing framework that is free and strives to be open source and community driven.
GNU General Public License v3.0
154 stars 22 forks source link

Basic graph diffing #57

Open shiftre opened 8 years ago

shiftre commented 8 years ago

Create a basic graph diffing either by constructing our own graph or using IDA's.

Classic examples would be Levenstein and Hamming distance but I think we could do better, specifically because we could extract hot areas (APIs, loops, other features we've already done).

nirizr commented 8 years ago

There are two types of graphs, one is a function's graph (the one i think you're talking about - graph of connections between function basic blocks), and another which is the graph of relationships between functions in an IDB. Both should yield decent results.