2018/05/23 by Quang Loc Le, Le, Quang Loc
Computer Science · #Digital and Cyber Forensics #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Software Testing and Debugging Techniques #Web Application Security Vulnerabilities
paper · pdf · doi:10.48550/arxiv.1805.09123
openalex publication_date 2018/05/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this work, we consider the satisfiability problem in a logic that combines word equations over string variables denoting words of unbounded lengths, regular languages to which words belong and Presburger constraints on the length of words. We present a novel decision procedure over two decidable fragments that include quadratic word equations (i.e., each string variable occurs at most twice). The proposed procedure reduces the problem to solving the satisfiability in the Presburger arithmetic. The procedure combines two main components: (i) an algorithm to derive a complete set of all solutions of conjunctions of word equations and regular expressions; and (ii) two methods to precisely compute relational constraints over string lengths implied by the set of all solutions.We have implemented a prototype tool and evaluated it over a set of satisfiability problems in the logic. The experimental results show that the tool is effective and efficient.