|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Rendezvous: A search engine for binary code
If you have a question about this talk, please contact Laurent Simon.
The problem of matching between binaries is important for software copyright enforcement as well as for identifying disclosed vulnerabilities in software. We present a search engine prototype called Rendezvous which enables indexing and searching for code in binary form. Rendezvous identiﬁes binary code using a statistical model comprising instruction mnemonics, control ﬂow sub-graphs and data constants which are simple to extract from a disassembly, yet normalising with respect to different compilers and optimisations. Experiments show that Rendezvous achieves F2 measures of 86.7% and 83.0% on the GNU C library compiled with different compiler optimisations and the GNU coreutils suite compiled with gcc and clang respectively. These two code bases together comprise more than one million lines of code. Rendezvous will bring signiﬁcant changes to the way patch management and copyright enforcement is currently performed.
This is a practice talk for MSR ’13.
This talk is part of the Computer Laboratory Security Seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsBP Lectures 2011 Churchill Archives Centre Russian Society
Other talksComputational biology The quest for lift - Investigations into low Reynolds Aerodynamics Rare events, negative measure dimensions and return time statistics Epiphanies in Glass Does the flagellum talk to the trypanosome cell body? NERC/MO Earth System Modelling