Publication Details

Solving String Constraints with Approximate Parikh Image

HOLÍKOVÁ, L.; JANKŮ, P. Solving String Constraints with Approximate Parikh Image. In Proceedings of EUROCAST'19. Lecture Notes in Computer Science. Heidelberg: Springer International Publishing, 2019. p. 1-8. ISBN: 978-3-030-45092-2.
Czech title
Řešení řetězcových omezení pomocí přibližného Parikh Image
Type
conference paper
Language
English
Authors
Holíková Lenka, Ing., Ph.D. (DITS)
Janků Petr, Ing. (DITS)
Keywords

String constraint solving, Program verification, Parikh Image, Alternating Finite Automata, Decision Procedure

Abstract

In this paper, we propose a refined version of the Parikh image abstraction of finite automata to resolve string length constraints. We integrate this abstraction into the string solver SLOTH, where on top of handling length constraints, our abstraction is also used to speed-up solving other types of constraints. The experimental results show that our extension of SLOTH has good results on simple benchmarks as well as on complex benchmarks that are real-word combinations of transducer and concatenation constraints.

Published
2019
Pages
1–8
Proceedings
Proceedings of EUROCAST'19
Series
Lecture Notes in Computer Science
ISBN
978-3-030-45092-2
Publisher
Springer International Publishing
Place
Heidelberg
DOI
10.1007/978-3-030-45093-9_59
EID Scopus
2-s2.0-85083999125
BibTeX 
@inproceedings{BUT162295,
  author="Lenka {Holíková} and Petr {Janků}",
  title="Solving String Constraints with Approximate Parikh Image",
  booktitle="Proceedings of EUROCAST'19",
  year="2019",
  series="Lecture Notes in Computer Science",
  pages="1--8",
  publisher="Springer International Publishing",
  address="Heidelberg",
  doi="10.1007/978-3-030-45093-9\{_}59",
  isbn="978-3-030-45092-2",
  url="https://www.fit.vut.cz/research/publication/12135/"
}
Back to top