Abstract

We present version 1.0 of the Norn SMT solver for string constraints. Norn is a solver for an expressive constraint language, including word equations, length constraints, and regular membership queries. As a feature distinguishing Norn from other SMT solvers, Norn is a decision procedure under the assumption of a set of acyclicity conditions on word equations, without any restrictions on the use of regular membership.

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This work was supported by the Czech Science Foundation project 202/13/37876P, the Ministry of Science and Technology of Taiwan (103- 2221-E-001 -019 -MY3 and 103-2221-E-001 -020 -MY3), Uppsala Programming for Multicore Architectures Research Center (UPMARC), and the Linköping CENIIT Center (12.04).