ASE 2024
Sun 27 October - Fri 1 November 2024 Sacramento, California, United States
Wed 30 Oct 2024 14:00 - 14:15 at Magnoila - Library and dependancy Chair(s): Curtis Atkisson

In collaborative software development, developers generally make code changes and commit the changes to the repositories. Among others, “making small, single-purpose commits” is considered the best practice for making commits, allowing the team to quickly understand the code changes. Rather than following the best practice, developers often make \emph{tangled commits}, which wrap code changes that implement different purposes. Such commits make it difficult for other developers to understand the code changes when conducting subsequent development. Early works on untangling code changes rely on human-specified heuristic rules or features, do not consider context, and are labor-intensive. Recent works model the the local context of code changes as a graph at the statement level, with statements as nodes and code dependencies as edges, and then cluster the changed statements. However, recent works ignore the hidden dependencies in the global context, e.g. a pair of tangled code changes may have no code dependency, and a pair of untangled code changes may have obvious code dependency. To solve this problem, we focus on detecting hidden dependencies among code changes. We model the global context of code changes as graphs at finer-grained, hierarchical levels, i.e., at both entity and statement levels. Then we propose a Heterogeneous Directed Graph Neural Network (\emph{HD-GNN}) to detect hidden dependencies among code changes by aggregating the global context in both connected or disconnected entity-level subgraphs that intersected with the code changes. Evaluation of common C # and Java datasets with 1,612 and 14k \emph{tangled commits} and manually validated datasets (MVD) with 600 commits show that \emph{HD-GNN} achieves an average enhancement of effectiveness of 25$%$ and 19.2$%$ compared to existing approaches and far superior to existing approaches in MVD, without sacrificing time efficiency.

Wed 30 Oct

Displayed time zone: Pacific Time (US & Canada) change

13:30 - 15:00
13:30
15m
Talk
How to Pet a Two-Headed Snake? Solving Cross-Repository Compatibility Issues with Hera
Research Papers
Yifan Xie , Zhouyang Jia National University of Defense Technology, Shanshan Li National University of Defense Technology, Ying Wang Northeastern University, Jun Ma National University of Defense Technology, Xiaoling Li National University of Defense Technology, Haoran Liu National University of Defense Technology, Ying Fu National University of Defense Technology, Liao Xiangke National University of Defense Technology
13:45
15m
Talk
Towards Robust Detection of Open Source Software Supply Chain Poisoning Attacks in Industry Environments
Industry Showcase
Xinyi Zheng Huazhong University of Science and Technology, Chen Wei MYbank, Ant Group, Shenao Wang Huazhong University of Science and Technology, Yanjie Zhao Huazhong University of Science and Technology, Peiming Gao MYbank, Ant Group, Yuanchao Zhang Mybank, Ant Group, Kailong Wang Huazhong University of Science and Technology, Haoyu Wang Huazhong University of Science and Technology
14:00
15m
Talk
Detect Hidden Dependency to Untangle Commits
Research Papers
Mengdan Fan , Wei Zhang Peking University, Haiyan Zhao Peking University, Guangtai Liang Huawei Cloud Computing Technologies, Zhi Jin Peking University
14:15
15m
Talk
LeanBin: Harnessing Lifting and Recompilation to Debloat Binaries
Research Papers
Igor Wodiany University of Manchester, Antoniu Pop University of Manchester, Mikel Luján University of Manchester
DOI Pre-print
14:30
15m
Talk
Balancing the Quality and Cost of Updating Dependencies
Research Papers
Damien Jaime Université Paris Nanterre & LIP6, Pascal Poizat Université Paris Nanterre & LIP6, Joyce El Haddad Université Paris Dauphine - PSL , Thomas Degueule CNRS
14:45
10m
Talk
Depends-Kotlin: A Cross-Language Kotlin Dependency Extractor
Tool Demonstrations
Qiong Feng Nanjing University of Science and Technology, Xiaotian Ma Nanjing University of Science and Technology, Huan Ji Huawei Nanjing Research Center, Wei Song Nanjing University of Science and Technology, Peng Liang Wuhan University, China
DOI Pre-print Media Attached