SPLASH 2025
Sun 12 - Sat 18 October 2025 Singapore
co-located with ICFP/SPLASH 2025
Thu 16 Oct 2025 11:00 - 11:15 at Orchid Plenary Ballroom - Code Chair(s): Jiasi Shen

Program reduction is a widely used technique in testing and debugging language processors. Given a program that triggers a bug in a language processor, program reduction searches for a canonicalized and minimized program that triggers the same bug, thereby facilitating bug deduplication and simplifying the debugging process. To improve reduction performance without sacrificing generality, prior research has leveraged the formal syntax of the programming language as guidance. Two key syntax-guided transformations—Compatible Substructure Hoisting and Quantified Node Reduction—were introduced to enhance this process. While these transformations have proven effective to some extent, their application excessively prunes the search space, preventing the discovery of many smaller results. Consequently, there remains significant potential for further improvement in overall reduction performance. To this end, we propose a novel syntax-guided transformation named Structure Form Conversion (SFC) to complement the aforementioned two transformations. Building on SFC, we introduce three reduction methods: Smaller Structure Replacement, Identifier Elimination, and Structure Canonicalization, designed to effectively and efficiently leverage SFC for program reduction. By integrating these reduction methods to previous language-agnostic program reducers, Perses and Vulcan, we implement two prototypes named SFCPerses and SFCVulcan. Extensive evaluations show that SFCPerses and SFCVulcan significantly outperforms Perses and Vulcan in both minimization and canonicalization. Specifically, compared to Perses, SFCPerses produces programs that are 36.82%, 18.71%, and 41.05% smaller on average on the C, Rust, and SMT-LIBv2 benchmarks at the cost of 3.65×, 16.99×, and 1.42× the time of Perses, respectively. Similarly, SFCVulcan generates programs that are 14.51%, 7.65%, and 7.66% smaller than those produced by Vulcan at the cost of 1.56×, 2.35×, and 1.42× the execution time of Vulcan. Furthermore, in an experiment with a benchmark suite containing 3,796 C programs that trigger 46 unique bugs, SFCPerses and SFCVulcan reduce 442 and 435 more duplicates (programs that trigger the same bug) to identical programs than Perses and Vulcan, respectively.

Thu 16 Oct

Displayed time zone: Perth change

10:30 - 12:15
CodeOOPSLA at Orchid Plenary Ballroom
Chair(s): Jiasi Shen The Hong Kong University of Science and Technology
10:30
15m
Talk
ABC: Towards a Universal Code Styler through Model Merging
OOPSLA
Yitong Chen School of Computer Science and Engineering, College of Software Engineering, School of Artificial Intelligence, Southeast University, Zhiqiang Gao School of Computer Science and Engineering, College of Software Engineering, School of Artifical Intelligence, Southeast University, Chuanqi Shi School of Computer Science and Engineering, College of Software Engineering, School of Artifical Intelligence, Southeast University, Baixuan Li School of Computer Science and Engineering, College of Software Engineering, School of Artifical Intelligence, Southeast University, Miao Gao School of Computer Science and Engineering, College of Software Engineering, School of Artifical Intelligence, Southeast University
10:45
15m
Talk
Binary Cryptographic Function Identification via Similarity Analysis with Path-insensitive Emulation
OOPSLA
Yikun Hu Shanghai Jiao Tong University, Yituo He Shanghai Jiao Tong University, Wenyu He Shanghai Jiao Tong University, Haoran Li Shanghai Jiao Tong University, Yubo Zhao Shanghai Jiao Tong University, Shuai Wang Hong Kong University of Science and Technology, Dawu Gu Shanghai Jiao Tong University
11:00
15m
Talk
Boosting Program Reduction with the Missing Piece of Syntax-Guided Transformations
OOPSLA
Zhenyang Xu University of Waterloo, Yongqiang Tian Monash University, Mengxiao Zhang , Chengnian Sun University of Waterloo
11:15
15m
Talk
Code Style Sheets: CSS for Code
OOPSLA
Sam Cohen University of Chicago, Ravi Chugh University of Chicago
11:30
15m
Talk
Enhancing APR with PRISM: A Semantic-Based Approach to Overfitting Patch Detection
OOPSLA
Dowon Song Korea University, Hakjoo Oh Korea University
11:45
15m
Talk
PAFL: Enhancing Fault Localizers by Leveraging Project-Specific Fault Patterns
OOPSLA
Donguk Kim , Doha Hwang Samsung, Minseok Jeon DGIST, Hakjoo Oh Korea University
12:00
15m
Talk
Stencil-Lifting: Hierarchical Recursive Lifting System for Extracting Summary of Stencil Kernel in Legacy Codes
OOPSLA
Mingyi Li Institute of Computing Technology, CAS, Junmin Xiao , Siyan Chen Institute of Computing Technology, Chinese Academy of Sciences, Hui Ma Institute of Computing Technology, Chinese Academy of Sciences, Xi Chen Institute of Computing Technology, Chinese Academy of Sciences, Peihua Bao University of Chinese Academy of Sciences, Liang Yuan Chinese Academy of Sciences, Guangming Tan Chinese Academy of Sciences(CAS)