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.
Cite
CITATION STYLE
Abdulla, P. A., Atig, M. F., Chen, Y. F., Holík, L., Rezine, A., Rümmer, P., & Stenman, J. (2015). Norn: An SMT solver for string constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9206, pp. 462–469). Springer Verlag. https://doi.org/10.1007/978-3-319-21690-4_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
