Detail publikace

Reasoning about Regular Properties: A Comparative Study

HOLÍK, L. HRUŠKA, M. SÍČ, J. VARGOVČÍK, P. FIEDOR, T. ROGALEWICZ, A.

Originální název

Reasoning about Regular Properties: A Comparative Study

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

Several new algorithms for deciding emptiness of Boolean combinations of regular languages and of languages of alternating automata have been proposed recently, especially in the context of analysing regular expressions and in string constraint solving. The new algorithms demonstrated a significant potential, but they have never been systematically compared, neither among each other nor with the state-of-the art implementations of existing (non)deterministic automata-based methods. In this paper, we provide such comparison as well as an overview of the existing algorithms and their implementations. We collect a diverse benchmark mostly originating in or related to practical problems from string constraint solving, analysing LTL properties, and regular model checking, and evaluate collected implementations on it. The results reveal the best tools and hint on what the best algorithms and implementation techniques are. Roughly, although some advanced algorithms are fast, such as antichain algorithms and reductions to IC3/PDR, they are not as overwhelmingly dominant as sometimes presented and there is no clear winner. The simplest NFA-based technology may sometimes be a better choice, depending on the problem source and the implementation style. We believe that our findings are relevant for development of automata techniques as well as for related fields such as string constraint solving.

Klíčová slova

Regular languages, finite automata, nondeterministic finite automata, tool comparison.

Autoři

HOLÍK, L.; HRUŠKA, M.; SÍČ, J.; VARGOVČÍK, P.; FIEDOR, T.; ROGALEWICZ, A.

Vydáno

27. 6. 2023

Nakladatel

Springer Nature Switzerland AG

Místo

Cham

ISSN

0302-9743

Periodikum

Lecture Notes in Computer Science

Číslo

14132

Stát

Spolková republika Německo

Strany od

286

Strany do

306

Strany počet

21

BibTex

@inproceedings{BUT185181,
  author="Lukáš {Holík} and Martin {Hruška} and Juraj {Síč} and Pavol {Vargovčík} and Tomáš {Fiedor} and Adam {Rogalewicz}",
  title="Reasoning about Regular Properties: A Comparative Study",
  booktitle="Automated Deduction - CADE 29",
  year="2023",
  journal="Lecture Notes in Computer Science",
  number="14132",
  pages="286--306",
  publisher="Springer Nature Switzerland AG",
  address="Cham",
  doi="10.1007/978-3-031-38499-8\{_}17",
  issn="0302-9743"
}