A Survey on String Constraint Solving [article]

Roberto Amadini
2021 arXiv   pre-print
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.
arXiv:2002.02376v8 fatcat:why6oeufmrbozbl22jlf7yivea