Yonghao Zou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yonghao Zou has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Diyu Zhou
Peking University, Beijing, China
3 shared publications - Junyang Zhang
Peking University
2 shared publications - Xiaolin Wang
Peking University, Beijing, China
2 shared publications - Yingwei Luo
Peking University, Beijing, China
2 shared publications - Zhenlin Wang
Michigan Technological University, Houghton, USA
2 shared publications - Can Cebeci
EPFL, Lausanne, Vaud, Switzerland
1 shared publication
Latest Publications
- 15 August 2026
- Published by Springer Nature
- p. 285-300
FlowGPU: Transparent and Efficient GPU Checkpointing and Restore
- 15 August 2026
- Published by Springer Nature
- p. 285-300
FlowGPU: Transparent and Efficient GPU Checkpointing and Restore
- Open Access
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1082-1098
CortenMM: Efficient Memory Management with Strong Correctness Guarantees
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1082-1098
Open AccessCortenMM: Efficient Memory Management with Strong Correctness Guarantees
- Open Access
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 455-472
Practical Verification of System-Software Components Written in Standard C
Systems code is challenging to verify, because it uses constructs (like raw pointers, pointer arithmetic, and bit twiddling) that are hard for tools to reason about. Existing approaches either sacrifice programmer friendliness, by demanding significant manual effort and verification expertise, or generality, by restricting the programming language or requiring that the code adapt to the verification tool. We identify a new point in the design space of verifiers that enables a different set of trade-offs, which prove practical in the context of verifying critical system components. We use several novel techniques to develop the TPot verification framework, targeted specifically at systems code written in C. With TPot, developers verify critical components they implement in standard, unrestricted C, using a C-based language to write "proof-oriented tests" (POTs) that specify the desired behavior. TPot then runs the POTs to prove correctness. We evaluate TPot on 6 different systemscode bases, and show that it can verify them at the same level as 4 state-of-the-art verifiers, while consistently reducing the annotation burden, ranging up to more than 3×. TPot does not require these code bases to be adapted for verification and achieves verification times compatible with typical continuous-integration workflows. TPot is open-source and freely available at https://github.com/dslab-epfl/tpot.
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 455-472
Open AccessPractical Verification of System-Software Components Written in Standard C
Systems code is challenging to verify, because it uses constructs (like raw pointers, pointer arithmetic, and bit twiddling) that are hard for tools to reason about. Existing approaches either sacrifice programmer friendliness, by demanding significant manual effort and verification expertise, or generality, by restricting the programming language or requiring that the code adapt to the verification tool. We identify a new point in the design space of verifiers that enables a different set of trade-offs, which prove practical in the context of verifying critical system components. We use several novel techniques to develop the TPot verification framework, targeted specifically at systems code written in C. With TPot, developers verify critical components they implement in standard, unrestricted C, using a C-based language to write "proof-oriented tests" (POTs) that specify the desired behavior. TPot then runs the POTs to prove correctness. We evaluate TPot on 6 different systemscode bases, and show that it can verify them at the same level as 4 state-of-the-art verifiers, while consistently reducing the annotation burden, ranging up to more than 3×. TPot does not require these code bases to be adapted for verification and achieves verification times compatible with typical continuous-integration workflows. TPot is open-source and freely available at https://github.com/dslab-epfl/tpot.