A Survey on String Constraint Solving
It serves as a resource for researchers and practitioners in fields like formal analysis and cybersecurity, but is incremental as it reviews existing work without introducing new methods.
This paper provides a comprehensive survey on string constraint solving, exploring numerous approaches proposed over decades to address combinatorial problems involving string variables across various domains.
String constraint solving refers to solving combinatorial problems involving constraints over string variables. String solving approaches have become popular over the last years given the massive use of strings in different application domains like formal analysis, automated testing, database query processing, and cybersecurity. This paper reports a comprehensive survey on string constraint solving by exploring the large number of approaches that have been proposed over the last decades to solve string constraints.