.png){kind=icon}
.png){kind=icon}
Return
A Survey on String Constraint Solving
.png){kind=icon}
OA
AI
DOI：10.1145/3484198.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
String constraint solving refers to solving combinatorial problems involving constraints over string variables. String solving approaches have become popular over the past few years given the massive use of strings in different application domains like formal analysis, automated testing, database query processing, and cybersecurity. This article reports a comprehensive survey on string constraint solving by exploring the large number of approaches that have been proposed over the past few decades to solve string constraints.
Keywords:
String constraint solving
constraint programming
satisfiability modulo theories
automata theory
software analysis