DeepAI AI Chat
Log In Sign Up

Word Equations in Synergy with Regular Constraints (Technical Report)

by   František Blahoudek, et al.
Ecole nationale des Ponts et Chausses
Ensae ParisTech

When eating spaghetti, one should have the sauce and noodles mixed instead of eating them separately. We argue that also in string solving, word equations and regular constraints are better mixed together than approached separately as in most current string solvers. We propose a fast algorithm, complete for the fragment of chain-free constraints, in which word equations and regular constraints are tightly integrated and exchange information, efficiently pruning the cases generated by each other and limiting possible combinatorial explosion. The algorithm is based on a novel language-based characterisation of satisfiability of word equations with regular constraints. We experimentally show that our prototype implementation is competitive with the best string solvers and even superior in that it is the fastest on difficult examples and has the least number of timeouts.


page 1

page 2

page 3

page 4


Decidable Logics Combining Word Equations, Regular Expressions and Length Constraints

In this work, we consider the satisfiability problem in a logic that com...

Supercompiling String Programs Using Word Equations as Constraints

We describe a general parameterized scheme of program and constraint ana...

A Symbolic Algorithm for the Case-Split Rule in Solving Word Constraints with Extensions (Technical Report)

Case split is a core proof rule in current decision procedures for the t...

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility

Word equations are a crucial element in the theoretical foundation of co...

CertiStr: A Certified String Solver (technical report)

Theories over strings are among the most heavily researched logical theo...

The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability

The study of word equations (or the existential theory of equations over...

Program Specialization as a Tool for Solving Word Equations

The paper focuses on the automatic generating of the witnesses for the w...