Martin Rinard

TL;DR: The standard approach to program transformation involves the use of discrete logical reasoning to prove that the transformation does not change the observable semantics of the program, but this work proposes a new approach that uses probabilistic reasoning to justify the application of transformations that may change, within Probabilistic accuracy bounds, the result that the program produces.

TL;DR: It is shown that the satisfiability problem for quantifier-free formulas over word equations in regular solved form, length constraints, and the membership predicate over regular expressions is also decidable.

TL;DR: An algorithm for deciding the first-order multisorted theory BAPA, which combines Boolean algebras of sets of uninterpreted elements (BA) and Presburger arithmetic operations (PA), is described and it is shown that it has optimal alternating time complexity and that it matches the complexity of PA.

TL;DR: A model of computation for approximate computations and an algorithm for optimizing these computations, which produces a (1+ε) randomized approximation to the optimal randomized computation that minimizes resource consumption subject to a probabilistic accuracy specification.

TL;DR: It is my pleasure to welcome you to SPLASH, the next step in the evolution of the well-known OOPSLA conference, which includes workshops, panels, tutorials, co-located conferences, posters, and a doctoral symposium.