Back  Home


I am primarily interested in addressing the challenge posed in rigorous verification of software. With software becoming ubiquitous in the modern world, and the increase in complexity of everyday programs, practical verification is gaining important. At the same time, we still need strong theoretical bounds to make practical verification possible.

My research has, on the one hand, focussed on solving specific problems like the increased complexity introduced due to concurrency, and pushing the frontier of the best verification tools for this specific instance of the problem; while at the same time, I have been interested in algebraic interpretations of the fix point problem underlying the field, and algebraic solutions leading to effective algorithms.

List of Publications:

  • Prabhu, P., Reps, T., Lal, A., and Kidd, N. Verifying concurrent programs via bounded context-switching and induction. TR-1701, Computer Sciences Department, University of Wisconsin, Madison, WI, November 2011. [abstract; PDF]