StriCT-Bj:A String Constraint Benchmark from Real Java Programs

String constraint problems faced by program analysis tools are pervasive in programming, but datasets built specifically for real-world string constraints are rare. To understand the complexities of string-related constraints, we propose StriCT-BJ, a String_Constrain T Benchmark from Java. The data are extracted from popular real-world Java programs with string-related operations. We then evaluate the dataset using popular constraint solvers, identifying instances of divergent performance among the solvers with potential explanations. Our research highlights challenges in string constraint solving for program analysis, with a benchmark dataset for further development and evaluation of constraint solvers and program analysis tools.