Di Wang, Jan Hoffmann, Thomas Reps (2021). Expected-Cost Analysis for Probabilistic Programs and Semantics-Level Adaption of Optional Stopping Theorems. TR

Di Wang (Last updated on Apr 8, 2024) I am broadly interested in topics related to programming languages, especially formal verification, program analysis, and probabilistic programming.

Di Wang, Jan Hoffmann, Thomas Reps (2021). Expected-Cost Analysis for Probabilistic Programs and Semantics-Level Adaption of Optional Stopping Theorems. TR

Below are the slides for the theoretical part (in Chinese). Lecture 1: Course Introduction Lecture 2: Lexical Analysis Lecture 3: Syntax Analysis Lecture 4: Semantic Analysis Lecture 5: …

Probabilistic programming languages (PPLs) provide language support for expressing flexible probabilistic models and solving Bayesian inference problems. PPLs with *programmable …

Ruyi Ji, Yuwei Zhao, Yingfei Xiong, Di Wang, Lu Zhang, Zhenjiang Hu. February, 2024 TR Cite DOI Abstract. Algorithmic paradigms such as divide-and-conquer (D&C) are proposed to guide …

Syntactic sugar plays a crucial role in engineering programming languages. It offers convenient syntax and higher-level of abstractions, as witnessed by its pervasive use in both general …

Ke Sun, 王迪, Sheng Chen, Meng Wang, Dan Hao (2024). Formalizing, Mechanizing, and Verifying Class-based Refinement Types. In ECOOP. 引用 DOI Artifact

This article presents *liquid resource types*, a technique for automatically verifying the resource consumption of functional programs. Existing resource analysis techniques trade automation …

Ke Sun, Di Wang, Sheng Chen, Meng Wang, Dan Hao. September, 2024 Cite DOI Artifact. Abstract. Refinement types have been extensively used in class-based languages to specify …