Evaluating the Effectiveness of Deep Learning Models for Foundational Program Analysis Tasks

While deep neural networks provide state-of-the-art solutions to a wide range of programming language tasks, their effectiveness in dealing with foundational program analysis tasks remains under explored. In this paper, we present an empirical study that evaluates four prominent models of code ( i.e., CuBERT, CodeBERT, GGNN, and Graph Sandwiches), plus four popular large language models ( i.e., GPT3.5 , GPT-4o mini , Qwen2.5-Coder , and DeepSeek Coder ), in two such foundational tasks: (1) alias prediction, in which models predict whether two pointers must alias, may alias or must not alias; and (2) equivalence prediction, in which models predict whether or not two programs are semantically equivalent. At the core of this study is CodeSem , a dataset built upon the source code of real-world flagship software ( e.g., Linux Kernel, GCC, MySQL) and manually validated for the two prediction tasks. Results show that all models are accurate in both prediction tasks. We also conduct a comprehensive, in-depth analysis of the results of all models in both tasks, concluding that deep learning models are generally capable of performing foundational tasks in program analysis even though in specific cases their weaknesses are also evident. Our code and evaluation data are publicly available at https://github.com/CodeSemDataset/CodeSem .

Authors

Institutions

Publication Details

Journal
ACM Transactions on Software Engineering and Methodology
Published
2026-03-17
DOI
https://doi.org/10.1145/3802541
Primary Topic
Software Engineering Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Evaluating the Effectiveness of Deep Learning Models for Foundational Program Analysis Tasks

Gang Yu, Quan Chen, Yue Wang, M. Zhang et al.
ACM Transactions on Software Engineering and Methodology
Software Engineering Research
article

Evaluating the Effectiveness of Deep Learning Models for Foundational Program Analysis Tasks

Gang Yu, Quan Chen, Yue Wang, M. Zhang, Ruyan Liu, Linzhang Wang, Ke Wang, Rouyi Chen
article en

Abstract

While deep neural networks provide state-of-the-art solutions to a wide range of programming language tasks, their effectiveness in dealing with foundational program analysis tasks remains under explored. In this paper, we present an empirical study that evaluates four prominent models of code ( i.e., CuBERT, CodeBERT, GGNN, and Graph Sandwiches), plus four popular large language models ( i.e., GPT3.5 , GPT-4o mini , Qwen2.5-Coder , and DeepSeek Coder ), in two such foundational tasks: (1) alias prediction, in which models predict whether two pointers must alias, may alias or must not alias; and (2) equivalence prediction, in which models predict whether or not two programs are semantically equivalent. At the core of this study is CodeSem , a dataset built upon the source code of real-world flagship software ( e.g., Linux Kernel, GCC, MySQL) and manually validated for the two prediction tasks. Results show that all models are accurate in both prediction tasks. We also conduct a comprehensive, in-depth analysis of the results of all models in both tasks, concluding that deep learning models are generally capable of performing foundational tasks in program analysis even though in specific cases their weaknesses are also evident. Our code and evaluation data are publicly available at https://github.com/CodeSemDataset/CodeSem .

ACM Transactions on Software Engineering and Methodology
Nanjing University (CN)
Openalex Percentile: Top 20%
Software Engineering Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.