• 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

JAN 2019 Please consider to submit your work to ATVA 2019, APLAS 2019, and SAS 2019.
SEP 2018 Attend CONFESTA, a joint event comprising the conferences CONCUR, FORMATS, QEST, and SETTA, and deliver a 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
DEC 2017 Attend the 2nd formal verification winter school in Israel.
NOV 2017 Consider to submit your best work to CONCUR 2018
OCT 2017 Give an invited keynote speech as a guest at the FMAC 2017 workshop, the biggest yearly gathering of formal methods researchers in mainland China.
AUG 2017 Our paper “Learning to Prove Safety over Parameterised Concurrent Systems” is accepted by FMCAD 2017
MAY 2017 Visit Uppsala University and Linköping University in Sweden
MAY 2017 Consider to submit your best work to APLAS 2017
APR 2017 Give an invited talk at the GaM workshop, Uppsala
MAR 2017 Our paper “Register automata with linear arithmetic” is accepted by LICS 2017
FEB 2017 Our paper “Flatten and Conquer (A Framework for Efficient Analysis of String Constraints)” is accepted by PLDI 2017
FEB 2017 Visit Institute of Software Chinese Academy of Sciences, Beijing

My primary research interest is the development of principled methods to ensure the quality of computer programs. I am particularly interested in software model checking and related techniques such as computational learning, automata theory, and satisfiability modulo theories (SMT). I am also interested in the applications of applying these techniques to ensure the correctness of real-world programs (e.g., high-speed crypto code and MapReduce programs).

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

Yu-Fang Chen, Chih-Duo Hong, Anthony W. Lin, Phillipp Rümmer
Learning to Prove Safety over Parameterised Concurrent Systems [preprint]
FMCAD 2017

Yu-Fang Chen, Ondrej Lengál, Tony Tan, Zhilin Wu
Register Automata with Linear Arithmetic [preprint]
LICS 2017

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Phi-Diep Bui, Yu-Fang Chen, Lukáš Holík, Ahmed Rezine, Philipp Rümmer
Flatten and Conquer (A Framework for Efficient Analysis of String Constraints) [preprint]
PLDI 2017

Yong Li, Yu-Fang Chen, Lijun Zhang and Depeng Liu
A Novel Learning Algorithm for Buchi Automata based on Family of DFAs and Classification Trees [preprint]
TACAS 2017

Yu-Fang Chen, Chih-Duo Hong, Ondrej Lengál, Shin-Cheng Mu, Nishant Sinha, Bow-Yaw Wang
An Executable Sequential Specification for Spark Aggregation [preprint]
NETYS 2017

Full Publication List

PC Duties: FASE 2020, SAS 2019, NETYS 2019, ATVA 2019, TACAS 2019, CONCUR 2018, SYNT 2018, FOMLAS 2018, VECoS 2018, APLAS 2017, ICTAC 2016, FM 2014, APLAS 2013, Infinity 2012, FM 2012, Infinity 2011
Organizers: 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