A scalable approximate model counter S Chakraborty, KS Meel, MY Vardi Principles and Practice of Constraint Programming: 19th International …, 2013 | 196 | 2013 |
Distribution-aware sampling and weighted model counting for SAT S Chakraborty, D Fremont, K Meel, S Seshia, M Vardi Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014 | 185 | 2014 |
Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls. S Chakraborty, KS Meel, MY Vardi IJCAI, 3569-3576, 2016 | 158 | 2016 |
A scalable and nearly uniform generator of SAT witnesses S Chakraborty, KS Meel, MY Vardi International Conference on Computer Aided Verification, 608-623, 2013 | 128 | 2013 |
On parallel scalable uniform SAT witness generation S Chakraborty, DJ Fremont, KS Meel, SA Seshia, MY Vardi Tools and Algorithms for the Construction and Analysis of Systems: 21st …, 2015 | 127 | 2015 |
Automatically refining abstract interpretations BS Gulavani, S Chakraborty, AV Nori, SK Rajamani International Conference on Tools and Algorithms for the Construction and …, 2008 | 127 | 2008 |
Balancing scalability and uniformity in SAT witness generator S Chakraborty, KS Meel, MY Vardi Proceedings of the 51st Annual Design Automation Conference, 1-6, 2014 | 92 | 2014 |
Constrained sampling and counting: Universal hashing meets SAT solving KS Meel, MY Vardi, S Chakraborty, DJ Fremont, SA Seshia, D Fried, A Ivrii, ... Workshops at the thirtieth AAAI conference on artificial intelligence, 2016 | 77 | 2016 |
Approximate probabilistic inference via word-level counting S Chakraborty, K Meel, R Mistry, M Vardi Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016 | 70 | 2016 |
From Weighted to Unweighted Model Counting. S Chakraborty, D Fried, KS Meel, MY Vardi IJCAI, 689-695, 2015 | 70 | 2015 |
Bottom-up shape analysis using LISF BS Gulavani, S Chakraborty, G Ramalingam, AV Nori ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (5), 1-41, 2011 | 59* | 2011 |
Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines S Chakraborty, DR Chowdhury, PP Chaudhuri IEEE Transactions on Computers 45 (7), 769-781, 1996 | 59 | 1996 |
Min-max timing analysis and an application to asynchronous circuits S Chakraborty, DI Dill, KY Yun Proceedings of the IEEE 87 (2), 332-346, 1999 | 47 | 1999 |
Skolem functions for factored formulas AK John, S Shah, S Chakraborty, A Trivedi, S Akshay 2015 Formal Methods in Computer-Aided Design (FMCAD), 73-80, 2015 | 36 | 2015 |
Bounded validity checking of interval duration logic B Sharma, PK Pandya, S Chakraborty Tools and Algorithms for the Construction and Analysis of Systems: 11th …, 2005 | 34 | 2005 |
Evaluation of pausible clocking for interfacing high speed IP cores in GALS framework J Mekie, S Chakraborty, DK Sharma 17th International Conference on VLSI Design. Proceedings., 559-564, 2004 | 33 | 2004 |
What’s hard about Boolean functional synthesis? S Akshay, S Chakraborty, S Goel, S Kulal, S Shah International Conference on Computer Aided Verification, 251-269, 2018 | 31 | 2018 |
Timing analysis of asynchronous systems using time separation of events S Chakraborty, KY Yun, DL Dill IEEE transactions on computer-aided design of integrated circuits and …, 1999 | 30 | 1999 |
Efficient guided symbolic reachability using reachability expressions D Thomas, S Chakraborty, P Pandya International Journal on Software Tools for Technology Transfer 10, 113-129, 2008 | 29 | 2008 |
Timing analysis for extended burst-mode circuits S Chakraborty, DL Dill, KY Yun, KY Chang Proceedings Third International Symposium on Advanced Research in …, 1997 | 29 | 1997 |