Solving Not-Substring Constraint with Flat Abstraction
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F21%3APU147772" target="_blank" >RIV/00216305:26230/21:PU147772 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/978-3-030-89051-3_17" target="_blank" >https://doi.org/10.1007/978-3-030-89051-3_17</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-89051-3_17" target="_blank" >10.1007/978-3-030-89051-3_17</a>
Alternative languages
Result language
angličtina
Original language name
Solving Not-Substring Constraint with Flat Abstraction
Original language description
Not-substring is currently among the least supported types of string constraints, and existing solvers use only relatively crude heuristics. Yet, not-substring occurs relatively often in practical examples and is useful in encoding other types of constraints. In this paper, we propose a systematic way to solve not-substring using the Counter-Example Guided Abstraction Refinement (CEGAR) framework based on flat abstraction. In such a framework, the domain of string variables is restricted to flat languages and subsequently, the whole constraints can be expressed as linear arithmetic formulae. We show that non-substring constraints can be flattened efficiently, and provide experimental evidence that the proposed solution for not-substring is competitive with the state-of-the-art string solvers.
Czech name
—
Czech description
—
Classification
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)
Result continuities
Project
<a href="/en/project/LL1908" target="_blank" >LL1908: Efficient Finite Automata for Automated Reasoning</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Programming Languages and Systems - 19th Asian Symposium, APLAS 2021, Chicago, IL, USA, October 17-18, 2021, Proceedings
ISBN
978-3-030-89051-3
ISSN
—
e-ISSN
—
Number of pages
15
Pages from-to
305-320
Publisher name
Springer International Publishing
Place of publication
Berlín
Event location
Chicago
Event date
Oct 17, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000783821500017