default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSupratik Chakraborty
Person information
- affiliation: IIT Bombay, Mumbai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j17]S. Akshay, Supratik Chakraborty, Shetal Shah:
Tractable representations for Boolean functional synthesis. Ann. Math. Artif. Intell. 92(5): 1051-1096 (2024)- [c71]Mohimenul Kabir, Supratik Chakraborty, Kuldeep S. Meel:
Exact ASP Counting with Compact Encodings. AAAI 2024: 10571-10580 - [c70]Kuldeep S. Meel, Supratik Chakraborty, S. Akshay:
Auditable Algorithms for Approximate Model Counting. AAAI 2024: 10654-10661 - [c69]S. Akshay, Supratik Chakraborty, Amir Kafshdar Goharshady, R. Govind, Harshit J. Motwani, Sai Teja Varanasi:
Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic. FM (1) 2024: 111-130 - [c68]S. Akshay, Supratik Chakraborty, Amir Kafshdar Goharshady, R. Govind, Harshit J. Motwani, Sai Teja Varanasi:
Automated Synthesis of Decision Lists for Polynomial Specifications over Integers. LPAR 2024: 484-502 - [c67]S. Akshay, Eliyahu Basa, Supratik Chakraborty, Dror Fried:
On Dependent Variables in Reactive Synthesis. TACAS (1) 2024: 123-143 - [c66]Sumanth Prabhu, Deepak D'Souza, Supratik Chakraborty, R. Venkatesh, Grigory Fedyukovich:
Weakest Precondition Inference for Non-Deterministic Linear Array Programs. TACAS (2) 2024: 175-195 - [c65]Ravindra Metta
, Hrishikesh Karmarkar, Kumar Madhukar, R. Venkatesh, Supratik Chakraborty:
PROTON: PRObes for Termination Or Not (Competition Contribution). TACAS (3) 2024: 393-398 - [e4]Supratik Chakraborty, Jie-Hong Roland Jiang:
27th International Conference on Theory and Applications of Satisfiability Testing, SAT 2024, August 21-24, 2024, Pune, India. LIPIcs 305, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-334-8 [contents] - [i36]S. Akshay, Eliyahu Basa, Supratik Chakraborty, Dror Fried:
On Dependent Variables in Reactive Synthesis. CoRR abs/2401.11290 (2024) - [i35]Pirzada Suhail, Supratik Chakraborty, Amit Sethi:
Network Inversion of Binarised Neural Nets. CoRR abs/2402.11995 (2024) - [i34]Ravindra Metta, Hrishikesh Karmarkar, Kumar Madhukar, R. Venkatesh, Supratik Chakraborty, Samarjit Chakraborty:
A shallow dive into the depths of non-termination checking for C programs. CoRR abs/2409.12985 (2024) - 2023
- [c64]S. Akshay, Supratik Chakraborty, Sahil Jain:
Counterexample Guided Knowledge Compilation for Boolean Functional Synthesis. CAV (1) 2023: 367-389 - [c63]Supratik Chakraborty:
Boolean Functional Synthesis: From Under the Hood of Solvers. ICLA 2023: 11-22 - [c62]Hazem Torfah, Aniruddha R. Joshi, Shetal Shah, S. Akshay, Supratik Chakraborty, Sanjit A. Seshia:
Learning Monitor Ensembles for Operational Design Domains. RV 2023: 271-290 - [c61]Priyanka Darke, Bharti Chimdyalwar, Sakshi Agrawal, Shrawan Kumar, R. Venkatesh, Supratik Chakraborty:
VeriAbsL: Scalable Verification by Abstraction and Strategy Prediction (Competition Contribution). TACAS (2) 2023: 588-593 - [i33]Mohimenul Kabir, Supratik Chakraborty, Kuldeep S. Meel:
Exact ASP Counting with Compact Encodings. CoRR abs/2312.11936 (2023) - [i32]Kuldeep S. Meel, Supratik Chakraborty, S. Akshay:
Auditable Algorithms for Approximate Model Counting. CoRR abs/2312.12362 (2023) - 2022
- [j16]Supratik Chakraborty, Dror Fried, Lucas M. Tabajara, Moshe Y. Vardi:
Functional synthesis via input-output separation. Formal Methods Syst. Des. 60(2): 228-258 (2022) - [j15]Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat:
Full-program induction: verifying array programs sans loop invariants. Int. J. Softw. Tools Technol. Transf. 24(5): 843-888 (2022) - [c60]Jiong Yang, Supratik Chakraborty, Kuldeep S. Meel:
Projected Model Counting: Beyond Independent Support. ATVA 2022: 171-187 - [c59]S. Akshay, Supratik Chakraborty, Debtanu Pal:
On Eventual Non-negativity and Positivity for the Weighted Sum of Powers of Matrices. IJCAR 2022: 671-690 - [c58]Supratik Chakraborty, S. Akshay:
On Synthesizing Computable Skolem Functions for First Order Logic. MFCS 2022: 30:1-30:15 - [i31]S. Akshay, Supratik Chakraborty, Debtanu Pal:
On eventual non-negativity and positivity for the weighted sum of powers of matrices. CoRR abs/2205.09190 (2022) - [i30]Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat:
Full-Program Induction: Verifying Array Programs sans Loop Invariants. CoRR abs/2209.12456 (2022) - 2021
- [j14]S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah:
Boolean functional synthesis: hardness and practical algorithms. Formal Methods Syst. Des. 57(1): 53-86 (2021) - [c57]Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat:
Diffy: Inductive Reasoning of Array Programs Using Difference Invariants. CAV (2) 2021: 911-935 - [c56]Hazem Torfah, Shetal Shah, Supratik Chakraborty, S. Akshay, Sanjit A. Seshia:
Synthesizing Pareto-Optimal Interpretations for Black-Box Models. FMCAD 2021: 153-162 - [c55]Preey Shah, Aman Bansal, S. Akshay, Supratik Chakraborty:
A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis. LICS 2021: 1-13 - [p2]Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi:
Approximate Model Counting. Handbook of Satisfiability 2021: 1015-1045 - [i29]S. Akshay, Supratik Chakraborty:
On synthesizing Skolem functions for first order logic formulae. CoRR abs/2102.07463 (2021) - [i28]Preey Shah, Aman Bansal, S. Akshay, Supratik Chakraborty:
A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis. CoRR abs/2104.14098 (2021) - [i27]Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat:
Diffy: Inductive Reasoning of Array Programs using Difference Invariants. CoRR abs/2105.14748 (2021) - [i26]Hazem Torfah, Shetal Shah, Supratik Chakraborty, S. Akshay, Sanjit A. Seshia:
Synthesizing Pareto-Optimal Interpretations for Black-Box Models. CoRR abs/2108.07307 (2021) - [i25]Jiong Yang, Supratik Chakraborty, Kuldeep S. Meel:
Projected Model Counting: Beyond Independent Support. CoRR abs/2110.09171 (2021) - 2020
- [j13]Swati Jaiswal, Uday P. Khedker, Supratik Chakraborty:
Bidirectionality in flow-sensitive demand-driven analysis. Sci. Comput. Program. 190: 102391 (2020) - [c54]Supratik Chakraborty, Aditya A. Shrotri, Moshe Y. Vardi:
On Uniformly Sampling Traces of a Transition System. ICCAD 2020: 108:1-108:9 - [c53]Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat:
Verifying Array Manipulating Programs with Full-Program Induction. TACAS (1) 2020: 22-39 - [c52]Mohammad Afzal, Supratik Chakraborty, Avriti Chauhan, Bharti Chimdyalwar, Priyanka Darke, Ashutosh Gupta, Shrawan Kumar, Charles Babu M, Divyesh Unadkat, R. Venkatesh:
VeriAbs : Verification by Abstraction and Test Generation (Competition Contribution). TACAS (2) 2020: 383-387 - [e3]Supratik Chakraborty, Jorge A. Navas:
Verified Software. Theories, Tools, and Experiments - 11th International Conference, VSTTE 2019, New York City, NY, USA, July 13-14, 2019, Revised Selected Papers. Lecture Notes in Computer Science 12031, Springer 2020, ISBN 978-3-030-41599-0 [contents] - [i24]Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat:
Verifying Array Manipulating Programs with Full-Program Induction. CoRR abs/2002.09857 (2020) - [i23]Supratik Chakraborty, Aditya A. Shrotri, Moshe Y. Vardi:
On Uniformly Sampling Traces of a Transition System (Extended Version). CoRR abs/2008.05102 (2020)
2010 – 2019
- 2019
- [j12]Supratik Chakraborty, Vasudeva Varma:
Highlights of software R&D in India. Commun. ACM 62(11): 88-91 (2019) - [c51]Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi:
On the Hardness of Probabilistic Inference Relaxations. AAAI 2019: 7785-7792 - [c50]Supratik Chakraborty, Aditya A. Shrotri, Moshe Y. Vardi:
On Symbolic Approaches for Computing the Matrix Permanent. CP 2019: 71-90 - [c49]S. Akshay, Sukanya Basu, Supratik Chakraborty, Rangapriya Sundararajan, Prasanna Venkatraman:
Functional Significance Checking in Noisy Gene Regulatory Networks. CP 2019: 767-785 - [c48]S. Akshay, Jatin Arora, Supratik Chakraborty, Shankara Narayanan Krishna, Divya Raghunathan, Shetal Shah:
Knowledge Compilation for Boolean Functional Synthesis. FMCAD 2019: 161-169 - [i22]Supratik Chakraborty, Aditya A. Shrotri, Moshe Y. Vardi:
On Symbolic Approaches for Computing the Matrix Permanent. CoRR abs/1908.03252 (2019) - [i21]S. Akshay, Jatin Arora, Supratik Chakraborty, Shankara Narayanan Krishna, Divya Raghunathan, Shetal Shah:
Knowledge Compilation for Boolean Functional Synthesis. CoRR abs/1908.06275 (2019) - 2018
- [c47]S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah:
What's Hard About Boolean Functional Synthesis? CAV (1) 2018: 251-269 - [c46]Supratik Chakraborty, Dror Fried, Lucas M. Tabajara, Moshe Y. Vardi:
Functional Synthesis via Input-Output Separation. FMCAD 2018: 1-9 - [i20]Swati Jaiswal, Uday P. Khedker, Supratik Chakraborty:
Demand-driven Alias Analysis : Formalizing Bidirectional Analyses for Soundness and Precision. CoRR abs/1802.00932 (2018) - [i19]S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah:
What's hard about Boolean Functional Synthesis. CoRR abs/1804.05507 (2018) - [i18]Supratik Chakraborty, Dror Fried, Lucas M. Tabajara, Moshe Y. Vardi:
Functional Synthesis via Input-Output Separation. CoRR abs/1808.08190 (2018) - 2017
- [j11]Supratik Chakraborty, Zurab Khasidashvili, Carl-Johan H. Seger, Rajkumar Gajavelly, Tanmay Haldankar, Dinesh Chhatani, Rakesh Mistry:
Symbolic trajectory evaluation for word-level verification: theory and implementation. Formal Methods Syst. Des. 50(2-3): 317-352 (2017) - [c45]S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep:
On Petri Nets with Hierarchical Special Arcs. CONCUR 2017: 40:1-40:17 - [c44]Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat:
Verifying Array Manipulating Programs by Tiling. SAS 2017: 428-449 - [c43]S. Akshay, Supratik Chakraborty, Ajith K. John, Shetal Shah:
Towards Parallel Boolean Functional Synthesis. TACAS (1) 2017: 337-353 - [c42]Supratik Chakraborty, Ashutosh Gupta, Rahul Jain:
Matching Multiplications in Bit-Vector Formulas. VMCAI 2017: 131-150 - [i17]S. Akshay, Supratik Chakraborty, Ajith K. John, Shetal Shah:
Towards Parallel Boolean Functional Synthesis. CoRR abs/1703.01440 (2017) - [i16]S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep:
On Petri Nets with Hierarchical Special Arcs. CoRR abs/1707.01157 (2017) - [i15]Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat:
Verifying Array Manipulating Programs by Tiling. CoRR abs/1707.03555 (2017) - 2016
- [j10]Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty:
A generalization of the Łoś-Tarski preservation theorem. Ann. Pure Appl. Log. 167(3): 189-210 (2016) - [j9]Ajith K. John, Supratik Chakraborty:
A layered algorithm for quantifier elimination from linear modular constraints. Formal Methods Syst. Des. 49(3): 272-323 (2016) - [c41]Supratik Chakraborty, Kuldeep S. Meel, Rakesh Mistry, Moshe Y. Vardi:
Approximate Probabilistic Inference via Word-Level Counting. AAAI 2016: 3218-3224 - [c40]Kuldeep S. Meel, Moshe Y. Vardi, Supratik Chakraborty, Daniel J. Fremont, Sanjit A. Seshia, Dror Fried, Alexander Ivrii, Sharad Malik:
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving. AAAI Workshop: Beyond NP 2016 - [c39]Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi:
Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls. IJCAI 2016: 3569-3576 - [i14]Supratik Chakraborty, Ashutosh Gupta, Rahul Jain:
Matching Multiplications in Bit-Vector Formulas. CoRR abs/1611.10146 (2016) - 2015
- [c38]Supratik Chakraborty, Zurab Khasidashvili, Carl-Johan H. Seger, Rajkumar Gajavelly, Tanmay Haldankar, Dinesh Chhatani, Rakesh Mistry:
Word-Level Symbolic Trajectory Evaluation. CAV (2) 2015: 128-143 - [c37]Ajith K. John, Shetal Shah, Supratik Chakraborty, Ashutosh Trivedi, S. Akshay:
Skolem Functions for Factored Formulas. FMCAD 2015: 73-80 - [c36]Supratik Chakraborty, Dror Fried, Kuldeep S. Meel, Moshe Y. Vardi:
From Weighted to Unweighted Model Counting. IJCAI 2015: 689-695 - [c35]Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, Sanjit A. Seshia, Moshe Y. Vardi:
On Parallel Scalable Uniform SAT Witness Generation. TACAS 2015: 304-319 - [i13]Supratik Chakraborty, Zurab Khasidashvili, Carl-Johan H. Seger, Rajkumar Gajavelly, Tanmay Haldankar, Dinesh Chhatani, Rakesh Mistry:
Word-level Symbolic Trajectory Evaluation. CoRR abs/1505.07916 (2015) - [i12]Ajith K. John, Shetal Shah, Supratik Chakraborty, Ashutosh Trivedi, S. Akshay:
Skolem Functions for Factored Formulas. CoRR abs/1508.05497 (2015) - [i11]Supratik Chakraborty, Kuldeep S. Meel, Rakesh Mistry, Moshe Y. Vardi:
Approximate Probabilistic Inference via Word-Level Counting. CoRR abs/1511.07663 (2015) - [i10]Kuldeep S. Meel, Moshe Y. Vardi, Supratik Chakraborty, Daniel J. Fremont, Sanjit A. Seshia, Dror Fried, Alexander Ivrii, Sharad Malik:
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving. CoRR abs/1512.06633 (2015) - 2014
- [c34]Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, Sanjit A. Seshia, Moshe Y. Vardi:
Distribution-Aware Sampling and Weighted Model Counting for SAT. AAAI 2014: 1722-1730 - [c33]Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi:
Balancing Scalability and Uniformity in SAT Witness Generator. DAC 2014: 60:1-60:6 - [c32]Ajith K. John, Supratik Chakraborty:
Quantifier Elimination for Linear Modular Constraints. ICMS 2014: 295-302 - [c31]Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty:
A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures. MFCS (1) 2014: 474-485 - [i9]Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty:
A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures. CoRR abs/1401.5953 (2014) - [i8]Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi:
Balancing Scalability and Uniformity in SAT Witness Generator. CoRR abs/1403.6246 (2014) - [i7]Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, Sanjit A. Seshia, Moshe Y. Vardi:
Distribution-Aware Sampling and Weighted Model Counting for SAT. CoRR abs/1404.2984 (2014) - 2013
- [c30]Hrishikesh Karmarkar, Manas Joglekar, Supratik Chakraborty:
Improved Upper and Lower Bounds for Büchi Disambiguation. ATVA 2013: 40-54 - [c29]Seetha Jayasankar, Supratik Chakraborty:
Improving approximate reachability by dynamic interleavings of projections-based algorithms. CACSD 2013: 25-30 - [c28]Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi:
A Scalable and Nearly Uniform Generator of SAT Witnesses. CAV 2013: 608-623 - [c27]Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi:
A Scalable Approximate Model Counter. CP 2013: 200-216 - [c26]Ajith K. John, Supratik Chakraborty:
Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors. TACAS 2013: 78-92 - [i6]Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty:
Generalizations of the Los-Tarski Preservation Theorem. CoRR abs/1302.4350 (2013) - [i5]Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi:
A Scalable and Nearly Uniform Generator of SAT Witnesses. CoRR abs/1304.1584 (2013) - [i4]Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi:
A Scalable Approximate Model Counter. CoRR abs/1306.5726 (2013) - 2012
- [c25]Abhisekh Sankaran, Bharat Adsul, Vivek Madan, Pritish Kamath, Supratik Chakraborty:
Preservation under Substructures modulo Bounded Cores. WoLLIC 2012: 291-305 - [p1]Supratik Chakraborty:
Reasoning about Heap Manipulating Programs using Automata Techniques. Modern Applications of Automata Theory 2012: 193-228 - [e2]Supratik Chakraborty, Madhavan Mukund:
Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings. Lecture Notes in Computer Science 7561, Springer 2012, ISBN 978-3-642-33385-9 [contents] - [i3]Abhisekh Sankaran, Bharat Adsul, Vivek Madan, Pritish Kamath, Supratik Chakraborty:
Preservation under Substructures modulo Bounded Cores. CoRR abs/1205.1358 (2012) - 2011
- [j8]Bhargav S. Gulavani, Supratik Chakraborty, G. Ramalingam, Aditya V. Nori:
Bottom-up shape analysis using LISF. ACM Trans. Program. Lang. Syst. 33(5): 17:1-17:41 (2011) - [c24]Ajith K. John, Supratik Chakraborty:
A Quantifier Elimination Algorithm for Linear Modular Equations and Disequations. CAV 2011: 486-503 - [c23]Supratik Chakraborty, Amit Kumar:
Frontmatter, Table of Contents, Preface, Conference Organization, External Reviewers. FSTTCS 2011 - [e1]Supratik Chakraborty, Amit Kumar:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India. LIPIcs 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2011, ISBN 978-3-939897-34-7 [contents] - [i2]Hrishikesh Karmarkar, Supratik Chakraborty:
Determinization of $\omega$-automata unified. CoRR abs/1101.1841 (2011) - 2010
- [j7]Bhargav S. Gulavani, Supratik Chakraborty, Aditya V. Nori, Sriram K. Rajamani:
Refining abstract interpretations. Inf. Process. Lett. 110(16): 666-671 (2010) - [c22]Jeff Edmonds, Supratik Chakraborty:
Bounding Variance and Expectation of Longest Path Lengths in DAGs. SODA 2010: 766-781 - [i1]Abhisekh Sankaran, Supratik Chakraborty:
On Semantic Generalizations of the Bernays-Schönfinkel-Ramsey Class with Finite or Co-finite Spectra. CoRR abs/1002.4334 (2010)
2000 – 2009
- 2009
- [c21]Hrishikesh Karmarkar, Supratik Chakraborty:
On Minimal Odd Rankings for Büchi Complementation. ATVA 2009: 228-243 - [c20]Bhargav S. Gulavani, Supratik Chakraborty, Ganesan Ramalingam, Aditya V. Nori:
Bottom-Up Shape Analysis. SAS 2009: 188-204 - 2008
- [j6]Dina Thomas, Supratik Chakraborty, Paritosh K. Pandya:
Efficient guided symbolic reachability using reachability expressions. Int. J. Softw. Tools Technol. Transf. 10(2): 113-129 (2008) - [c19]Bhargav S. Gulavani, Supratik Chakraborty, Aditya V. Nori, Sriram K. Rajamani:
Automatically Refining Abstract Interpretations. TACAS 2008: 443-458 - 2007
- [c18]Sasidhar Sunkari, Supratik Chakraborty, Vivekananda M. Vedula, Kailasnath Maneparambil:
A Scalable Symbolic Simulator for Verilog RTL. MTV 2007: 51-59 - 2006
- [j5]Supratik Chakraborty, Joycee Mekie, Dinesh K. Sharma:
Reasoning about synchronization in GALS systems. Formal Methods Syst. Des. 28(2): 153-169 (2006) - [c17]Joycee Mekie, Supratik Chakraborty, Dinesh K. Sharma, Girish Venkataramani, P. S. Thiagarajan:
Interface Design for Rationally Clocked GALS Systems. ASYNC 2006: 160-171 - [c16]Dina Thomas, Supratik Chakraborty, Paritosh K. Pandya:
Efficient Guided Symbolic Reachability Using Reachability Expressions. TACAS 2006: 120-134 - 2005
- [c15]Babita Sharma, Paritosh K. Pandya, Supratik Chakraborty:
Bounded Validity Checking of Interval Duration Logic. TACAS 2005: 301-316 - 2004
- [c14]Joycee Mekie, Supratik Chakraborty, Dinesh K. Sharma:
Evaluation of pausible clocking for interfacing high speed IP cores in GALS Framework. VLSI Design 2004: 559-564 - [c13]Gautam Hazari, Madhav P. Desai, Apoorv Gupta, Supratik Chakraborty:
A Novel Technique Towards Eliminating the Global Clock in VLSI Circuits. VLSI Design 2004: 565-570 - 2002
- [c12]Rohan Angrish, Supratik Chakraborty:
Probabilistic Timing Analysis of Asynchronous Systems with Moments of Delay. ASYNC 2002: 99-108 - [c11]Subir K. Roy, S. Ramesh, Supratik Chakraborty, Tsuneo Nakata, Sreeranga P. Rajan:
Functional Verification of System on Chips-Practices, Issues and Challenges (Tutorial Abstract). ASP-DAC/VLSI Design 2002: 11-13 - [c10]Supratik Chakraborty, Rajeev Murgai:
Layout-Driven Timing Optimization by Generalized De Morgan Transform. ASP-DAC/VLSI Design 2002: 647-654 - 2001
- [c9]Supratik Chakraborty, Rajeev Murgai:
Complexity Of Minimum-Delay Gate Resizing. VLSI Design 2001: 425-430 - 2000
- [j4]Kenneth Y. Yun, Kevin W. James, Robert H. Fairlie-Cuninghame, Supratik Chakraborty, Rene L. Cruz:
A self-timed real-time sorting network. IEEE Trans. Very Large Scale Integr. Syst. 8(3): 356-363 (2000)
1990 – 1999
- 1999
- [j3]Supratik Chakraborty, David I. Dill, Kenneth Y. Yun:
Min-max timing analysis and an application to asynchronous circuits. Proc. IEEE 87(2): 332-346 (1999) - [j2]Supratik Chakraborty, Kenneth Y. Yun, David L. Dill:
Timing analysis of asynchronous systems using time separation of events. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(8): 1061-1076 (1999) - 1998
- [c8]Supratik Chakraborty, Kenneth Y. Yun, David L. Dill:
Practical timing analysis of asynchronous circuits using time separation of events. CICC 1998: 455-458 - [c7]Kenneth Y. Yun, Supratik Chakraborty, Kevin W. James, Robert H. Fairlie-Cuninghame, Rene L. Cruz:
A self-timed real-time sorting network. ICCD 1998: 427-434 - 1997
- [c6]Supratik Chakraborty, David L. Dill, Kun-Yung Chang, Kenneth Y. Yun:
Timing Analysis of Extended Burst-Mode Circuits. ASYNC 1997: 101-111 - [c5]Supratik Chakraborty, David L. Dill:
More Accurate Polynomial-Time Min-Max Timing Simulation. ASYNC 1997: 112- - [c4]Supratik Chakraborty, David L. Dill:
Approximate algorithms for time separation of events. ICCAD 1997: 190-194 - 1996
- [j1]Supratik Chakraborty, Dipanwita Roy Chowdhury, Parimal Pal Chaudhuri:
Theory and Application of Nongroup Cellular Automata for Synthesis of Easily Testable Finite State Machines. IEEE Trans. Computers 45(7): 769-781 (1996) - 1993
- [c3]Dipanwita Roy Chowdhury, Supratik Chakraborty, B. Vamsi, B. Pal Chaudhuri:
Cellular automata based synthesis of easily and fully testable FSMs. ICCAD 1993: 650-653 - [c2]Dipanwita Roy Chowdhury, Supratik Chakraborty, Parimal Pal Chaudhuri:
Synthesis of Self-Checking Sequential Machines Using Cellular Automata. VLSI Design 1993: 107 - [c1]Sukumar Nandi, Vamsi Boppana, Supratik Chakraborty, Parimal Pal Chaudhuri, Samir Roy:
Delay Fault Test Generation with Cellular Automata. VLSI Design 1993: 281-286
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
