arrow
Return

BinBench: a benchmark for x64 portable operating system interface binary function representations

delete2023-06-01
delete0
delete
OA
AI
F
Francesca Console *
G
Giuseppe D’Aquanno
G
Giuseppe Antonio Di Luna
L
Leonardo Querzoni
DOI:10.7717/peerj-cs.1286delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
In this article we propose the first multi-task benchmark for evaluating the performances of machine learning models that work on low level assembly functions. While the use of multi-task benchmark is a standard in the natural language processing (NLP) field, such practice is unknown in the field of assembly language processing. However, in the latest years there has been a strong push in the use of deep neural networks architectures borrowed from NLP to solve problems on assembly code. A first advantage of having a standard benchmark is the one of making different works comparable without effort of reproducing third part solutions. The second advantage is the one of being able to test the generality of a machine learning model on several tasks. For these reasons, we propose BinBench, a benchmark for binary function models. The benchmark includes various binary analysis tasks, as well as a dataset of binary functions on which tasks should be solved. The dataset is publicly available and it has been evaluated using baseline models.
Keywords:
Benchmark
Neural networks
Binary functions representation
Dataset
Assembly language
Binary functions
Binary similarity
Compiler provenance
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

PeerJ Computer Science cover
PeerJ Computer Science
IF:
2.5
Papers:
3.4K
Citations:
6.9K

Organization

S
sapienza university rome
Scholars:
6.3W
Papers: 4.7W
Citations: 381