1 citations · 6 across the 7 of their papers we have counts for
7 papers
String Solving with Stabilization and Transducers (Technical Report)
David Chocholatý, Vojtěch Havlena, Lukáš Holík +2
We generalize an efficient automata-based approach to string constraint solving, the stabilization-based method behind the solver Z3-Noodler, to support relational constraints repr…
Z3-Noodler: An Automata-based String Solver (Technical Report)
Yu-Fang Chen, David Chocholatý, Vojtěch Havlena +3
Z3-Noodler is a fork of Z3 that replaces its string theory solver with a custom solver implementing the recently introduced stabilization-based algorithm for solving word equations…
Mata, a Fast and Simple Finite Automata Library (Technical Report)
David Chocholatý, Tomáš Fiedor, Vojtěch Havlena +4
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 s…
Reasoning about Regular Properties: A Comparative Study
Tomáš Fiedor, Lukáš Holík, Martin Hruška +3
Several new algorithms for deciding emptiness of Boolean combinations of regular languages and of languages of alternating automata (AFA) have been proposed recently, especially in…
Fast Matching of Regular Patterns with Synchronizing Counting (Technical Report)
Lukáš Holík, Juraj Síč, Lenka Turoňová +1
Fast matching of regular expressions with bounded repetition, aka counting, such as (ab){50,100}, i.e., matching linear in the length of the text and independent of the repetition…
Word Equations in Synergy with Regular Constraints (Technical Report)
František Blahoudek, Yu-Fang Chen, David Chocholatý +4
When eating spaghetti, one should have the sauce and noodles mixed instead of eating them separately. We argue that also in string solving, word equations and regular constraints a…
Simulation Algorithms for Symbolic Automata (Technical Report)
Lukáš Holík, Ondřej Lengál, Juraj Síč +2
We investigate means of efficient computation of the simulation relation over symbolic finite automata (SFAs), i.e., finite automata with transitions labeled by predicates over alp…