Affiliation:
1. University of Bologna, Bologna, Italy
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Reference178 articles.
1. [n.d.]. Chuffed a Lazy Clause Generation Solver. Retrieved from https://github.com/chuffed/chuffed.
2. Efficient handling of string-number conversion
3. Flatten and conquer: a framework for efficient analysis of string constraints
4. Proceedings of the 26th International Conference of the Computer Aided Verification (CAV’14), Held as Part of the Vienna Summer of Logic (VSL 2014),;Abdulla Parosh Aziz,2014
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Slice closures of indexed languages and word equations with counting constraints;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Word Equations, Constraints, and Formal Languages;Lecture Notes in Computer Science;2024
3. A Closer Look at the Expressive Power of Logics Based on Word Equations;Theory of Computing Systems;2023-12-11
4. Black Ostrich: Web Application Scanning with String Solvers;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15
5. Group Equations With Abelian Predicates;International Mathematics Research Notices;2023-08-02