A prototype CLP solver over strings using finite automata can generate valid German IBANs and date expressions, with speed comparable to an existing solver on the IBAN case.
MiniZinc with Strings
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
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.
fields
cs.LO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Towards Constraint Logic Programming over Strings for Test Data Generation
A prototype CLP solver over strings using finite automata can generate valid German IBANs and date expressions, with speed comparable to an existing solver on the IBAN case.