# Recent Publications

### Type-Guided Worst-Case Input Generation

This paper presents a novel technique for type-guided worst-case input generation for functional programs. The technique builds on …

### PMAF: An Algebraic Framework for Static Analysis of Probabilistic Programs

Automatically establishing that a probabilistic program satisfies some property $\varphi$ is a challenging problem. While a …

### A Denotational Semantics for Nondeterminism in Probabilistic Programs

Probabilistic programming is an increasingly popular technique for modeling randomness and uncertainty. Designing semantic models for …

### TiML: A Functional Language for Practical Complexity Analysis with Invariants

We present TiML (Timed ML), an ML-like functional language with time-complexity annotations in types. It uses indexed types to express …

### Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization

Library summarization is an effective way to accelerate the analysis of client code. However, information about the client is unknown …

# Recent Posts

### Using FFT to Speed Up DP

Problem link: Counting Road Networks | HackerRank. You are supposed to count the number of connected undirected labeled graphs with $n$ …

### Nondeterministic Interpretation

Suppose you have a toy specification with built-in nondeterminism, and you want to generate answers with respect to the specification: …