liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Towards Accurate Binary Correspondence using Runtime-Observed Values
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering.
2016 (English)In: 32nd IEEE International Conference on Software Maintenance and Evolution, IEEE Computer Society, 2016, 438-442 p.Conference paper, Published paper (Refereed)
Abstract [en]

Establishing binary correspondence is the process of finding corresponding pairs of program elements, e.g., functions or individual instructions, between two semantically equivalent (or nearly-equivalent) but syntactically different program binaries. The binary-correspondence problem has applications in many fields, e.g., plagiarism and clone detection, reverse engineering, and security, and has therefore received significant attention both in industry and academia. Most binary-correspondence methods used in practice today are based on static analysis of the control structure in binaries. Unfortunately, such methods are often highly sensitive to syntactic differences between binaries, and discrepancies in the control structure due to, for example, using different compilers or optimization levels often severely reduce their accuracy. Several recent works have therefore proposed using dynamic analysis and comparing runtime-observed results of computations to establish binary correspondence. In this paper, we study the discriminative power of runtime-values for matching instructions in binaries, and propose several ways to increase the accuracy of value-based analyses. By utilizing techniques from the field of information retrieval combined with dynamic data-flow analysis, we improve matching accuracy by up to 55% in our experiments.

Place, publisher, year, edition, pages
IEEE Computer Society, 2016. 438-442 p.
Series
Proceedings-IEEE International Conference on Software Maintenance, ISSN 1063-6773
Keyword [en]
runtime values, binary correspondence, binary matching, dynamic analysis
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-134411DOI: 10.1109/ICSME.2016.54ISI: 000404430900042ISBN: 978-1-5090-3806-0 (electronic)ISBN: 978-1-5090-3807-7 (print)OAI: oai:DiVA.org:liu-134411DiVA: diva2:1073235
Conference
32nd IEEE International Conference on Software Maintenance and Evolution
Available from: 2017-02-09 Created: 2017-02-09 Last updated: 2017-08-09

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Kargén, UlfShahmehri, Nahid
By organisation
Database and information techniquesFaculty of Science & Engineering
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 53 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf