Template-based synthesis, also known as sketching, is a localized approach to program
synthesis in which the programmer provides not only a specification, but also a high-level" …

We present the first machine learning approach to the termination analysis of probabilistic
programs. Ranking supermartingales (RSMs) prove that probabilistic programs halt, in …

We study discrete probabilistic programs with potentially unbounded looping behaviors over
an infinite state space. We present, to the best of our knowledge, the first decidability result …

We present an exact Bayesian inference method for inferring posterior distributions encoded
by probabilistic programs featuring possibly unbounded loops. Our method is built on a …

Dependency pairs are one of the most powerful techniques to analyze termination of term
rewrite systems (TRSs) automatically. We adapt the dependency pair framework to the …

We present an exact Bayesian inference method for inferring posterior distributions encoded
by probabilistic programs featuring possibly unbounded looping behaviors. Our method is …

We present a novel modular approach to infer upper bounds on the expected runtimes of
probabilistic integer programs automatically. To this end, it computes bounds on the …

We present a new proof rule for verifying lower bounds on quantities of probabilistic
programs. Our proof rule is not confined to almost-surely terminating programs--as is the …

Recently, we adapted the well-known dependency pair (DP) framework to a dependency
tuple framework in order to prove almost-sure innermost termination (iAST) of probabilistic …

There are many evaluation strategies for term rewrite systems, but proving termination
automatically is usually easiest for innermost rewriting. Several syntactic criteria exist when …