Sanu Subramanian

Learn More
In recent years, string solvers have become an essential component in many formal-verification, security-analysis and bug-finding tools. Such solvers typically support a theory of string equations, the length function as well as the regular-expression membership predicate. These enable considerable expressive power, which comes at the cost of slow solving(More)
We develop order bounds on the refresh rate of computing functions over large multi-hop sensor networks, with finite degree (finite neighbors for each node). The refresh rate quantifies how often the function can be re-computed with new data at sensor nodes. Giridhar and Kumar (2005) considered deterministic function computation for two important classes of(More)
We present the Z3strBV solver for a many-sorted first-order quantifier-free theory Tw, bv of string equations, string length represented as bit-vectors, and bit-vector arithmetic aimed at formal verification, automated testing, and security analysis of C/C++ applications. Our key motivation for building such a solver is the observation that existing string(More)
1. Let G be a semisimple algebraic group defined over an algebraically closed field k of characteristic p. In this article, we construct the moduli space of semistable principal G bundles on a smooth projective curve X over k, of genus g ≥ 2. When the characteristic is zero, for example the field of complex numbers, these moduli spaces were first(More)
Let X be an irreducible smooth projective curve over an algebraically closed field k of characteristic p, with p > 5. Let G be a connected reductive algebraic group over k. Let H be a Levi factor of some parabolic subgroup of G and χ a character of H. Given a reduction E H of the structure group of a G-bundle E G to H, let E χ be the line bundle over X(More)
  • 1