4 citations · 20 across the 28 of their papers we have counts for
6 papers · 1 filter
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…
Optimizing an LTS-Simulation Algorithm (Technical Report)
Lukáš Holík, Jiří Šimáček
When comparing the fastest algorithm for computing the largest simulation preorder over Kripke structures with the one for labeled transition systems (LTS), there is a noticeable t…
Chain-Free String Constraints (Technical Report)
Parosh Aziz Abdulla, Mohamed Faouzi Atig Bui Phi Diep, Lukáš Holík +1
We address the satisfiability problem for string constraints that combine relational constraints represented by transducers, word equations, and string length constraints. This pro…
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…