Detail publikačního výsledku

Solving Not-Substring Constraint with Flat Abstraction

HOLÍK, L.; ABDULLA, P.; ATIG, M.; BUI PHI, D.; CHEN, Y.; WU, Z.

Originální název

Solving Not-Substring Constraint with Flat Abstraction

Anglický název

Solving Not-Substring Constraint with Flat Abstraction

Druh

Stať ve sborníku v databázi WoS či Scopus

Originální abstrakt

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.

Anglický abstrakt

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.

Klíčová slova

CEGAR, string constraints, strings

Klíčová slova v angličtině

CEGAR, string constraints, strings

Autoři

HOLÍK, L.; ABDULLA, P.; ATIG, M.; BUI PHI, D.; CHEN, Y.; WU, Z.

Rok RIV

2023

Vydáno

12.10.2021

Nakladatel

Springer International Publishing

Místo

Berlín

ISBN

978-3-030-89051-3

Kniha

Programming Languages and Systems - 19th Asian Symposium, APLAS 2021, Chicago, IL, USA, October 17-18, 2021, Proceedings

Edice

13008

Strany od

305

Strany do

320

Strany počet

16

URL

https://doi.org/10.1007/978-3-030-89051-3\_17

BibTex

@inproceedings{BUT182956,
  author="Lukáš {Holík} and Parosh {Abdulla} and Mohamed {Atig} and Diep {Bui Phi} and Yu-Fang {Chen} and Zhilin {Wu}",
  title="Solving Not-Substring Constraint with Flat Abstraction",
  booktitle="Programming Languages and Systems - 19th Asian Symposium, APLAS 2021, Chicago, IL, USA, October 17-18, 2021, Proceedings",
  year="2021",
  series="13008",
  pages="305--320",
  publisher="Springer International Publishing",
  address="Berlín",
  doi="10.1007/978-3-030-89051-3\{_}17",
  isbn="978-3-030-89051-3",
  url="https://doi.org/10.1007/978-3-030-89051-3\_17"
}