Qiyuan Zhao (赵启元) In case you are interested in
how to pronounce my name …
“Qiyuan Zhao” is the Chinese Pinyin form of
my name. In Pinyin, the “Qi” part pronounces like the “chi” part of
“chip”; the “Zh” part pronounces like the “dr” part of “draw”; the “ao”
part pronounces like the “ow” part of “now”.
Ph.D. student at VERSE lab, School of Computing, National University of Singapore
I have worked in the general field of programming languages, formal methods and software engineering. That said, I decide to focus my research in my Ph.D. on programming language theory, and formal verification (using automated/interactive theorem provers).
Time format: YYYY.MM.DD
For the full list of my publications, please refer to my Google scholar page or my CV.
(CCS’24) Compositional Verification of Composite Byzantine Protocols
Qiyuan Zhao, George Pîrlea, Karolina Grzeszkiewicz, Seth Gilbert, Ilya Sergey
[ Preprint ] [ Artifact ] [ Github repo ] [ Slides ]
(The slides are scripted, since the presentation video seems not to be publicly available)
(ISSTA’24) Beyond Pairwise Testing: Advancing 3-wise Combinatorial Interaction Testing for Highly Configurable Systems
Chuan Luo, Shuangyu Lyu, Qiyuan Zhao, Wei Wu, Hongyu Zhang, Chunming Hu
[ Preprint ] [ Artifact ] [ Github repo ]
(PLDI’24) Mechanised Hypersafety Proofs about Structured Data
Vladimir Gladshtein, Qiyuan Zhao, Willow Ahrens, Saman Amarasinghe, Ilya Sergey
[ Preprint ] [ Extended version ] [ Artifact ] [ Github repo ] [ Presentation video ]
(CPP’24) Rooting for Efficiency: Mechanised Reasoning about Array-Based Trees in Separation Logic
Qiyuan Zhao, George Pîrlea, Zhendong Ang, Umang Mathur, Ilya Sergey
[ Preprint ] [ Artifact ] [ Github repo ] [ Slides ] [ Presentation video ] Distinguished Paper Award
(ESEC/FSE’23) CAmpactor: A Novel and Effective Local Search Algorithm for Optimizing Pairwise Covering Arrays
Qiyuan Zhao, Chuan Luo, Shaowei Cai, Wei Wu, Jinkun Lin, Hongyu Zhang, Chunming Hu
[ Preprint ] [ Artifact ] [ Github repo ] [ Slides ] [ Presentation video ]
(ESEC/FSE’22) SamplingCA: Effective and Efficient Sampling-Based Pairwise Testing for Highly Configurable Software Systems
Chuan Luo, Qiyuan Zhao, Shaowei Cai, Hongyu Zhang, Chunming Hu
[ Preprint ] [ Artifact ] [ Github repo ] [ Presentation video ]
Note: I decide to update this section periodically, probably every 1-2 weeks? Or every 1-2 months? I don’t know; it just depends.
Great talks:
Useful resources (can be publicly found on the Internet):
The (soft) things-one-should-know-before-or-during-one’s-PhD series:
For fun:
Apply base64 decoder three times on this: Wlc1R05VMVVRWGhQUlVKdllqTlNkRmxYYkhOTWJVNTJZbEU5UFE9PQ==
.
I set the number to be three because, by the beginning of 2024, a capable machine like ChatGPT could quickly resolve text encoded once or twice, but not when encoded three times. However, as found in August 2024, ChatGPT could already generate a Python script capable of decoding text regardless of how many times it is encoded. Therefore, this trick to prevent email plaintext from appearing is no longer meaningful.
Powered by Flask & nginx & gunicorn & pandoc & a trick to improve one’s webpage
Last updated: 2024.10.19