paper-with-me

홈 › Papers

Evaluation of Generalizability of Neural Program Analyzers under Semantic-Preserving Transformations

2020-04-15 · Md Rafiqul Islam Rabin, Mohammad Amin Alipour

The abundance of publicly available source code repositories, in conjunction with the advances in neural networks, has enabled data-driven approaches to program analysis. These approaches, called neural program analyzers, use neural networks to extract patterns in the programs for tasks ranging from development productivity to program reasoning. Despite the growing popularity of neural program analyzers, the extent to which their results are generalizable is unknown. In this paper, we perform a large-scale evaluation of the generalizability of two popular neural program analyzers using seven semantically-equivalent transformations of programs. Our results caution that in many cases the neural program analyzers fail to generalize well, sometimes to programs with negligible textual differences. The results provide the initial stepping stones for quantifying robustness in neural program analyzers.

📄 PDF Abstract BibTeX arXiv:2004.07313

Code (1)

mdrafiqulrabin/tnpa-generalizability 공식 구현

Tasks

Method name prediction

Similar Papers 제목 키워드 기반

On the Generalizability of Neural Program Models with respect to Semantic-Preserving Program Transformations

2020-07-31 · Md Rafiqul Islam Rabin, Nghi D. Q. Bui, Ke Wang, Yijun Yu 외

With the prevalence of publicly available source code repositories to train deep neural network models, neural program models can do well in source code analysis tasks such as predicting method names in given programs th…

Method name prediction

Testing Neural Program Analyzers

2019-08-25 · Md. Rafiqul Islam Rabin, Ke Wang, Mohammad Amin Alipour

Deep neural networks have been increasingly used in software engineering and program analysis tasks. They usually take a program and make some predictions about it, e.g., bug prediction. We call these models neural progr…

Method name prediction

Learning a Static Analyzer from Data

2016-11-06 · Pavol Bielik, Veselin Raychev, Martin Vechev

To be practically useful, modern static analyzers must precisely model the effect of both, statements in the programming language as well as frameworks used by the program under analysis. While important, manually addres…

Agentic Interpretation: Lattice-Structured Evidence for LLM-Based Program Analysis

2026-05-12 · Jacqueline L. Mitchell, Chao Wang arxiv

Large language models can consult information that fixed static analyzers cannot, such as documentation, current security advisories, version-specific metadata, and informal API contracts. This makes LLMs a compelling op…

Enhancing Repository-Level Code Generation with Integrated Contextual Information

2024-06-05 · Zhiyuan Pan, Xing Hu, Xin Xia, Xiaohu Yang

Large language models (LLMs) have demonstrated remarkable capabilities in code generation tasks. However, repository-level code generation presents unique challenges, particularly due to the need to utilize information s…

Code Generation