1 citations · 1 across the 2 of their papers we have counts for
5 papers
Complementing Emerson-Lei Elevator Automata (Technical Report)
Ondrej Alexaj, VojtÄch Havlena, OndÅej Lengál +2
Büchi elevator automata naturally appear in several areas of formal methods as a structural expressibly-equivalent subclass of Büchi automata where every strongly connected compo…
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…
Negated String Containment is Decidable (Technical Report)
VojtÄch Havlena, Michal HeÄko, Lukáš HolÃk +1
We provide a positive answer to a long-standing open question of the decidability of the not-contains string predicate. Not-contains is practically relevant, for instance in symbol…
A Uniform Framework for Handling Position Constraints in String Solving (Technical Report)
Yu-Fang Chen, VojtÄch Havlena, Michal HeÄko +2
We introduce a novel decision procedure for solving the class of position string constraints, which includes string disequalities, not-prefixof, not-suffixof, strat, and not-str…
Complementation of Emerson-Lei Automata (Technical Report)
VojtÄch Havlena, OndÅej Lengál, Barbora Å mahlÃková
We give new constructions for complementing subclasses of Emerson-Lei automata using modifications of rank-based Büchi automata complementation. In particular, we propose a specia…