In this paper we investigate the use of graph embedding networks, with unsupervised features learning, as neural architecture to learn over binary functions. We propose several ways of automatically extract features from the control flow graph (CFG) and we use the structure2vec graph embedding techniques to translate a CFG to a vectors of real numbers. We train and test our proposed architectures on two different binary analysis tasks: binary similarity, and, compiler provenance. We show that the unsupervised extraction of features improves the accuracy on the above tasks, when compared with embedding vectors obtained from a CFG annotated with manually engineered features (i.e., ACFG proposed in [39]). We additionally compare the results of graph embedding networks based techniques with a recent architecture that do not make use of the structural information given by the CFG, and we observe similar performances. We formulate a possible explanation of this phenomenon and we conclude identifying important open challenges.
Investigating Graph Embedding Neural Networks with Unsupervised Features Extraction for Binary Analysis / Massarelli, Luca; DI LUNA, GIUSEPPE ANTONIO; Petroni, Fabio; Querzoni, Leonardo; Baldoni, Roberto. - (2019), pp. 1-11. (Intervento presentato al convegno 2nd Workshop on Binary Analysis Research (BAR 2019) tenutosi a San Diego (CA); United States).
Investigating Graph Embedding Neural Networks with Unsupervised Features Extraction for Binary Analysis
Luca Massarelli
;Giuseppe Antonio Di Luna;Fabio Petroni;Leonardo Querzoni;Roberto Baldoni
2019
Abstract
In this paper we investigate the use of graph embedding networks, with unsupervised features learning, as neural architecture to learn over binary functions. We propose several ways of automatically extract features from the control flow graph (CFG) and we use the structure2vec graph embedding techniques to translate a CFG to a vectors of real numbers. We train and test our proposed architectures on two different binary analysis tasks: binary similarity, and, compiler provenance. We show that the unsupervised extraction of features improves the accuracy on the above tasks, when compared with embedding vectors obtained from a CFG annotated with manually engineered features (i.e., ACFG proposed in [39]). We additionally compare the results of graph embedding networks based techniques with a recent architecture that do not make use of the structural information given by the CFG, and we observe similar performances. We formulate a possible explanation of this phenomenon and we conclude identifying important open challenges.File | Dimensione | Formato | |
---|---|---|---|
Massarelli_Investigating-Graph-Embedding_2019.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
1.07 MB
Formato
Adobe PDF
|
1.07 MB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.