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 14 papers between 2017 and 2023.

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

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

Newtonian Program Analysis of Probabilistic Programs.
CoRR, 2023

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...