• Publications
  • Influence
Distribution-Aware Sampling and Weighted Model Counting for SAT
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 problemsExpand
  • 101
  • 11
A Scalable Approximate Model Counter
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 theExpand
  • 96
  • 11
Approximate Probabilistic Inference via Word-Level Counting
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-universalExpand
  • 33
  • 10
On Parallel Scalable Uniform SAT Witness Generation
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 ofExpand
  • 49
  • 9
A Scalable and Nearly Uniform Generator of SAT Witnesses
Functional verification constitutes one of the most challenging tasks in the development of modern hardware systems, and simulation-based verification techniques dominate the functional verificationExpand
  • 50
  • 8
Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls
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-artExpand
  • 64
  • 6
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 likeExpand
  • 58
  • 6
Balancing scalability and uniformity in SAT witness generator
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
  • 42
  • 6
Timing analysis of asynchronous systems using time separation of events
We present a unified technique for timing verification and performance analysis of complex asynchronous systems designed with implicit timing assumptions. Our method models interacting controllersExpand
  • 35
  • 5
Theory and Application of Nongroup Cellular Automata for Synthesis of Easily Testable Finite State Machines
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 isExpand
  • 33
  • 4