8 citations · 9 across the 2 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2016
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…
cs.LO2015★ 8 cited
Unfolding-based Partial Order Reduction
César Rodríguez, Marcelo Sousa, Subodh Sharma +1
Partial order reduction (POR) and net unfoldings are two alternative methods to tackle state-space explosion caused by concurrency. In this paper, we propose the combination of bot…