Yu-Fang Chen

Yu-Fang Chen is a research professor at Academia Sinica, Taiwan, active across premier programming-languages venues such as PLDI, POPL, OOPSLA, SAS, APLAS and VMCAI. His work sits at the intersection of program verification, automata theory and constraint solving, with recent emphasis on quantum-circuit verification and string-number constraint solving.

Research interests revolve around rigorous methods to ensure software reliability: developing novel automata models (level-synchronized tree automata, position-constrained string automata), building practical solvers that blend length, substring and numeric constraints, and extending automated reasoning to the quantum domain. His papers consistently introduce new decision procedures, learning algorithms and tool-chains that improve the scalability of static analysis and formal verification.

Between 2017 and 2025 he (co-)authored more than a dozen peer-reviewed papers and served on over thirty program committees, including steering and organization chair roles for VMCAI 2026 and SAS 2023. No doctoral students or funded-grant details are disclosed in the supplied sources.