Fetching the paper…
Reading the bibliography…
Decompilation is a well-studied area with numerous high-quality tools available.
1902
Earlier work this paper cites.
1905
Earlier work this paper cites.
1910
Earlier work this paper cites.
B. C. HOUSEL III, A study of decompiling machine languages into high-Level machine independent languages . Purdue University, 1973
1973
Earlier work this paper cites.
G. Winskel, “The formal semantics of programming languages: An introduction,” 1993
1993
Earlier work this paper cites.
C. Cifuentes and K. J. Gough, “Decompilation of binary programs,” Software: Practice and Experience , vol. 25, no. 7, pp. 811–829, 1995
1995
Earlier work this paper cites.
2006
Earlier work this paper cites.
G. Stitt and F. Vahid, “Binary synthesis,” ACM Transactions on Design Automation of Electronic Systems (TODAES) , vol. 12, no. 3, pp. 1–30, 2008
2008
Earlier work this paper cites.
K. Anand, M. Smithson, A. Kotha, and K. Elwazeer, “Decompilation to compiler high IR in a binary rewriter,” University of Maryland , 2010
2010
Earlier work this paper cites.
T. Kudo and J. Richardson, “SentencePiece: A simple and language independent subword tokenizer and detokenizer for neural text processing,” in Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing: System Demonstrations , E. Blanco and W. Lu, Eds. Brussels, Belgium: Association for Computational Linguistics, Nov. 2018, pp. 66–71. [Online]. Available: https://aclanthology.org/D18-2012
2012
Earlier work this paper cites.
G. Chen, Z. Qi, S. Huang, K. Ni, Y. Zheng, W. Binder, and H. Guan, “A refined decompiler to generate c code with high readability,” Software: Practice and Experience , vol. 43, no. 11, pp. 1337–1358, 2013
2013
Earlier work this paper cites.
H. Maarif, R. Akmeliawati, Z. Htike, and T. S. Gunawan, “Complexity algorithm analysis for edit distance,” in 2014 International Conference on Computer and Communication Engineering . IEEE, 2014, pp. 135–137
2014
Earlier work this paper cites.
N. Srivastava, G. Hinton, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov, “Dropout: A simple way to prevent neural networks from overfitting,” Journal of Machine Learning Research , vol. 15, no. 56, pp. 1929–1958, 2014. [Online]. Available: http://jmlr.org/papers/v15/srivastava14a.html
2014
Earlier work this paper cites.
V. Le, M. Afshari, and Z. Su, “Compiler validation via equivalence modulo inputs,” ACM Sigplan Notices , vol. 49, no. 6, pp. 216–226, 2014
2014
Earlier work this paper cites.
I. Sutskever, O. Vinyals, and Q. V. Le, “Sequence to sequence learning with neural networks,” in Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 2 , ser. NIPS’14. Cambridge, MA, USA: MIT Press, 2014, p. 3104–3112
2014
Earlier work this paper cites.
J. C. Campbell, A. Hindle, and J. N. Amaral, “Syntax errors just aren’t natural: Improving error reporting with language models,” in Proceedings of the 11th Working Conference on Mining Software Repositories , 2014, pp. 252–261
2014
Earlier work this paper cites.
K. Yakdan, S. Eschweiler, E. Gerhards-Padilla, and M. Smith, “No more gotos: Decompilation using pattern-independent control-flow structuring and semantic-preserving transformations,” in 22nd Annual Network and Distributed System Security Symposium, NDSS 2015, San Diego, California, USA, February 8-11, 2015 . Internet Society, 2015
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
R. Sennrich, B. Haddow, and A. Birch, “Neural machine translation of rare words with subword units,” in Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) . Berlin, Germany: Association for Computational Linguistics, Aug. 2016, pp. 1715–1725. [Online]. Available: https://aclanthology.org/P16-1162
2016
Earlier work this paper cites.
J. L. Ba, J. R. Kiros, and G. E. Hinton, “Layer normalization,” 2016
2016
Earlier work this paper cites.
Retdec, “Retargetable decompiler,” 2017. [Online]. Available: https://retdec.com/
2017
Earlier work this paper cites.
A. Vaswani, N. shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, and L. Kaiser, “Attention is all you need,” NIPS , 2017
2017
Earlier work this paper cites.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” 2017
2017
Cited alongside, same era.
A. Paszke, S. Gross, S. Chintala, G. Chanan, E. Yang, Z. DeVito, Z. Lin, A. Desmaison, L. Antiga, and A. Lerer, “Automatic differentiation in pytorch,” 2017
2017
Cited alongside, same era.
D. S. Katz, J. Ruchti, and E. Schulte, “Using recurrent neural networks for decompilation,” in 2018 IEEE 25th International Conference on Software Analysis, Evolution and Reengineering (SANER) , 2018, pp. 346–356
2018
Cited alongside, same era.
L. T. C. Melo, R. G. Ribeiro, M. R. De Araujo, and F. M. Q. Pereira, “Inference of static semantics for incomplete C programs,” POPL , 2018
2018
Cited alongside, same era.
M.-A. Lachaux, B. Roziere, L. Chanussot, and G. Lample, “Unsupervised translation of programming languages,” 2020
2020
Later among the works it cites.
B. Roziere, M.-A. Lachaux, L. Chanussot, and G. Lample, “Unsupervised translation of programming languages,” NeurIPs , 2020
2020
Later among the works it cites.
2021
Later among the works it cites.
A. F. da Silva, B. C. Kind, J. W. de Souza Magalhães, J. N. Rocha, B. C. Ferreira Guimarães, and F. M. Quinão Pereira, “Anghabench: A suite with one million compilable c benchmarks for code-size reduction,” in 2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO) , 2021, pp. 378–390
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
E. Schulte, J. Ruchti, M. Noonan, D. Ciarletta, and A. Loginov, “Evolving exact decompilation,” in Workshop on Binary Analysis Research (BAR) , 2018
2018
Cited alongside, same era.
X. Chen, C. Liu, and D. Song, “Tree-to-tree neural networks for program translation,” in Proceedings of the 32nd International Conference on Neural Information Processing Systems , ser. NIPS’18. Red Hook, NY, USA: Curran Associates Inc., 2018, p. 2552–2562
2018
Cited alongside, same era.
M. Drissi, O. Watkins, A. Khant, V. Ojha, P. Sandoval, R. Segev, E. Weiner, and R. Keller, “Program language translation using a grammar-driven tree-to-tree model,” 2018
2018
Cited alongside, same era.
E. A. Santos, J. C. Campbell, D. Patel, A. Hindle, and J. N. Amaral, “Syntax and sensibility: Using language models to detect and correct syntax errors,” in 2018 IEEE 25th International Conference on Software Analysis, Evolution and Reengineering (SANER) . IEEE, 2018, pp. 311–322
2018
Cited alongside, same era.
O. Katz, Y. Olshaker, Y. Goldberg, and E. Yahav, “Towards neural decompilation,” 2019
2019
Cited alongside, same era.
M. Ott, S. Edunov, A. Baevski, A. Fan, S. Gross, N. Ng, D. Grangier, and M. Auli, “fairseq: A fast, extensible toolkit for sequence modeling,” in Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics (Demonstrations) . Minneapolis, Minnesota: Association for Computational Linguistics, Jun. 2019, pp. 48–53. [Online]. Available: https://aclanthology.org/N19-4009
2019
Cited alongside, same era.
O. Katz, Y. Olshaker, Y. Goldberg, and E. Yahav, “Towards neural decompilation,” CoRR , 2019
2019
Cited alongside, same era.
2021
Later among the works it cites.
2021
Later among the works it cites.
D. Pizzolotto and K. Inoue, “Identifying compiler and optimization level in binary code from multipler architectures,” 2021
2021
Later among the works it cites.
H. Hong, J. Zhang, Y. Zhang, Y. Wan, and Y. Sui, “Fix-filter-fix: Intuitively connect any models for effective bug fixing,” in Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing , 2021, pp. 3495–3504
2021
Later among the works it cites.
J. Austin, A. Odena, M. Nye, M. Bosma, H. Michalewski, D. Dohan, E. Jiang, C. Cai, M. Terry, Q. Le, and C. Sutton, “Program synthesis with large language models,” CoRR , 2021
2021
Later among the works it cites.
Y. Kang, Z. Wang, H. Zhang, J. Chen, and Y. Hanmo, “APIRecX: Cross-library API recommendation via pre-trained language model,” EMNLP , 2021
2021
Later among the works it cites.
J. Armengol-Estapé and M. O’Boyle, “Learning c to x86 translation: An experiment in neural compilation,” in Advances in Programming Languages and Neurosymbolic Systems Workshop , 2021. [Online]. Available: https://openreview.net/forum?id=444ug_EYXet
2021
Later among the works it cites.
I. Hosseini and B. Dolan-Gavitt, “Beyond the C: Retargetable decompilation using neural machine translation,” Workshop on Binary Analysis Research , 2022
2022
Later among the works it cites.
Ghidra, 2022. [Online]. Available: https://ghidra-sre.org/
2022
Later among the works it cites.
Hex-Rays, 2022. [Online]. Available: https://hex-rays.com/blog/ida-8-2-released/
2022
Later among the works it cites.
J. Armengol-Estapé, J. Woodruff, A. Brauckmann, J. W. d. S. Magalhães, and M. F. P. O’Boyle, “Exebench: An ml-scale dataset of executable c functions,” in Proceedings of the 6th ACM SIGPLAN International Symposium on Machine Programming , ser. MAPS 2022. New York, NY, USA: Association for Computing Machinery, 2022, p. 50–59. [Online]. Available: https://doi.org/10.1145/3520312.3534867
2022
Later among the works it cites.
M. Muffo, A. Cocco, and E. Bertino, “Evaluating transformer language models on arithmetic operations using number decomposition,” in Proceedings of the Thirteenth Language Resources and Evaluation Conference . Marseille, France: European Language Resources Association, Jun. 2022, pp. 291–297. [Online]. Available: https://aclanthology.org/2022.lrec-1.30
2022
Later among the works it cites.
Y. Cao, R. Liang, K. Chen, and P. Hu, “Boosting neural networks to decompile optimized binaries,” in Proceedings of the 38th Annual Computer Security Applications Conference , 2022, pp. 508–518
2022
Later among the works it cites.
Y. Gui, Y. Wan, H. Zhang, H. Huang, Y. Sui, G. Xu, Z. Shao, and H. Jin, “Cross-language binary-source code matching with intermediate representations,” in 2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER) . Los Alamitos, CA, USA: IEEE Computer Society, mar 2022, pp. 601–612. [Online]. Available: https://doi.ieeecomputersociety.org/10.1109/SANER53432.2022.00077
2022
Later among the works it cites.
Z. C. Guo and W. S. Moses, “Enabling transformers to understand low-level programs,” in 2022 IEEE High Performance Extreme Computing Conference (HPEC) . IEEE, 2022, pp. 1–9
2022
Later among the works it cites.
Z. Tan, Y. Chon, M. Kruse, J. Doerfert, Z. Xu, B. Homerding, S. Campanoni, and D. I. August, “Splendid: Supporting parallel llvm-ir enhanced natural decompilation for interactive development,” in Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3 , 2023, pp. 679–693
2023
Closest in time.
2023
Closest in time.