| ICFP 2024 |
Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System |
Linyu Yang |
10:00-10:30 |
| POPL 2024 |
Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs |
Sergei Novozhilov |
10:30-11:00 |
| OOPSLA 2024 |
Enhancing Static Analysis for Practical Bug Detection: An LLM-Integrated Approach |
Yutao Sun |
11:00-11:30 |
| PLDI 2024 |
Equivalence and Similarity Refutation for Probabilistic Programs |
Mingqi Yang |
13:00-13:30 |
| OSDI 2023 |
BWoS: Formally Verified Block-based Work Stealing for Parallel Processing |
Xiaqing Zhou |
13:30-14:00 |