Reblogged: Esh – Statistical Similarity of Binaries — thoughts…

Here is a (very high-level) breakdown of how Esh computes similarity: Decomposing the procedure into strands: We decompose procedures into smaller segments (we refer to as strands), which are feasible to compare, and try to use semantically similar strands from one procedure to compose the other. Pairwise semantic comparison: We use a program verifier to […]

via Esh – Statistical Similarity of Binaries — thoughts…

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s