4 citations · 5 across the 5 of their papers we have counts for
5 papers
Efficient Verification of Concurrent Programs Over TSO Memory Model
Chinmay Narayan, Subodh Sharma, S. Arun-Kumar
We address the problem of efficient verification of multi-threaded programs running over Total Store Order (TSO) memory model. It has been shown that even with finite data domain p…
From Traces To Proofs: Proving Concurrent Program Safe
Chinmay Narayan, Subodh Sharma, Shibashis Guha +1
Nondeterminism in scheduling is the cardinal reason for difficulty in proving correctness of concurrent programs. A powerful proof strategy was recently proposed [6] to show the co…
Reducing Clocks in Timed Automata while Preserving Bisimulation
Shibashis Guha, Chinmay Narayan, S. Arun-Kumar
Model checking timed automata becomes increasingly complex with the increase in the number of clocks. Hence it is desirable that one constructs an automaton with the minimum number…
A Unifying Approach to Decide Relations for Timed Automata and their Game Characterization
Shibashis Guha, Shankara Narayanan Krishna, Chinmay Narayan +1
In this paper we present a unifying approach for deciding various bisimulations, simulation equivalences and preorders between two timed automata states. We propose a zone based me…
Inferring Fences in a Concurrent Program Using SC proof of Correctness
Chinmay Narayan, Shibashis Guha, S. Arun-Kumar
Most proof systems for concurrent programs assume the underlying memory model to be sequentially consistent (SC), an assumption which does not hold for modern multicore processors.…