Binary Code Summarization: Benchmarking ChatGPT/GPT-4 and Other Large Language Models

Xin Jin, Jonathan Larson, Weiwei Yang, Zhiqiang Lin
12/15/2023
cs.CRcs.CLcs.LG

No official code found. Best implementation: xinjin95/BinSum (20 stars, last commit 2023-12-18).

Abstract

Binary code summarization, while invaluable for understanding code semantics, is challenging due to its labor-intensive nature. This study delves into the potential of large language models (LLMs) for binary code comprehension. To this end, we present BinSum, a comprehensive benchmark and dataset of over 557K binary functions and introduce a novel method for prompt synthesis and optimization. To more accurately gauge LLM performance, we also propose a new semantic similarity metric that surpasses traditional exact-match approaches. Our extensive evaluation of prominent LLMs, including ChatGPT, GPT-4, Llama 2, and Code Llama, reveals 10 pivotal insights. This evaluation generates 4 billion inference tokens, incurred a total expense of 11,418 US dollars and 873 NVIDIA A100 GPU hours. Our findings highlight both the transformative potential of LLMs in this field and the challenges yet to be overcome.

View on arXivView PDF

Code Implementations(1)

xinjin95/BinSumCommunity100%

Binary Code Summarization: Benchmarking ChatGPT/GPT-4 and Other Large Language Models

200Dec 14, 20232 years ago

Similar Papers

Cite this paper

@article{jin2023binary,
  title  = {Binary Code Summarization: Benchmarking ChatGPT/GPT-4 and Other Large Language Models},
  author = {Xin Jin and Jonathan Larson and Weiwei Yang and Zhiqiang Lin},
  year   = {2023},
  eprint = {2312.09601},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2312.09601v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2312.09601.svg)](https://codeofpaper.com/paper/2312.09601)

Discussion