Detail publikace

Mata: A Fast and Simple Finite Automata Library

HOLÍK, L. CHOCHOLATÝ, D. FIEDOR, T. HAVLENA, V. HRUŠKA, M. LENGÁL, O. SÍČ, J.

Originální název

Mata: A Fast and Simple Finite Automata Library

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální abstrakt

Mata is a well-engineered automata library written in C++ that offers a unique combination of speed and simplicity. It is meant to serve in applications such as string constraint solving and reasoning about regular expressions, and as a reference implementation of automata algorithms. Besides basic algorithms for (non)deterministic automata, it implements a fast simulation reduction and antichain-based language inclusion checking. The simplicity allows a straightforward access to the low-level structures, making it relatively easy to extend and modify. Besides the C++ API, the library also implements a Python binding. The library comes with a large benchmark of automata problems collected from relevant applications such as string constraint solving, regular model checking, and reasoning about regular expressions. We show that Mata is on this benchmark significantly faster than all libraries from a wide range of automata libraries we collected. Its usefulness in string constraint solving is demonstrated by the string solver Z3-Noodler, which is based on Mata and outperforms the state of the art in string constraint solving on many standard benchmarks.

Klíčová slova

Nondeterministic finite automata, automata library

Autoři

HOLÍK, L.; CHOCHOLATÝ, D.; FIEDOR, T.; HAVLENA, V.; HRUŠKA, M.; LENGÁL, O.; SÍČ, J.

Vydáno

4. 4. 2024

Nakladatel

Springer Verlag

Místo

Luxembourgh

ISSN

0302-9743

Periodikum

Lecture Notes in Computer Science

Číslo

14571

Stát

Spolková republika Německo

Strany od

130

Strany do

151

Strany počet

22

URL

BibTex

@inproceedings{BUT188471,
  author="Lukáš {Holík} and David {Chocholatý} and Tomáš {Fiedor} and Vojtěch {Havlena} and Martin {Hruška} and Ondřej {Lengál} and Juraj {Síč}",
  title="Mata: A Fast and Simple Finite Automata Library",
  booktitle="Proceedings of TACAS'24",
  year="2024",
  journal="Lecture Notes in Computer Science",
  number="14571",
  pages="130--151",
  publisher="Springer Verlag",
  address="Luxembourgh",
  doi="10.1007/978-3-031-57249-4\{_}7",
  issn="0302-9743",
  url="https://link.springer.com/chapter/10.1007/978-3-031-57249-4_7"
}