activity
20152021
most citedUnfolding-based Partial Order Reduction

8 citations · 9 across the 2 of their papers we have counts for

collaborators

5 papers

cs.PL2021

Thread-modular Analysis of Release-Acquire Concurrency

Divyanjali Sharma, Subodh Sharma

We present a thread-modular abstract interpretation(TMAI) technique to verify programs under the release-acquire (RA) memory model for safety property violations. The main contribu…

cs.PL2021

Dynamic Verification of C/C++11 Concurrency over Multi Copy Atomics

Sanjana Singh, Divyanjali Sharma, Subodh Sharma

We investigate the problem of runtime analysis of C11 programs under Multi-Copy-Atomic semantics (MCA). Under MCA, one can analyze program outcomes solely through interleaving and…

cs.CR20201 cited

An operational architecture for privacy-by-design in public service applications

Prashant Agrawal, Anubhutie Singh, Malavika Raghavan +2

Governments around the world are trying to build large data registries for effective delivery of a variety of public services. However, these efforts are often undermined due to se…

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.LO20158 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…