Chain-Free String Constraints

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F19%3APU134969" target="_blank" >RIV/00216305:26230/19:PU134969 - isvavai.cz</a>

Result on the web

<a href="https://link.springer.com/chapter/10.1007/978-3-030-31784-3_16" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-030-31784-3_16</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-31784-3_16" target="_blank" >10.1007/978-3-030-31784-3_16</a>

Result language

angličtina

Original language name

Chain-Free String Constraints

Original language description

We address the satisfiability problem for string constraints that combine relational constraints represented by transducers, word equations, and string length constraints. This problem is undecidable in general. Therefore, we propose a new decidable fragment of string constraints, called weakly chaining string constraints, for which we show that the satisfiability problem is decidable. This fragment pushes the borders of decidability of string constraints by generalising the existing straight-line as well as the acyclic fragment of the string logic. We have developed a prototype implementation of our new decision procedure, and integrated it into an existing framework that uses CEGAR with under-approximation of string constraints based on flattening. This has led to an improvement of the running times as well as accuracy of the framework. We have demonstrated the competitiveness of the entire framework on benchmarks from the literature.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2019

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of ATVA'19

ISBN

978-3-030-31783-6

ISSN

—

e-ISSN

—

Number of pages

16

Pages from-to

277-293

Publisher name

Springer International Publishing

Place of publication

Cham

Event location

Taipei

Event date

Oct 27, 2019

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000723515700016