mlsanityData to 14 Oct 2026

Pluvio: Assembly Clone Search for Out-of-domain Architectures and Libraries through Transfer Learning and Conditional Variational Information Bottleneck

arXiv 2307.10631 ↗First posted 20 Jul 2023cs.SE cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

The practice of code reuse is crucial in software development for a faster and more efficient development lifecycle. In reality, however, code reuse practices lack proper control, resulting in issues such as vulnerability propagation and intellectual property infringements. Assembly clone search, a critical shift-right defence mechanism, has been effective in identifying vulnerable code resulting from reuse in released executables. Recent studies on assembly clone search demonstrate a trend towards using machine learning-based methods to match assembly code variants produced by different toolchains. However, these methods are limited to what they learn from a small number of toolchain variants used in training, rendering them inapplicable to unseen architectures and their corresponding compilation toolchain variants. This paper presents the first study on the problem of assembly clone search with unseen architectures and libraries. We propose incorporating human common knowledge through large-scale pre-trained natural language models, in the form of transfer learning, into current learning-based approaches for assembly clone search. Transfer learning can aid in addressing the limitations of the existing approaches, as it can bring in broader knowledge from human experts in assembly code. We further address the sequence limit issue by proposing a reinforcement learning agent to remove unnecessary and redundant tokens. Coupled with a new Variational Information Bottleneck learning strategy, the proposed system minimizes the reliance on potential indicators of architectures and optimization settings, for a better generalization of unseen architectures. We simulate the unseen architecture clone search scenarios and the experimental results show the effectiveness of the proposed approach against the state-of-the-art solutions.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 52 references that are in the map. First posted on arXiv 20 Jul 2023.

Builds on

16 of 52 references.

References · 16

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  4. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
  5. 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,811
  6. 2020MPNet: Masked and Permuted Pre-training for Language Understandingcited by 981
  7. 2016Deep Variational Information Bottleneckcited by 930
  8. 2014Distributed Representations of Sentences and Documentscited by 678
  9. 2017Neural Network-based Graph Embedding for Cross-Platform Binary Code Similarity Detectioncited by 65
  10. 2021PalmTree: Learning an Assembly Language Model for Instruction Embeddingcited by 49
  11. 2020Trex: Learning Execution Semantics from Micro-Traces for Binary Similaritycited by 34
  12. 2018SAFE: Self-Attentive Function Embeddings for Binary Similaritycited by 33
4 more
  1. 2018Neural Machine Translation Inspired Binary Code Similarity Comparison beyond Function Pairscited by 25
  2. 2018Conditional Variational Autoencoder for Neural Machine Translationcited by 20
  3. 2019A Survey of Binary Code Similaritycited by 19
  4. 2021Variational Information Bottleneck Model for Accurate Indoor Position Recognitioncited by 2

Built on by

Not cited yet.