Yu-Fang Chen

Yu-Fang Chen is a Full Professor and Research Fellow at the Institute of Information Science, Academia Sinica, Taiwan, where he has been affiliated since 2018. His research group focuses on cutting-edge work in formal methods, quantum programming, and automata theory, with significant contributions to quantum circuit verification and constraint solving.

His research centers on developing automata-based frameworks for quantum program verification (AutoQ Project), string constraint solving (Z3-Noodler), and symbolic execution techniques. Core interests include formal verification of quantum systems, satisfiability modulo theories, automata theory applications in quantum contexts, and developing practical verification tools.

Chen's recent publications (2020-2025) demonstrate a strong focus on quantum circuit verification, automata theory adaptations for quantum systems, and string constraint solving. Work frequently combines theoretical foundations with practical tool development, showing consistent innovation in quantum program analysis techniques and symbolic execution methods.

Awards & Honors:

• Academia Sinica Scholar Award (2025-2029)
• SIGLOG/CACM research highlights nomination (2025)
• Distinguished Paper Awards (OOPSLA 2023, PLDI 2023)
• Best Paper Awards (FM 2023, TACAS 2010)
• Young Scholar Creativity Award (2023)
• MOST Research Project for Excellent Junior Research Investigators (2020-2023)

Chen actively advises PhD students and postdoctoral researchers, with open positions advertised for his quantum computing and formal methods research group. He leads significant projects including the AutoQ framework development and has secured multi-year funding through the Academia Sinica Scholar Award and MOST grants.

He directs a research laboratory at Academia Sinica focused on automata theory and quantum verification, developing tools like AutoQ and Z3-Noodler. The team collaborates internationally and regularly contributes to top-tier conferences in formal methods and programming languages.