SELGPLMar 22, 2022

Learning Program Semantics with Code Representations: An Empirical Study

arXiv:2203.11790v155 citationsh-index: 44
Originality Synthesis-oriented
AI Analysis

This provides a systematic comparison for researchers and practitioners in software engineering and AI for code, though it is incremental as it evaluates existing methods rather than proposing new ones.

The authors conducted an empirical study evaluating four categories of code representation techniques (feature-based, sequence-based, tree-based, and graph-based) on three code intelligence tasks (code classification, vulnerability detection, and clone detection), finding that graph-based representations performed best across tasks and node textual information was more critical than node type information.

Program semantics learning is the core and fundamental for various code intelligent tasks e.g., vulnerability detection, clone detection. A considerable amount of existing works propose diverse approaches to learn the program semantics for different tasks and these works have achieved state-of-the-art performance. However, currently, a comprehensive and systematic study on evaluating different program representation techniques across diverse tasks is still missed. From this starting point, in this paper, we conduct an empirical study to evaluate different program representation techniques. Specifically, we categorize current mainstream code representation techniques into four categories i.e., Feature-based, Sequence-based, Tree-based, and Graph-based program representation technique and evaluate its performance on three diverse and popular code intelligent tasks i.e., {Code Classification}, Vulnerability Detection, and Clone Detection on the public released benchmark. We further design three {research questions (RQs)} and conduct a comprehensive analysis to investigate the performance. By the extensive experimental results, we conclude that (1) The graph-based representation is superior to the other selected techniques across these tasks. (2) Compared with the node type information used in tree-based and graph-based representations, the node textual information is more critical to learning the program semantics. (3) Different tasks require the task-specific semantics to achieve their highest performance, however combining various program semantics from different dimensions such as control dependency, data dependency can still produce promising results.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes