On Decidability of Prebisimulation for Timed Automata. - Shibashis Guha; Chinmay Narayan; S. Arun-Kumar 004 (CAV, 2012)

Relaxed separation logic: a program logic for C11 concurrency. - Viktor Vafeiadis; Chinmay Narayan (OOPSLA, 2013)

A Unifying Approach to Decide Relations for Timed Automata and their Game Characterization. - Shibashis Guha; Shankara Narayanan Krishna; Chinmay Narayan; S. Arun-Kumar 004 (EXPRESS/SOS, 2013)

Inferring Fences in a Concurrent Program Using SC proof of Correctness - Chinmay Narayan; Shibashis Guha; S. Arun-Kumar 004 (CoRR, 2013)

Reducing Clocks in Timed Automata while Preserving Bisimulation. - Shibashis Guha; Chinmay Narayan; S. Arun-Kumar 004 (CONCUR, 2014)

From Traces To Proofs: Proving Concurrent Program Safe. - Chinmay Narayan; Shibashis Guha; S. Arun-Kumar 004 (CoRR, 2015)

From Traces to Proofs: Proving Concurrent Programs Safe. - Chinmay Narayan; Subodh Vishnu Sharma; Shibashis Guha; S. Arun-Kumar 004 (TASE, 2016)

Efficient Verification of Concurrent Programs Over TSO Memory Model. - Chinmay Narayan; Subodh Sharma 001; S. Arun-Kumar 004 (CoRR, 2016)

LokDhaba: Acquiring, Visualizing and Disseminating Data on Indian Elections. - Mohit Kumar; Chinmay Narayan; Sudheendra Hangal; Priyamvada Trivedi (COMPASS, 2020)