Result Details
String Constraints for Verification
Abdulla Parosh
Atig Mohamed
Chen Yu-Fang
Rummer Philipp
Stenman Jari
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.
verification
string
logic
@inproceedings{BUT111639,
author="Lukáš {Holík} and Parosh {Abdulla} and Mohamed {Atig} and Yu-Fang {Chen} and Philipp {Rummer} and Jari {Stenman}",
title="String Constraints for Verification",
booktitle="26th International Conference on Computer Aided Verification",
year="2014",
series="Lecture Notes in Computer Science, Volume 8559",
volume="8559",
pages="150--166",
publisher="Springer Verlag",
address="Berlin",
doi="10.1007/978-3-319-08867-9\{_}10",
isbn="978-3-319-08866-2",
url="http://link.springer.com/chapter/10.1007/978-3-319-08867-9_10"
}Verification of Infinite State Systems Based on Finite Automata, GACR, Postdoktorandské granty, GP13-37876P, start: 2013-02-01, end: 2015-12-31, completed
Verifikace a optimalizace počítačových systémů, BUT, Vnitřní projekty VUT, FIT-S-12-1, start: 2012-01-01, end: 2014-12-31, completed