Evaluating Code Embeddings

Presented at BSidesLV 2019, Aug. 6, 2019, 6:30 p.m. (25 minutes)

Over the past year several researchers gave talks proposing the use of embedding models for measuring code similarity. At least four different embedding models are currently available, however there has not been an evaluation of these methods. In this talk I will provide an overview of the four methods, as well as a comparison of their computational complexity. I will also attempt to measure how well these embeddings encode interesting information by comparing the similarity of the embeddings generated between systems.

Presenters:

• Rob Brandon
  Rob is a researcher on the Advanced Threat Hunting team in Booz Allen Hamilton Dark Labs. He has a PhD in computer science from the University of Maryland, Baltimore County and multiple years of experience in the computer security field. His research interests include semantic modeling of computer programs, reverse engineering, and cataloging the inevitable failure of human efforts to build well-engineered systems.

Similar Presentations:

• RomHack 2019 / SAFE: Self Attentive Function Embedding for Binary Similarity
• BalCCon2k22 - Loading (2022) / Subjective and objective code similarity measures
• BSidesSF 2019 / Attacking Deep Learning-Based NLP Systems with Malicious Word Embeddings