This program is tentative and subject to change.
We present ParaSuit, a self-configuring technique that enhances symbolic execution by autonomously adjusting its parameters tailored to each program under test. Modern symbolic execution tools are typically equipped with various external parameters to effectively test real-world programs. However, the need for users to fine-tune a multitude of parameters for optimal testing outcomes makes these tools harder to use and limits their potential benefits. Despite recent efforts to improve this tuning process, existing techniques are not self-configuring; they cannot dynamically identify which parameters to tune for each target program, and for each manually selected parameter, they sample a value from a fixed, user-defined set of candidate values that is specific to that parameter and remains unchanged across programs. The goal of this paper is to automatically configure symbolic execution parameters from scratch for each program. To this end, ParaSuit begins by automatically identifying all available parameters in the symbolic execution tool and evaluating each parameter’s impact through interactions with the tool. It then applies a specialized algorithm to iteratively select promising parameters, construct sampling spaces for each, and update their sampling probabilities based on data accumulated from symbolic execution runs using sampled parameter values. We implemented ParaSuit on KLEE and assessed it across 12 open-source C programs. The results demonstrate that ParaSuit significantly outperforms the state-of-the-art method without self-configuring parameters, achieving an average of 26% higher branch coverage. Remarkably, ParaSuit identified 11 unique bugs, four of which were exclusively discovered by ParaSuit.
This program is tentative and subject to change.
Thu 16 AprDisplayed time zone: Brasilia, Distrito Federal, Brazil change
14:00 - 15:30 | Testing and Analysis 11Research Track at Oceania IX Chair(s): Sebastian Baltes Heidelberg University | ||
14:00 15mTalk | Efficient Build Dependency Verification Using eBPF and Incremental Analysis Research Track Yuta Saito Waseda University, Kazunori Sakamoto Tokyo Online Unicersity / Waseda University / National Institute of Informatics / WillBooster Inc., Hironori Washizaki Waseda University | ||
14:15 15mTalk | Hybrid Fault-Driven Mutation Testing for Python Research Track Pre-print | ||
14:30 15mTalk | No Shot in the Dark: Efficient Context-Free Language Reachability via Context-Aware Tabulation Research Track Chenghang Shi SKLP, Institute of Computing Technology, CAS, Lian Li Institute of Computing Technology at Chinese Academy of Sciences; University of Chinese Academy of Sciences | ||
14:45 15mTalk | Is Call Graph Pruning Really Effective? An Empirical Re-evaluation Research Track Mohammad Rafieian The University of Texas at Dallas, Vlad Birsan The University of Texas at Dallas, Kunal Katiya Coppell High School, Dylan Zhong , Shiyi Wei University of Texas at Dallas Pre-print | ||
15:00 15mTalk | MutDafny: A Mutation-Based Approach to Assess Dafny Specifications Research Track Isabel Amaral INESC TEC, Faculty of Engineering, University of Porto, Alexandra Mendes Faculty of Engineering, University of Porto & INESC TEC, José Campos Faculty of Engineering of the University of Porto, Portugal | ||
15:15 15mTalk | Enhancing Symbolic Execution with Self-Configuring Parameters Research Track | ||