University of Oxford Logo University of OxfordDepartment of Computer Science - Home

Subodh Sharma

Personal photo - Subodh Sharma
Dr Subodh Sharma
Research Assistant

Wolfson Building, Parks Road, Oxford OX1 3QD

Interests

My broad goal is to use automated verification techniques to ensure software reliability and security. My primary interests lie in the verification of concurrent and distributed programs via static/dynamic analysis and model checking. 

Biography

I am currently a post-doctoral research assistant in the Systems Verification group headed by Prof. Daniel Kroening since April, 2012. I finished my Ph.D. from the University of Utah under the supervision of Prof. Ganesh Gopalakrishnan in March, 2012. During my PhD I studied the problem of verifying message passing software (written using MPI and MCAPI) via dynamic verification methods. My on-going work here in Oxford is focused on exploring symbolic based methods  to assist dynamic verification thereby allowing scalable verification of message passing software. My complete list of publications and projects can be found at www.cs.utah.edu/~svs.

Selected Publications

View all

Manage publications

Precise Predictive Analysis for Discovering Communication Deadlocks in Message Passing Programs

Vojtech Forejt‚ Daniel Kroening‚ Ganesh Narayanswamy and Subodh Sharma

In Formal Methods. 2014.

Abstract: MAPPED: Predictive Dynamic Analysis Tool for MPI Applications

Subodh Sharma‚ Ganesh Gopalakrishnan and Greg Bronevetsky

In 2012 SC Companion: High Performance Computing‚ Networking Storage and Analysis‚ Salt Lake City‚ UT‚ USA‚ November 10−16‚ 2012. Pages 1425–1426. IEEE Computer Society. 2012.

A Sound Reduction of Persistent−Sets for Deadlock Detection in MPI Applications

Subodh Sharma‚ Ganesh Gopalakrishnan and Greg Bronevetsky

In Rohit Gheyi and David A. Naumann, editors, Formal Methods: Foundations and Applications − 15th Brazilian Symposium‚ SBMF 2012‚ Natal‚ Brazil‚ September 23−28‚ 2012. Proceedings. Vol. 7498 of Lecture Notes in Computer Science. Pages 194–209. Springer. 2012.