53 citations · 158 across the 16 of their papers we have counts for
17 papers
DORA: Distributed Oracle Agreement with Simple Majority
Prasanth Chakka, Saurabh Joshi, Aniket Kate +2
Oracle networks feeding off-chain information to a blockchain are required to solve a distributed agreement problem since these networks receive information from multiple sources a…
OpenMP aware MHP Analysis for Improved Static Data-Race Detection
Utpal Bora, Shraiysh Vaishay, Saurabh Joshi +1
Data races, a major source of bugs in concurrent programs, can result in loss of manpower and time as well as data loss due to system failures. OpenMP, the de facto shared memory p…
GPURepair: Automated Repair of GPU Kernels
Saurabh Joshi, Gautam Muduganti
This paper presents a tool for repairing errors in GPU kernels written in CUDA or OpenCL due to data races and barrier divergence. Our novel extension to prior work can also remove…
Hardware/Software Co-verification Using Path-based Symbolic Execution
Rajdeep Mukherjee, Saurabh Joshi, John O'Leary +2
Conventional tools for formal hardware/software co-verification use bounded model checking techniques to construct a single monolithic propositional formula. Formulas generated in…
LLOV: A Fast Static Data-Race Checker for OpenMP Programs
Utpal Bora, Santanu Das, Pankaj Kukreja +3
In the era of Exascale computing, writing efficient parallel programs is indispensable and at the same time, writing sound parallel programs is very difficult. Specifying paralleli…
Phase Transition Behavior of Cardinality and XOR Constraints
Yash Pote, Saurabh Joshi, Kuldeep S. Meel
The runtime performance of modern SAT solvers is deeply connected to the phase transition behavior of CNF formulas. While CNF solving has witnessed significant runtime improvement…
Reflections on "Incremental Cardinality Constraints for MaxSAT"
Ruben Martins, Saurabh Joshi, Vasco Manquinho +1
To celebrate the first 25 years of the International Conference on Principles and Practice of Constraint Programming (CP) the editors invited the authors of the most cited paper of…
Pinaka: Symbolic Execution meets Incremental Solving (Competition Contribution)
Eti Chaudhary, Saurabh Joshi
Many modern-day solvers offer functionality for incremental SAT solving, which preserves the state of the solver across invocations. This is beneficial when multiple, closely relat…
Approximation Strategies for Incomplete MaxSAT
Saurabh Joshi, Prateek Kumar, Ruben Martins +1
Incomplete MaxSAT solving aims to quickly find a solution that attempts to minimize the sum of the weights of the unsatisfied soft clauses without providing any optimality guarante…
On the Tractability of (k,i)-Coloring
Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram +1
In an undirected graph, a proper (k,i)-coloring is an assignment of a set of k colors to each vertex such that any two adjacent vertices have at most i common colors. The (k,i)-col…
Equivalence Checking a Floating-point Unit against a High-level C Model (Extended Version)
Rajdeep Mukherjee, Saurabh Joshi, Andreas Griesmayer +2
Semiconductor companies have increasingly adopted a methodology that starts with a system-level design specification in C/C++/SystemC. This model is extensively simulated to ensure…
The Virtues of Conflict: Analyzing Modern Concurrency
Ganesh Narayanaswamy, Saurabh Joshi, Daniel Kroening
Modern shared memory multiprocessors permit reordering of memory operations for performance reasons. These reorderings are often a source of subtle bugs in programs written for suc…
Generalized Totalizer Encoding for Pseudo-Boolean Constraints
Saurabh Joshi, Ruben Martins, Vasco Manquinho
Pseudo-Boolean constraints, also known as 0-1 Integer Linear Constraints, are used to model many real-world problems. A common approach to solve these constraints is to encode them…
Safety Verification and Refutation by k-invariants and k-induction (extended version)
Martin Brain, Saurabh Joshi, Daniel Kroening +1
Most software verification tools can be classified into one of a number of established families, each of which has their own focus and strengths. For example, concrete counterexamp…
Incremental Cardinality Constraints for MaxSAT
Ruben Martins, Saurabh Joshi, Vasco Manquinho +1
Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolean Satisfiability (SAT) problem. In general, MaxSAT algorithms perform a succession of SAT solver calls to re…
Property-Driven Fence Insertion using Reorder Bounded Model Checking
Saurabh Joshi, Daniel Kroening
Modern architectures provide weaker memory consistency guarantees than sequential consistency. These weaker guarantees allow programs to exhibit behaviours where the program statem…
Automatically finding atomic regions for fixing bugs in Concurrent programs
Saurabh Joshi, Akash Lal
This paper presents a technique for automatically constructing a fix for buggy concurrent programs: given a concurrent program that does not satisfy user-provided assertions, we in…