From the 1 of 10 linked papers with an AI index.
6 citations · 7 across the 2 of their papers we have counts for
10 papers
Estimating Size of the Union of Sets in Streaming Model
Kuldeep S. Meel, N. V. Vinodchandran, Sourav Chakraborty
The paper presents a simple sampling-based streaming algorithm that approximates the size of the union of implicitly given sets, achieving provable space and update‑time bounds and…
CSB: A Counting and Sampling tool for Bit-vectors
Arijit Shaw, Kuldeep S. Meel
Satisfiability modulo theory (SMT) solvers have significantly advanced automated reasoning due to their effectiveness in solving problems across various fields. With the advancemen…
Approximate SMT Counting Beyond Discrete Domains
Arijit Shaw, Kuldeep S. Meel
Satisfiability Modulo Theory (SMT) solvers have advanced automated reasoning, solving complex formulas across discrete and continuous domains. Recent progress in propositional mode…
Counting and Sampling Traces in Regular Languages
Alexis de Colnet, Kuldeep S. Meel, Umang Mathur
In this work, we study the problems of counting and sampling Mazurkiewicz traces that a regular language touches. Fix an alphabet and an independence relation $\mathbb{I} \sub…
Efficient Volume Computation for SMT Formulas
Arijit Shaw, Uddalok Sarkar, Kuldeep S. Meel
Satisfiability Modulo Theory (SMT) has recently emerged as a powerful tool for solving various automated reasoning problems across diverse domains. Unlike traditional satisfiabilit…
Solution-aware vs global ReLU selection: partial MILP strikes back for DNN verification
Yuke Liao, Blaise Genest, Kuldeep Meel +1
To handle complex instances, we revisit a divide-and-conquer approach to break down the complexity: instead of few complex BaB calls, we rely on many small {\em partial} MILP calls…