Department of Information Technology

String Constraints for Verification


Jari Stenman, Uppsala University, Sweden

Date and Time

Tuesday, June 11th, 2014 at 16:45.


Polacksbacken, room 4306


We present a decision procedure for a logic that combines (i) word equations over string variables denoting words of arbitrary lengths, together with (ii) constraints on the length of words, and on (iii) the regular languages to which words belong. Decidability of this general logic is still open. Our procedure is sound for the general logic, and a decision procedure for a particularly rich fragment that restricts
the form in which word equations are written. In contrast to many existing procedures, our method does not make assumptions about the maximum length of words. We have developed a prototypical implementation of our decision procedure, and integrated it into a CEGAR-based model checker for the analysis of programs encoded as Horn clauses. Our tool is able to automatically establish the correctness of several programs
that are beyond the reach of existing methods.

Updated  2014-06-09 17:15:38 by Mohamed Faouzi Atig.