COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Computer Laboratory Security Seminar > Rendezvous: A search engine for binary code
Rendezvous: A search engine for binary codeAdd to your list(s) Download to your calendar using vCal
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 identifies binary code using a statistical model comprising instruction mnemonics, control flow 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 significant 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 listsSciBar Quantum condensate seminars EPRG Energy and Environment (E&E) Series Easter 2012 Cambridge University Engineering Department Talks Calais Migrant Solidarity Babraham SeminarOther talksXZ: X-ray spectroscopic redshifts of obscured AGN Grammar Variational Autoencoder Joseph Banks: science, culture and the remaking of the Indo-Pacific world The clinical and biological basis of prostate cancer - from diagnosis to personalised therapy Private Statistics and Their Applications to Distributed Learning: Tools and Challenges Uncertainty Quantification with Multi-Level and Multi-Index methods 'Politics in Uncertain Times: What will the world look like in 2050 and how do you know? An SU(3) variant of instanton homology for webs Existence of Lefschetz fibrations on Stein/Weinstein domains "Mechanosensitive regulation of cancer epigenetics and pluripotency" |