[go: up one dir, main page]

Follow
Supratik Chakraborty
Supratik Chakraborty
Dept. of Computer Science and Engineering, IIT Bombay
Verified email at iitb.ac.in - Homepage
Title
Cited by
Cited by
Year
A scalable approximate model counter
S Chakraborty, KS Meel, MY Vardi
International Conference on Principles and Practice of Constraint …, 2013
2312013
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
2092014
Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls.
S Chakraborty, KS Meel, MY Vardi
IJCAI 16, 3569-3576, 2016
1942016
On parallel scalable uniform SAT witness generation
S Chakraborty, DJ Fremont, KS Meel, SA Seshia, MY Vardi
International Conference on Tools and Algorithms for the Construction and …, 2015
1512015
A scalable and nearly uniform generator of SAT witnesses
S Chakraborty, KS Meel, MY Vardi
International Conference on Computer Aided Verification, 608-623, 2013
1422013
Automatically refining abstract interpretations
BS Gulavani, S Chakraborty, AV Nori, SK Rajamani
International Conference on Tools and Algorithms for the Construction and …, 2008
1312008
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
1042014
From Weighted to Unweighted Model Counting.
S Chakraborty, D Fried, KS Meel, MY Vardi
IJCAI, 689-695, 2015
852015
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving.
KS Meel, MY Vardi, S Chakraborty, DJ Fremont, SA Seshia, D Fried, A Ivrii, ...
AAAI Workshop: Beyond NP, 2016
842016
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
812016
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
62*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
611996
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
451999
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
432015
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
412018
Bounded validity checking of interval duration logic
B Sharma, PK Pandya, S Chakraborty
International Conference on Tools and Algorithms for the Construction and …, 2005
332005
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
332004
Knowledge compilation for Boolean functional synthesis
S Akshay, J Arora, S Chakraborty, S Krishna, D Raghunathan, S Shah
2019 Formal Methods in Computer Aided Design (FMCAD), 161-169, 2019
322019
Towards parallel Boolean functional synthesis
S Akshay, S Chakraborty, AK John, S Shah
International Conference on Tools and Algorithms for the Construction and …, 2017
322017
Approximate model counting
S Chakraborty, KS Meel, MY Vardi
Handbook of Satisfiability, 1015-1045, 2021
312021
The system can't perform the operation now. Try again later.
Articles 1–20