I am a second-year PhD candidate in Computer Science and Engineering (CSE) at the University of Michigan. My research interests are formal verification. In the past, I have worked on software/hardware model checking and satisfiability (SAT, QBF, SMT). Currently, I am switching research focus and exploring interactive theorem proving and programming languages for formal verification. I received my B.S. and M.S. degree in ECE from the National Taiwan University, during which I was advised by Prof. Jie-Hong Roland Jiang.

News

• April, 2025: Our paper QSM-Cutoff: Systematic Derivation of Quantified Cutoff Formulas for Distributed Protocols is accepted at CAV 2025.
• Mar, 2025: I have become a Ph.D. candidate!
• Oct, 2024: I gave a talk on our work SAT-Based Quantified Symmetric Minimization of the Reachable States of Distributed Protocols: An Update at ISoLA 2024.
• Aug, 2024: I gave a talk on our work Knowledge Compilation for Incremental and Checkable Stochastic Boolean Satisfiability at IJCAI 2024.
• July, 2024: Our paper SAT-Based Quantified Symmetric Minimization of the Reachable States of Distributed Protocols: An Update is accepted at ISoLA 2024.
• April, 2024: Our paper Knowledge Compilation for Incremental and Checkable Stochastic Boolean Satisfiability was accepted at IJCAI 2024.