Using recurrent neural networks for decompilation
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Decompilation, recovering source code from binary, is useful in many situations where it is necessary to analyze or understand software for which source code is not available. Source code is much easier for humans to read than binary code, and there are many tools available to analyze source code. Existing decompilation techniques often generate source code that is difficult for humans to understand because the generated code often does not use the coding idioms that programmers use. Differences from human-written code also reduce the effectiveness of analysis tools on the decompiled source code. To address the problem of differences between decompiled code and human-written code, we present a novel technique for decompiling binary code snippets using a model based on Recurrent Neural Networks. The model learns properties and patterns that occur in source code and uses them to produce decompilation output. We train and evaluate our technique on snippets of binary machine code compiled from C source code. The general approach we outline in this paper is not language-specific and requires little or no domain knowledge of a language and its properties or how a compiler operates, making the approach easily extensible to new languages and constructs. Furthermore, the technique can be extended and applied in situations to which traditional decompilers are not targeted, such as for decompilation of isolated binary snippets; fast, on-demand decompilation; domain-specific learned decompilation; optimizing for readability of decompilation; and recovering control flow constructs, comments, and variable or function names. We show that the translations produced by this technique are often accurate or close and can provide a useful picture of the snippet's behavior.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Vinyals, O., Kaiser, L., Koo, T., Petrov, S., Sutskever, I., & Hinton, G. (2014) · arXiv · doi:10.48550/arxiv.1412.7449 · Cited by 464
Latent Predictor Networks for Code Generation
Ling, W., Blunsom, P., Grefenstette, E., Hermann, K. M., Kočiský, T., Wang, F., & Senior, A. (2016) · Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p16-1057 · Cited by 307 · cited 1×
“Furthermore, additional work using various forms of deep learning, including RNNs, to analyze various aspects of code and programming languages shows that this area has promise [12]–[15].”
Background
Cited by
A Systematic Literature Review on the Use of Deep Learning in Software Engineering Research
Watson, C., Cooper, N., Palacio, D. N., Moran, K., & Poshyvanyk, D. (2022) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3485275 · Cited by 137
“Code Comprehension [9, 10, 16, 64, 73, 77, 93, 97, 119, 121, 130, 144, 180, 185] Souce Code Generation [26, 37, 57, 63, 74, 84, 124, 136, 151, 173] Source Code Retrieval & Traceability [10, 27, 29, 41, 62, 65, 92, 175, 179] Source Code Summarization [11, 29, 77, 95, 162, 179] Bug-Fixing Process [41, 67, 68, 80, 92, 96…”
MethodUnsupervised translation of programming languages
Lachaux, M.-A., Roziere, B., Chanussot, L., & Lample, G. (2020) · arXiv · doi:10.48550/arxiv.2006.03511 · Cited by 83
“[23] propose a sequence-to-sequence model to predict the C code of binary programs.”
BackgroundLLM4Decompile: Decompiling Binary Code with Large Language Models
Tan, H., Luo, Q., Li, J., & Zhang, Y. (2024) · Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2024.emnlp-main.203 · Cited by 67
Learning Program Behavioral Models from Synthesized Input–Output Pairs
Mammadov, T., Klakow, D., Koller, A., & Zeller, A. (2026) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3748720 · Cited by 5
Learning Program Behavioral Models from Synthesized Input-Output Pairs
Mammadov, T., Klakow, D., Koller, A., & Zeller, A. (2024) · arXiv · doi:10.48550/arxiv.2407.08597
Metadata
- Authors
- Katz, D. S., Ruchti, J., & Schulte, E.
- Venue
- 2018 IEEE 25th International Conference on Software Analysis, Evolution and Reengineering (SANER)
- Publisher
- IEEE
- Published
- 2018-03
- Pages
- 346-356
- OpenAlex
- W2795422216
- Cited by
- 71
- References
- 3
- FWCI
- 5.78
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Using recurrent neural networks for decompilation. https://app.cochat.ai/papers/10.1109/saner.2018.8330222
- The paper
- Katz, D. S., Ruchti, J., & Schulte, E. (2018). Using recurrent neural networks for decompilation. 2018 IEEE 25th International Conference on Software Analysis, Evolution and Reengineering (SANER). https://doi.org/10.1109/saner.2018.8330222
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.