Solving String Theories Involving Regular Membership Predicates Using SAT

DOI10.1007/978-3-031-15077-7_8zbMath1514.6833MaRDI QIDQ6487302

Danny Bøgsted Poulsen, Dirk Nowotka, Kevin Lotz, Mitja Kulczynski

Publication date: 7 December 2022

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

Related Items (1)

Verified verifying: SMT-LIB for strings in Isabelle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An SMT solver for regular expressions and linear arithmetic over string length
• Finite automata and unary languages
• Periodic sets of integers
• String theories involving regular membership predicates: from practice to theory and back
• On solving word equations using SAT
• An efficient algorithm for solving word equations
• The expressibility of languages and relations by word equations
• Derivatives of Regular Expressions

This page was built for publication: Solving String Theories Involving Regular Membership Predicates Using SAT