3 citations · 16 across the 22 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.LO2023
A Symbolic Algorithm for the Case-Split Rule in Solving Word Constraints with Extensions (Technical Report)
Yu-Fang Chen, Vojtěch Havlena, Ondřej Lengál +1
Case split is a core proof rule in current decision procedures for the theory of string constraints. Its use is the primary cause of the state space explosion in string constraint…
cs.FL2023★ 1 cited
Modular Mix-and-Match Complementation of Büchi Automata (Technical Report)
Vojtěch Havlena, Ondřej Lengál, Yong Li +2
Complementation of nondeterministic Büchi automata (BAs) is an important problem in automata theory with numerous applications in formal verification, such as termination analysis…
cs.LO2023★ 1 cited
An Automata-based Framework for Verification and Bug Hunting in Quantum Circuits (Technical Report)
Yu-Fang Chen, Kai-Min Chung, Ondřej Lengál +3
We introduce a new paradigm for analysing and finding bugs in quantum circuits. In our approach, the problem is given by a triple and the question is whether, giv…