activity
20122019
most citedFrom Non-preemptive to Preemptive Scheduling using Synchronization Synthesis

3 citations · 3 across the 3 of their papers we have counts for

collaborators

6 papers

cs.PL2022

Bounded Verification of Doubly-Unbounded Distributed Agreement-Based Systems

Christopher Wagner, Nouraldin Jaber, Roopsha Samanta

The ubiquity of distributed agreement protocols, such as consensus, has galvanized interest in verification of such protocols as well as applications built on top of them. The comp…

cs.LG2019

ART: Abstraction Refinement-Guided Training for Provably Correct Neural Networks

Xuankang Lin, He Zhu, Roopsha Samanta +1

Artificial Neural Networks (ANNs) have demonstrated remarkable utility in various challenging machine learning applications. While formally verified properties of their behaviors a…

cs.PL2018

Program Repair via Direct State Manipulation

Qinheping Hu, Isaac Evavold, Roopsha Samanta +2

The goal of program repair is to automatically fix programs to meet a specification. We propose a new specification mechanism, direct manipulation, in which the programmer can visu…

cs.FL2015

Lipschitz Robustness of Timed I/O Systems

Thomas A. Henzinger, Jan Otop, Roopsha Samanta

We present the first study of robustness of systems that are both timed as well as reactive (I/O). We study the behavior of such timed I/O systems in the presence of "uncertain inp…

cs.PL20153 cited

From Non-preemptive to Preemptive Scheduling using Synchronization Synthesis

Pavol Černý, Edmund M. Clarke, Thomas A. Henzinger +4

We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedu…

cs.LO2012

Towards Algorithmic Synthesis of Synchronization for Shared-Memory Concurrent Programs

Roopsha Samanta

We present a framework that takes a concurrent program composed of unsynchronized processes, along with a temporal specification of their global concurrent behaviour, and automatic…