activity
20102023
most citedCounterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation

3 citations · 12 across the 15 of their papers we have counts for

collaborators
Showing cs.LOShow all

5 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.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…

cs.LO2022★ 1 cited

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…

cs.LO2017

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…

cs.LO2011

Algorithms for Synthesizing Priorities in Component-based Systems

Chih-Hong Cheng, Saddek Bensalem, Yu-Fang Chen +5

We present algorithms to synthesize component-based systems that are safe and deadlock-free using priorities, which define stateless-precedence between enabled actions. Our core me…