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: Intermediate Representations Lecture 6: Runtime Environments Lecture 7: Target Code Generation Lecture 8: Code Optimization

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 developers in designing efficient algorithms, but it can still be difficult to apply algorithmic paradigms to practical tasks. To ease the usage of paradigms, many ...

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

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-purpose and domain-specific contexts. Unfortunately, the traditional approach of translating programs containing syntactic sugars into the host language can …

Probabilistic programming languages (PPLs) provide language support for expressing flexible probabilistic models and solving Bayesian inference problems. PPLs with *programmable inference* make it possible for users to obtain improved results by customizing inference engines using *guide* programs that are tailored to a corresponding *model* program. However, errors in guide programs can ...

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 and verify fine-grained logical specifications. Despite the advances in practical aspects such as applicability and usability, two fundamental issues persist. First, the ...

This article presents *liquid resource types*, a technique for automatically verifying the resource consumption of functional programs. Existing resource analysis techniques trade automation for flexibility -- automated techniques are restricted to relatively constrained families of resource bounds, while more expressive proof techniques admitting value-dependent bounds rely …