# Supratik Chakraborty

I.I.T. Bombay

Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Top 100 relevant results, sorted by most influential

Distribution-Aware Sampling and Weighted Model Counting for SAT

- Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, S. Seshia, M. Vardi
- Computer Science
- AAAI
- 10 April 2014

Given a CNF formula and a weight for each assignment of values to variables, two natural problems are weighted model counting and distribution-aware sampling of satisfying assignments. Both problems… Expand

A Scalable Approximate Model Counter

- Supratik Chakraborty, Kuldeep S. Meel, M. Vardi
- Computer Science, Mathematics
- CP
- 24 June 2013

Propositional model counting (#SAT), i.e., counting the number of satisfying assignments of a propositional formula, is a problem of significant theoretical and practical interest. Due to the… Expand

Approximate Probabilistic Inference via Word-Level Counting

- Supratik Chakraborty, Kuldeep S. Meel, R. Mistry, M. Vardi
- Computer Science
- AAAI
- 24 November 2015

Hashing-based model counting has emerged as a promising approach for large-scale probabilistic inference on graphical models. A key component of these techniques is the use of xor-based 2-universal… Expand

On Parallel Scalable Uniform SAT Witness Generation

- Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, S. Seshia, M. Vardi
- Computer Science
- TACAS
- 11 April 2015

Constrained-random verification CRV is widely used in industry for validating hardware designs. The effectiveness of CRV depends on the uniformity of test stimuli generated from a given set of… Expand

A Scalable and Nearly Uniform Generator of SAT Witnesses

- Supratik Chakraborty, Kuldeep S. Meel, M. Vardi
- Computer Science, Mathematics
- CAV
- 4 April 2013

Functional verification constitutes one of the most challenging tasks in the development of modern hardware systems, and simulation-based verification techniques dominate the functional verification… Expand

Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls

- Supratik Chakraborty, Kuldeep S. Meel, M. Vardi
- Computer Science
- IJCAI
- 9 July 2016

Probabilistic inference via model counting has emerged as a scalable technique with strong formal guarantees, thanks to recent advances in hashing-based approximate counting. State-of-the-art… Expand

Termination Of Linear Programs

Many real-time applications have linear programs, which can get a variety of inputs in different situations. It is possible that some of these are “bad” inputs which cause unexpected failures like… Expand

- 58
- 6

Balancing scalability and uniformity in SAT witness generator

- Supratik Chakraborty, Kuldeep S. Meel, M. Vardi
- Computer Science
- 51st ACM/EDAC/IEEE Design Automation Conference…
- 25 March 2014

Constrained-random simulation is the predominant approach used in the industry for functional verification of complex digital designs. The effectiveness of this approach depends on two key factors:… Expand

Timing analysis of asynchronous systems using time separation of events

- Supratik Chakraborty, K. Y. Yun, D. Dill
- Computer Science
- IEEE Trans. Comput. Aided Des. Integr. Circuits…
- 1 August 1999

We present a unified technique for timing verification and performance analysis of complex asynchronous systems designed with implicit timing assumptions. Our method models interacting controllers… Expand

Theory and Application of Nongroup Cellular Automata for Synthesis of Easily Testable Finite State Machines

- Supratik Chakraborty, D. R. Chowdhury, P. Chaudhuri
- Computer Science
- IEEE Trans. Computers
- 1 July 1996

The paper reports some of the interesting properties and relationships of a nongroup cellular automata (CA) and its dual. A special class of nongroup cellular automata denoted as D1*CA is… Expand