4 citations · 20 across the 28 of their papers we have counts for
31 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…
Parameterized Verification of Quantum Circuits (Technical Report)
Parosh Aziz Abdulla, Yu-Fang Chen, Michal Hečko +4
We present the first fully automatic framework for verifying relational properties of parameterized quantum programs, i.e., a program that, given an input size, generates a corresp…
On Complementation of Nondeterministic Finite Automata without Full Determinization (Technical Report)
Lukáš Holík, Ondřej Lengál, Juraj Major +2
Complementation of finite automata is a basic operation used in numerous applications. The standard way to complement a nondeterministic finite automaton (NFA) is to transform it i…
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…
Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
Parosh Aziz Abdulla, Yo-Ga Chen, Yu-Fang Chen +5
We present a new method for the verification of quantum circuits based on a novel symbolic representation of sets of quantum states using level-synchronized tree automata (LSTAs).…