A symbolic algorithm for the case-split rule in string constraint solving

DOI10.1007/978-3-030-64437-6_18MaRDI QIDQ2038090zbMATH OpenOpenAlexFDO

Authors Yu-Fang Chen, Vojtěch Havlena, Ondřej Lengál, Andrea Turrini

Publication date 8 July 2021

Full work available at URL https://doi.org/10.1007/978-3-030-64437-6_18

Mathematics Subject Classification ID

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

Recommendations

• An efficient SMT solver for string constraints
• A decision procedure for regular membership and length constraints over unbounded strings
• Z3str2: an efficient solver for strings, regular expressions, and length constraints
• Symbolic automata constraint solving
• Scaling up DPLL(T) string solvers using context-dependent simplification

Cited in

(4)

• Progressive reasoning over recursively-defined strings
• Word equations in synergy with regular constraints
• Cooking string-integer conversions with noodles
• Word equations in synergy with regular constraints (extended version)

This page was built for publication: A symbolic algorithm for the case-split rule in string constraint solving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2038090)