Di Wang

Orcid: 0000-0002-2418-7987

Affiliations:
  • Peking University, Beijing, China
  • Carnegie Mellon University, Computer Science Department, Pittsburgh, PA, USA (former, PhD 2022)


According to our database1, Di Wang authored at least 32 papers between 2017 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Denotation-based Compositional Compiler Verification.
ACM Trans. Program. Lang. Syst., March, 2026

Inferring Typing Rules for Contextual Sugars.
Proceedings of the 2026 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation, 2026

Dependently-Typed AARA: A Non-Affine Approach for Resource Analysis of Higher-Order Programs.
Proceedings of the Programming Languages and Systems, 2026

A Program Logic for Under-approximating Worst-case Resource Usage.
Proceedings of the Programming Languages and Systems, 2026

2025
LLM-Assisted Model-Based Fuzzing of Protocol Implementations.
CoRR, August, 2025

C*: Unifying Programming and Verification in C.
CoRR, April, 2025

Automatic Linear Resource Bound Analysis for Rust via Prophecy Potentials.
Proc. ACM Program. Lang., 2025

CortenMM: Efficient Memory Management with Strong Correctness Guarantees.
Proceedings of the ACM SIGOPS 31st Symposium on Operating Systems Principles, 2025

2024
Artifact for OOPSLA'24: Semantics Lifting for Syntactic Sugar.
Dataset, September, 2024

Artifact for OOPSLA'24: Semantics Lifting for Syntactic Sugar.
Dataset, September, 2024

Decomposition-based Synthesis for Applying Divide-and-Conquer-like Algorithmic Paradigms.
ACM Trans. Program. Lang. Syst., June, 2024

Newtonian Program Analysis of Probabilistic Programs (Artifact).
Dataset, March, 2024

Newtonian Program Analysis of Probabilistic Programs.
Proc. ACM Program. Lang., 2024

Programmable MCMC with Soundly Composed Guide Programs.
Proc. ACM Program. Lang., 2024

Semantics Lifting for Syntactic Sugar.
Proc. ACM Program. Lang., 2024

Formalizing, Mechanizing, and Verifying Class-Based Refinement Types (Artifact).
Dagstuhl Artifacts Ser., 2024

Incremental Structure Discovery of Classification via Sequential Monte Carlo.
CoRR, 2024

Formalizing, Mechanizing, and Verifying Class-Based Refinement Types.
Proceedings of the 38th European Conference on Object-Oriented Programming, 2024

2023
Probabilistic Resource-Aware Session Types.
Proc. ACM Program. Lang., January, 2023

2022
Static Analysis of Probabilistic Programs: An Algebraic Approach
PhD thesis, 2022

2021
Expected-Cost Analysis for Probabilistic Programs and Semantics-Level Adaption of Optional Stopping Theorems.
CoRR, 2021

Sound probabilistic inference via guide types.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Central moment analysis for cost accumulators in probabilistic programs.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

2020
Raising expectations: automating expected cost analysis with types.
Proc. ACM Program. Lang., 2020

Liquid resource types.
Proc. ACM Program. Lang., 2020

Tail Bound Analysis for Probabilistic Programs via Central Moments.
CoRR, 2020

2019
Type-guided worst-case input generation.
Proc. ACM Program. Lang., 2019

A Denotational Semantics for Low-Level Probabilistic Programs with Nondeterminism.
Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics, 2019

Resource-guided program synthesis.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

2018
PMAF: an algebraic framework for static analysis of probabilistic programs.
Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2018

2017
TiML: a functional language for practical complexity analysis with invariants.
Proc. ACM Program. Lang., 2017

Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization.
Proceedings of the Programming Languages and Systems, 2017


  Loading...