3 citations · 12 across the 15 of their papers we have counts for
15 papers
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…
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…
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…
Weakly Durable High-Performance Transactions
Yun-Sheng Chang, Yu-Fang Chen, Hsiang-Shang Ko
Existing disk-based database systems largely fall into two categories -- they either provide very high performance but few guarantees, or expose the transaction abstraction satisfy…
Simulations in Rank-Based Büchi Automata Complementation (Technical Report)
Yu-Fang Chen, Vojtěch Havlena, Ondřej Lengál
Complementation of Büchi automata is an essential technique used in some approaches for termination analysis of programs. The long search for an optimal complementation constructio…
Learning to Prove Safety over Parameterised Concurrent Systems (Full Version)
Yu-Fang Chen, Chih-Duo Hong, Anthony W. Lin +1
We revisit the classic problem of proving safety over parameterised concurrent systems, i.e., an infinite family of finite-state concurrent systems that are represented by some fin…