• Yu-Fang Chen
• Research Fellow (equivalent to the full professor rank in universities), Institute of Information Science, Academia Sinica
• Email: yfc@iis.sinica.edu.tw
• Phone: +886-2-2788-3799 #1514
• Address: No.128, Section 2, Academia Road, Nankang District, Taipei 115, Taiwan

APR 2022 We are recruiting!
Sep 2021 Please consider submit your best work to ATVA and CAV.
JUL 2021 Joined the steering committee of ATVA
JUL 2020 Our paper “Determinizing Crash Behavior with a Verified Snapshot-Consistent Flash Translation Layer” is accepted by OSDI 2020
FEB 2020 Our paper “Efficient Handling of String-Number Conversion” is accepted by PLDI 2020
NOV 2019 Gave an invited tutorial “String Constraint Solving — an Enabling Technique for Web Program Analysis” at SETTA 2019
SEP 2019 Visit Institute of Software Chinese Academy of Sciences, Beijing
MAY 2019 Visit Brno university of technology and attend MOSCA 2019.
JAN 2019 Please consider to submit your work to ATVA 2019, APLAS 2019, SETTA 2019, and SAS 2019.
SEP 2018 Attend CONFESTA, a joint event comprising the conferences CONCUR, FORMATS, QEST, and SETTA, and deliver an invited tutorial on string constraint solving and MapReduce program verification
JUN 2018 Visit Princeton University and attend PLDI
APR 2018 Visit Brno University of Technology in Czech Republic and attend ETAPS
FEB 2018 Our paper “Advanced Automata-based Algorithms for Program Termination Checking” is accepted by PLDI 2018

Yu-Fang Chen is a research fellow at the Institute of Information Science, Academia Sinica. He has more than ten years of experience in formal methods and verification. He has contributed to developing methods such as automata-based verification, algorithmic learning, and various types of decision procedures. He regularly publishes his work at top conferences (CAV, LICS, TACAS, CONCUR, PLDI, OSDI) and significant journals such as information & computation. He recently won the best journal paper of the year award (2021) from the Association of Algorithms & Computation theory (AACT), Taiwan. His work on finite automata inclusion testing won the best theory paper award in 2010 from European Association for Theoretical Computer Science (EATCS), selected from all major European software theory conferences in that year. His recent work on string constraint solving received the best paper award from Formal Methods 2023, a leading conference in the field.

He served on the program committees of over 40 international conferences in the past five years, including several most prestigious ones, such as CAV 2022, 2023, LICS 2021, ATVA 2019-2022, CONCUR 2020/2018, and TACAS 2019. He co-chaired ATVA 2019, the leading formal verification conference based in Asia. Since 2021, he has become one of the five steering committee members of ATVA.

His research interest is the development of principled methods to ensure the correctness and security of computer programs. He is best known for his works in the application of algorithmic learning algorithms to automate formal verification (TACAS 2008, 2009, 2013, 2017, 2019, CAV 2010, 2012, APSEC 2014, ICSE 2016, FMCAD 2017, NETYS 2019) and the design of efficient algorithms for finite state automata operations (FSTTCS 2009, TACAS 2010, CAV 2010, CONCUR 2011, LICS 2017, PLDI 2018). In recent years, he has shifted some of his research efforts to verify real-world programs. The current results include the verification of storage systems (OSDI 2021), concurrent programs running under x86 CPUs (TACAS 2012, SAS 2012, TACAS 2013), checking the commutativity of MapReduce programs (TACAS 2015, CAV 2016, APLAS 2019), programs that heavily use string data types – examples include JavaScript and Python programs (CAV 2014, 2015 PLDI 2017, ISSTA 2016, FMCAD 2018, PLDI 2021, APLAS 2021), and crypto programs (CCS 2014).

Frantisek Blahoudek, Yu-Fang Chen, David Chocholaty, Vojtech Havlena, Lukás Holik, Ondrej Lengal, Juraj Síc.
Word Equations in Synergy with Regular Constraints. Link
FM 2023 (Best paper award)

Yong Li, Yu-Fang Chen, Lijun Zhang,Depeng Liu
A novel learning algorithm for Büchi automata based on family of DFAs and classification trees Link
Information and Computation 2021

Yu-Fang Chen, Wei-Lun Tsai, Wei-Cheng Wu, Di-De Yen, Fang Yu
PyCT: A Python Concolic Tester.[preprint]
APLAS 2021

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Denghang Hu, Wei-Lun Tsai, Zhilin Wu, Di-De Yen
Solving Not-Substring Constraint withFlat Abstraction. [preprint]
APLAS 2021

Yu-Fang Chen, Vojtech Havlena, Ondrej Lengal, and Andrea Turrini
A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving [preprint]
APLAS 2020

Yun-Sheng Chang, Yao Hsiao, Tzu-Chi Lin, Che-Wei Tsao, Chun-Feng Wu, Yuan-Hao Chang, Hsiang-Shang Ko, and Yu-Fang Chen
Determinizing Crash Behavior with a Verified Snapshot-Consistent Flash Translation Layer [preprint]
OSDI 2020

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Phi-Diep Bui, Julian Dolby, Petr Janku, Hsin-Hung Lin, Lukas Holik, Wei-Cheng Wu
Efficient Handling of String-Number Conversion [preprint]
PLDI 2020

Yu-Fang Chen, Vojtech Havlena, Ondrej Lengál
Simulations in Rank-Based Büchi Automata Complementation. [preprint]
APLAS 2019

Yu-Fang Chen, Chang-Yi Chiang, Lukás Holík, Wei-Tsung Kao, Hsin-Hung Lin, Tomás Vojnar, Yean-Fu Wen, Wei-Cheng Wu
J-ReCoVer: Java Reducer Commutativity Verifier. [preprint]
APLAS 2019

Yu-Fang Chen, Hsiao-chen Chung, Wen-Chi Hung, Ming-Hsien Tsai, Bow-Yaw Wang, Farn Wang
Synthesize Models for Quantitative Analysis Using Automata Learning. [preprint]
NETYS 2019

Yong Li, Xuechao Sun, Andrea Turrini, Yu-Fang Chen, Junnan Xu
ROLL 1.0: Omega-Regular Language Learning Library [preprint]
TACAS 2019

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Ahmed Rezine, Philipp Rümmer
Trau: SMT solver for string constraints [preprint]
FMCAD 2018

Yu-Fang Chen, Matthias Heizmann, Ondrej Lengal, Yong Li, Ming-Hsien Tsai, Andrea Turrini, Lijun Zhang
Advanced Automata-based Algorithms for Program Termination Checking [preprint]
PLDI 2018

Matthias Heizmann, Yu-Fang Chen, Daniel Dietsch, Marius Greitschus, Jochen Hoenicke, Yong Li, Alexander Nutz, Betim Musa, Christian Schilling, Tanja Schindler, and Andreas Podelski
Ultimate Automizer and the Search for Perfect Interpolants (Competition Contribution) [preprint]
TACAS 2018

Earlier Publications

PC Duties: APSEC 2023,SAS 2023, ICFEM 2023, MEMOCODE 2023, ATVA 2023, CAV 2023, DATE 2023, ICFEM 2022, APSEC 2022, VECoS 2022, MEMOCODE 2022, RP 2022, CAV 2022, ATVA 2022, VECoS 2021, FMICS 2021, ATVA 2021, APLAS 2021, MEMOCODE 2021, LICS 2021, FASE 2021, VMCAI 2021, SETTA 2021, APSEC 2020, ICTAC 2020, ICFEM 2020, ICECCS 2020, SETTA 2020, NETYS 2020, ATVA 2020, FASE 2020, CONCUR 2020, HVCS 2020, SETTA 2019, SAS 2019, NETYS 2019, ATVA 2019, TACAS 2019, ICECCS 2019, CONCUR 2018, SYNT 2018, ICECCS 2018, FOMLAS 2018, VECoS 2018, APLAS 2017, ICTAC 2016, FM 2014, APLAS 2013, Infinity 2012, FM 2012, Infinity 2011
Organizers: VECoS 2020 (co-chair), ATVA 2019 (co-chair), Infinity 2010 (co-chair)

• Languageinclusion.org--A collection of recent research results on automata language inclusion testing
• Boolean fUnction Learning Library (BULL)
• The GOAL Tool
• Regular Omega Language Learning (ROLL) Library
• Multiplicity Automata Learning Library (MALL)
• Norn, a solver for string constraints