Search Results for author: Saurabh Joshi

Found 7 papers, 3 papers with code

GPURepair: Automated Repair of GPU Kernels

1 code implementation17 Nov 2020 Saurabh Joshi, Gautam Muduganti

To the best of our knowledge, GPURepair is the only tool that can propose a fix for intra-block data races and barrier divergence errors for both CUDA and OpenCL kernels and the only tool that fixes inter-block data races for CUDA kernels.

Distributed, Parallel, and Cluster Computing Software Engineering

LLOV: A Fast Static Data-Race Checker for OpenMP Programs

no code implementations27 Dec 2019 Utpal Bora, Santanu Das, Pankaj Kukreja, Saurabh Joshi, Ramakrishna Upadrasta, Sanjay Rajopadhye

In the era of Exascale computing, writing efficient parallel programs is indispensable and at the same time, writing sound parallel programs is very difficult.

Programming Languages Logic in Computer Science Software Engineering D.2; D.3

Phase Transition Behavior of Cardinality and XOR Constraints

1 code implementation22 Oct 2019 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.

Reflections on "Incremental Cardinality Constraints for MaxSAT"

no code implementations10 Oct 2019 Ruben Martins, Saurabh Joshi, Vasco Manquinho, Ines Lynce

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 each year to write a commentary on their paper.

Approximation Strategies for Incomplete MaxSAT

1 code implementation19 Jun 2018 Saurabh Joshi, Prateek Kumar, Ruben Martins, Sukrut Rao

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 guarantees.

Generalized Totalizer Encoding for Pseudo-Boolean Constraints

no code implementations21 Jul 2015 Saurabh Joshi, Ruben Martins, Vasco Manquinho

We show the superiority of GTE with respect to other encodings when large pseudo-Boolean constraints have low number of distinct coefficients.

Incremental Cardinality Constraints for MaxSAT

no code implementations20 Aug 2014 Ruben Martins, Saurabh Joshi, Vasco Manquinho, Ines Lynce

In general, MaxSAT algorithms perform a succession of SAT solver calls to reach an optimum solution making extensive use of cardinality constraints.

Cannot find the paper you are looking for? You can Submit a new open access paper.