Sriram Sankaranarayanan

Assistant Professor


<p>I am an assistant professor in the&nbsp;<a href="">Computer Science</a>&nbsp;department at the&nbsp;<a href="">University of Colorado&nbsp;</a>at Boulder. I am a member of the&nbsp;<a href="">Programming Languages &amp; Verification&nbsp;</a>and&nbsp;<a href="">Computer &amp; Cyber-Physical Systems&nbsp;</a>research groups. Previously, I was a member of research staff at&nbsp;<a href="" title="Link:">NEC Laboratories America</a>&nbsp;from 2005-2009. I graduated with a PhD in Computer Science from&nbsp;<a href="">Stanford University&nbsp;</a>in 2005.&nbsp;<a href="">Here&nbsp;</a>is a link to a brief biography.</p> <p><b>Research</b></p> <p>Simply put, I am interested in automatically proving programs correct or finding bugs in them.&nbsp;<a href="'s_theorem">As a rule</a>, such problems are&nbsp;<a href="">undecidable&nbsp;</a>, i.e., they cannot be solved in their full generality using a computer. Discovering ways to reformulate the problem (eg., find techniques to automatically discover simpler abstractions of a given program), and focusing on special but useful cases can still help us tackle many practical software systems.</p> <p>My focus is on reasoning about&nbsp;<a href="">hybrid dynamical (cyber-physical) systems</a>, which model discrete programs interacting with a continuous environment modeled by ordinary differential equations (ODEs).</p> <p>This research is part of the larger areas of Automata Theory, Logic and Formal Languages. My research naturally lends itself to techniques from diverse areas such as convex optimization, algebraic geometric methods, combinatorial optimization, Monte-Carlo techniques (rare-event simulation), symbolic and numerical decision procedures.</p>


Linear and Integer Programming