معرفی
Hongjin Liang is an Associate Professor at the School of Computer Science, Nanjing University, China. He is an active researcher and educator in the fields of programming languages and formal verification, with a strong focus on concurrency theory, mechanized proofs, and memory models.
Education:
- PhD in Computer Science (May 2014), dissertation titled Refinement Verification of Concurrent Programs and Its Applications.
Research Interests:
His research spans formal verification, concurrent programming, memory models, and mechanized reasoning. He is particularly known for his work on verifying concurrent data structures, program logics for concurrency, and certified compilation. He is a member of the PLaX research group.
Publications and Impact:
Liang has published extensively in top-tier venues such as POPL, PLDI, ESOP, TOPLAS, and CSL-LICS. His work often involves formalizing and verifying complex concurrent systems using interactive theorem provers like Rocq/Coq. Notable contributions include verifying compiler optimizations under weak memory models and developing program logics for randomized concurrent programs.
Scientific Awards:
- Distinguished Paper Award, PLDI 2019 for "Towards Certified Separate Compilation for Concurrent Programs"
Teaching and Advising:
He teaches undergraduate and graduate courses including Formal Semantics of Programming Languages, Concurrency: Algorithms and Theories, and Compiler Design. He has supervised graduate students and served on numerous program committees for international conferences.
Affiliations:
He is affiliated with the PLaX research group at Nanjing University and has collaborated with researchers such as Xinyu Feng, Zhong Shao, and Jan Hoffmann.
