#### Filter Results:

- Full text PDF available (53)

#### Publication Year

1993

2018

- This year (3)
- Last 5 years (22)
- Last 10 years (42)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

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â€¦ (More)

Abstract interpretation techniques prove properties of programs by computing abstract fixpoints. All such analyses suffer from the possibility of false errors. We present three techniques toâ€¦ (More)

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â€¦ (More)

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â€¦ (More)

Functional verification constitutes one of the most challenging tasks in the development of modern hardware systems, and simulationbased verification techniques dominate the functional verificationâ€¦ (More)

- Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi
- IJCAI
- 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-ofthe-artâ€¦ (More)

This paper reports an application of a special class of non-group Cellular Automat a, referred to as D1*CA, as the test machine embeded in the FSM to be synthesised. The state transition propertiesâ€¦ (More)

- Supratik Chakraborty, Kenneth Y. Yun, David L. Dill
- IEEE Trans. on CAD of Integrated Circuits andâ€¦
- 1999

This paper describes a pseudo-polynomial time algorithm for timing analysis of a class of choice-free asynchronous systems, called tightly-coupled systems, with both min and max type timingâ€¦ (More)

Modern high-performance asynchronous circuits depend on t iming constraints for correct operation, so timing analyzers are ess ential asynchronous design tools. In this paper, we present a 13-valuedâ€¦ (More)

- Ajith K. John, Shetal Shah, Supratik Chakraborty, Ashutosh Trivedi, S. Akshay
- 2015 Formal Methods in Computer-Aided Designâ€¦
- 2015

Given a propositional formula F(x, y), a Skolem function for x is a function Ïˆ (y), such that substituting Ïˆ (y) for x in F gives a formula semantically equivalent to âˆƒx F. Automatically generatingâ€¦ (More)