main
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
main [2023/07/21 13:10] yfc [Recent Publications] |
main [2024/05/13 06:50] (current) yfc [Research interests] |
||
|---|---|---|---|
| Line 8: | Line 8: | ||
| ==== Awards ==== | ==== Awards ==== | ||
| + | * Distinguished paper award **OOPSLA 2023** | ||
| * Young Scholar Creativity Award, Foundation for Advancement of Outstanding Scholarship, Taiwan, 2023 | * Young Scholar Creativity Award, Foundation for Advancement of Outstanding Scholarship, Taiwan, 2023 | ||
| * Distinguished paper award **PLDI 2023** | * Distinguished paper award **PLDI 2023** | ||
| Line 17: | Line 18: | ||
| * Formal Verification | * Formal Verification | ||
| + | * Quantum Programs | ||
| * Automata theory | * Automata theory | ||
| - | * Satisfibility Modulo Theory | + | * Satisfiability Modulo Theory |
| - | * Quantum Algortihms | + | |
| =====Recent Publications ===== | =====Recent Publications ===== | ||
| + | Hao Wu, Yu-Fang Chen, Zhilin Wu, Bican Xia, Naijun Zhan\\ | ||
| + | A Decision Procedure for String Constraints with String/Integer Conversion and Flat Regular Constraints.\\ **Acta Informatica 2024**\\ | ||
| + | |||
| + | Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc\\ | ||
| + | Z3-Noodler: An Automata-based String Solver.\\ | ||
| + | **TACAS 2024 (Best paper nomination)**\\ | ||
| + | |||
| + | Yu-Fang Chen, Vojtech Havlena, Ondrej Lengál, Andrea Turrini\\ | ||
| + | A symbolic Algorithm for the Case-split Rule in Solving Word Constraints with Extensions.\\ | ||
| + | **Journal System Software 2023**\\ | ||
| + | Yu-Fang Chen, David Chocholaty, Vojtech Havlena, Lukás Holik, Ondrej Lengal, Juraj Síc\\ | ||
| + | Solving String Constraints with Lengths by Stabilization.\\ | ||
| + | **OOPSLA 2023 (Distinguished paper award)** | ||
| Yu-Fang Chen, Philipp Rümmer and Wei-Lun Tsai\\ | Yu-Fang Chen, Philipp Rümmer and Wei-Lun Tsai\\ | ||
| - | [[|Link]] | ||
| A Theory of Cartesian Arrays with Applications in Quantum Circuit Verification.\\ | A Theory of Cartesian Arrays with Applications in Quantum Circuit Verification.\\ | ||
| **CADE 2023**\\ | **CADE 2023**\\ | ||
| Yu-Fang Chen, Kai-Min Chung, Ondřej Lengál, Jyun-Ao Lin, Wei-Lun Tsai.\\ | Yu-Fang Chen, Kai-Min Chung, Ondřej Lengál, Jyun-Ao Lin, Wei-Lun Tsai.\\ | ||
| - | AutoQ: An Automata-based Quantum Circuit Verifier.\\ | + | AutoQ: An Automata-based Quantum Circuit Verifier. |
| [[https://link.springer.com/chapter/10.1007/978-3-031-37709-9_7|Link]]\\ | [[https://link.springer.com/chapter/10.1007/978-3-031-37709-9_7|Link]]\\ | ||
| **CAV 2023**\\ | **CAV 2023**\\ | ||
| Line 110: | Line 124: | ||
| =====Services===== | =====Services===== | ||
| ====Recent PC Duties==== | ====Recent PC Duties==== | ||
| + | **2025** | ||
| + | FoSSaCS\\ | ||
| + | **2024** | ||
| + | CAV, ATVA, CONCUR, DATE, NETYS\\ | ||
| **2023** | **2023** | ||
| CAV, ATVA, SAS, DATE\\ | CAV, ATVA, SAS, DATE\\ | ||
main.1689945006.txt.gz · Last modified: 2023/07/21 13:10 by yfc
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
