  Strings are extensively used in modern programming languages and constraints
over strings of unknown length occur in a wide range of real-world applications
such as software analysis and verification, testing, model checking, and web
security. Nevertheless, practically no CP solver natively supports string
constraints. We introduce string variables and a suitable set of string
constraints as builtin features of the MiniZinc modelling language.
Furthermore, we define an interpreter for converting a MiniZinc model with
strings into a FlatZinc instance relying on only integer variables. This
provides a user-friendly interface for modelling combinatorial problems with
strings, and enables both string and non-string solvers to actually solve such
problems.
