Cellular automata based synthesis of easily and fully testable FSMs. - Dipanwita Roy Chowdhury; Supratik Chakraborty; B. Vamsi; B. Pal Chaudhuri (ICCAD, 1993)

Synthesis of Self-Checking Sequential Machines Using Cellular Automata. - Dipanwita Roy Chowdhury; Supratik Chakraborty; Parimal Pal Chaudhuri (VLSI Design, 1993)

Delay Fault Test Generation with Cellular Automata. - Sukumar Nandi; Vamsi Boppana; Supratik Chakraborty; Parimal Pal Chaudhuri; Samir Roy (VLSI Design, 1993)

Theory and Application of Nongroup Cellular Automata for Synthesis of Easily Testable Finite State Machines. - Supratik Chakraborty; Dipanwita Roy Chowdhury; Parimal Pal Chaudhuri (IEEE Trans. Computers, 1996)

More Accurate Polynomial-Time Min-Max Timing Simulation. - Supratik Chakraborty; David L. Dill (ASYNC, 1997)

Timing Analysis of Extended Burst-Mode Circuits. - Supratik Chakraborty; David L. Dill; Kun-Yung Chang; Kenneth Y. Yun (ASYNC, 1997)

Approximate algorithms for time separation of events. - Supratik Chakraborty; David L. Dill (ICCAD, 1997)

Practical timing analysis of asynchronous circuits using time separation of events. - Supratik Chakraborty; Kenneth Y. Yun; David L. Dill (CICC, 1998)

Min-max timing analysis and an application to asynchronous circuits. - Supratik Chakraborty; David I. Dill; Kenneth Y. Yun (Proc. IEEE, 1999)

Timing analysis of asynchronous systems using time separation of events. - Supratik Chakraborty; Kenneth Y. Yun; David L. Dill (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1999)

A self-timed real-time sorting network. - Kenneth Y. Yun; Kevin W. James; Robert H. Fairlie-Cuninghame; Supratik Chakraborty; Rene L. Cruz (IEEE Trans. Very Large Scale Integr. Syst., 2000)

Complexity Of Minimum-Delay Gate Resizing. - Supratik Chakraborty; Rajeev Murgai (VLSI Design, 2001)

Probabilistic Timing Analysis of Asynchronous Systems with Moments of Delay. - Rohan Angrish; Supratik Chakraborty (ASYNC, 2002)

Layout-Driven Timing Optimization by Generalized De Morgan Transform. - Supratik Chakraborty; Rajeev Murgai (ASP-DAC/VLSI Design, 2002)

Functional Verification of System on Chips-Practices, Issues and Challenges (Tutorial Abstract). - Subir K. Roy; S. Ramesh; Supratik Chakraborty; Tsuneo Nakata; Sreeranga P. Rajan (ASP-DAC/VLSI Design, 2002)

A Novel Technique Towards Eliminating the Global Clock in VLSI Circuits. - Gautam Hazari; Madhav P. Desai; Apoorv Gupta; Supratik Chakraborty (VLSI Design, 2004)

Evaluation of pausible clocking for interfacing high speed IP cores in GALS Framework. - Joycee Mekie; Supratik Chakraborty; Dinesh K. Sharma (VLSI Design, 2004)

Bounded Validity Checking of Interval Duration Logic. - Babita Sharma; Paritosh K. Pandya; Supratik Chakraborty (TACAS, 2005)

Interface Design for Rationally Clocked GALS Systems. - Joycee Mekie; Supratik Chakraborty; Dinesh K. Sharma; Girish Venkataramani; P. S. Thiagarajan (ASYNC, 2006)

Reasoning about synchronization in GALS systems. - Supratik Chakraborty; Joycee Mekie; Dinesh K. Sharma (Formal Methods Syst. Des., 2006)

A Scalable Symbolic Simulator for Verilog RTL. - Sasidhar Sunkari; Supratik Chakraborty; Vivekananda M. Vedula; Kailasnath Maneparambil (MTV, 2007)

Automatically Refining Abstract Interpretations. - Bhargav S. Gulavani; Supratik Chakraborty; Aditya V. Nori; Sriram K. Rajamani (TACAS, 2008)

Efficient guided symbolic reachability using reachability expressions. - Dina Thomas; Supratik Chakraborty; Paritosh K. Pandya (Int. J. Softw. Tools Technol. Transf., 2008)

On Minimal Odd Rankings for Büchi Complementation. - Hrishikesh Karmarkar; Supratik Chakraborty (ATVA, 2009)

Bottom-Up Shape Analysis. - Bhargav S. Gulavani; Supratik Chakraborty; Ganesan Ramalingam; Aditya V. Nori (SAS, 2009)

Bounding Variance and Expectation of Longest Path Lengths in DAGs. - Jeff Edmonds; Supratik Chakraborty (SODA, 2010)

On Semantic Generalizations of the Bernays-Schönfinkel-Ramsey Class with Finite or Co-finite Spectra - Abhisekh Sankaran; Supratik Chakraborty (CoRR, 2010)

Refining abstract interpretations. - Bhargav S. Gulavani; Supratik Chakraborty; Aditya V. Nori; Sriram K. Rajamani (Inf. Process. Lett., 2010)

A Quantifier Elimination Algorithm for Linear Modular Equations and Disequations. - Ajith K. John; Supratik Chakraborty (CAV, 2011)

Frontmatter, Table of Contents, Preface, Conference Organization, External Reviewers. - Supratik Chakraborty; Amit Kumar (FSTTCS, 2011)

Determinization of $ omega$-automata unified - Hrishikesh Karmarkar; Supratik Chakraborty (CoRR, 2011)

Bottom-up shape analysis using LISF. - Bhargav S. Gulavani; Supratik Chakraborty; G. Ramalingam; Aditya V. Nori (ACM Trans. Program. Lang. Syst., 2011)

Reasoning about Heap Manipulating Programs using Automata Techniques. - Supratik Chakraborty (Modern Applications of Automata Theory, 2012)

Preservation under Substructures modulo Bounded Cores. - Abhisekh Sankaran; Bharat Adsul; Vivek Madan; Pritish Kamath; Supratik Chakraborty (WoLLIC, 2012)

Improved Upper and Lower Bounds for Büchi Disambiguation. - Hrishikesh Karmarkar; Manas Joglekar; Supratik Chakraborty (ATVA, 2013)

Improving approximate reachability by dynamic interleavings of projections-based algorithms. - Seetha Jayasankar; Supratik Chakraborty (CACSD, 2013)

A Scalable and Nearly Uniform Generator of SAT Witnesses. - Supratik Chakraborty; Kuldeep S. Meel; Moshe Y. Vardi (CAV, 2013)

A Scalable Approximate Model Counter. - Supratik Chakraborty; Kuldeep S. Meel; Moshe Y. Vardi (CP, 2013)

Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors. - Ajith K. John; Supratik Chakraborty (TACAS, 2013)

Generalizations of the Los-Tarski Preservation Theorem - Abhisekh Sankaran; Bharat Adsul; Supratik Chakraborty (CoRR, 2013)

Distribution-Aware Sampling and Weighted Model Counting for SAT. - Supratik Chakraborty; Daniel J. Fremont; Kuldeep S. Meel; Sanjit A. Seshia; Moshe Y. Vardi (AAAI, 2014)

Balancing Scalability and Uniformity in SAT Witness Generator. - Supratik Chakraborty; Kuldeep S. Meel; Moshe Y. Vardi (DAC, 2014)

Quantifier Elimination for Linear Modular Constraints. - Ajith K. John; Supratik Chakraborty (ICMS, 2014)

A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures. - Abhisekh Sankaran; Bharat Adsul; Supratik Chakraborty (MFCS (1), 2014)

Word-Level Symbolic Trajectory Evaluation. - Supratik Chakraborty; Zurab Khasidashvili; Carl-Johan H. Seger; Rajkumar Gajavelly; Tanmay Haldankar; Dinesh Chhatani; Rakesh Mistry (CAV (2), 2015)

Skolem Functions for Factored Formulas. - Ajith K. John; Shetal Shah; Supratik Chakraborty; Ashutosh Trivedi 001; S. Akshay 001 (FMCAD, 2015)

From Weighted to Unweighted Model Counting. - Supratik Chakraborty; Dror Fried; Kuldeep S. Meel; Moshe Y. Vardi (IJCAI, 2015)

On Parallel Scalable Uniform SAT Witness Generation. - Supratik Chakraborty; Daniel J. Fremont; Kuldeep S. Meel; Sanjit A. Seshia; Moshe Y. Vardi (TACAS, 2015)

Approximate Probabilistic Inference via Word-Level Counting. - Supratik Chakraborty; Kuldeep S. Meel; Rakesh Mistry; Moshe Y. Vardi (AAAI, 2016)

Constrained Sampling and Counting: Universal Hashing Meets SAT Solving. - Kuldeep S. Meel; Moshe Y. Vardi; Supratik Chakraborty; Daniel J. Fremont; Sanjit A. Seshia; Dror Fried; Alexander Ivrii; Sharad Malik (AAAI Workshop: Beyond NP, 2016)

Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls. - Supratik Chakraborty; Kuldeep S. Meel; Moshe Y. Vardi (IJCAI, 2016)

A generalization of the Łoś-Tarski preservation theorem. - Abhisekh Sankaran; Bharat Adsul; Supratik Chakraborty (Ann. Pure Appl. Log., 2016)

A layered algorithm for quantifier elimination from linear modular constraints. - Ajith K. John; Supratik Chakraborty (Formal Methods Syst. Des., 2016)

On Petri Nets with Hierarchical Special Arcs. - S. Akshay 001; Supratik Chakraborty; Ankush Das; Vishal Jagannath; Sai Sandeep (CONCUR, 2017)

Verifying Array Manipulating Programs by Tiling. - Supratik Chakraborty; Ashutosh Gupta 001; Divyesh Unadkat (SAS, 2017)

Towards Parallel Boolean Functional Synthesis. - S. Akshay 001; Supratik Chakraborty; Ajith K. John; Shetal Shah (TACAS (1), 2017)

Matching Multiplications in Bit-Vector Formulas. - Supratik Chakraborty; Ashutosh Gupta 001; Rahul Jain 001 (VMCAI, 2017)

Symbolic trajectory evaluation for word-level verification: theory and implementation. - Supratik Chakraborty; Zurab Khasidashvili; Carl-Johan H. Seger; Rajkumar Gajavelly; Tanmay Haldankar; Dinesh Chhatani; Rakesh Mistry (Formal Methods Syst. Des., 2017)

What's Hard About Boolean Functional Synthesis? - S. Akshay 001; Supratik Chakraborty; Shubham Goel 001; Sumith Kulal; Shetal Shah (CAV (1), 2018)

Demand-driven Alias Analysis : Formalizing Bidirectional Analyses for Soundness and Precision. - Swati Jaiswal; Uday P. Khedker; Supratik Chakraborty (CoRR, 2018)

On the Hardness of Probabilistic Inference Relaxations. - Supratik Chakraborty; Kuldeep S. Meel; Moshe Y. Vardi (AAAI, 2019)

Functional Significance Checking in Noisy Gene Regulatory Networks. - S. Akshay 001; Sukanya Basu; Supratik Chakraborty; Rangapriya Sundararajan; Prasanna Venkatraman (CP, 2019)

On Symbolic Approaches for Computing the Matrix Permanent. - Supratik Chakraborty; Aditya A. Shrotri; Moshe Y. Vardi (CP, 2019)

Knowledge Compilation for Boolean Functional Synthesis. - S. Akshay 001; Jatin Arora 002; Supratik Chakraborty; Shankara Narayanan Krishna; Divya Raghunathan; Shetal Shah (FMCAD, 2019)

Highlights of software R&D in India. - Supratik Chakraborty; Vasudeva Varma (Commun. ACM, 2019)

On Uniformly Sampling Traces of a Transition System. - Supratik Chakraborty; Aditya A. Shrotri; Moshe Y. Vardi (ICCAD, 2020)

VeriAbs : Verification by Abstraction and Test Generation (Competition Contribution). - Mohammad Afzal; Supratik Chakraborty; Avriti Chauhan; Bharti Chimdyalwar; Priyanka Darke; Ashutosh Gupta 001; Shrawan Kumar 001; Charles Babu M; Divyesh Unadkat; R. Venkatesh 001 (TACAS (2), 2020)

Verifying Array Manipulating Programs with Full-Program Induction. - Supratik Chakraborty; Ashutosh Gupta 001; Divyesh Unadkat (TACAS (1), 2020)

On Uniformly Sampling Traces of a Transition System (Extended Version). - Supratik Chakraborty; Aditya A. Shrotri; Moshe Y. Vardi (CoRR, 2020)

Bidirectionality in flow-sensitive demand-driven analysis. - Swati Jaiswal; Uday P. Khedker; Supratik Chakraborty (Sci. Comput. Program., 2020)

Diffy: Inductive Reasoning of Array Programs Using Difference Invariants. - Supratik Chakraborty; Ashutosh Gupta 001; Divyesh Unadkat (CAV (2), 2021)

Synthesizing Pareto-Optimal Interpretations for Black-Box Models. - Hazem Torfah; Shetal Shah; Supratik Chakraborty; S. Akshay 001; Sanjit A. Seshia (FMCAD, 2021)

A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis. - Preey Shah; Aman Bansal; S. Akshay 001; Supratik Chakraborty (LICS, 2021)

On synthesizing Skolem functions for first order logic formulae. - S. Akshay 001; Supratik Chakraborty (CoRR, 2021)

Boolean functional synthesis: hardness and practical algorithms. - S. Akshay 001; Supratik Chakraborty; Shubham Goel 001; Sumith Kulal; Shetal Shah (Formal Methods Syst. Des., 2021)

Approximate Model Counting. - Supratik Chakraborty; Kuldeep S. Meel; Moshe Y. Vardi (Handbook of Satisfiability, 2021)

Projected Model Counting: Beyond Independent Support. - Jiong Yang 002; Supratik Chakraborty; Kuldeep S. Meel (ATVA, 2022)

On Eventual Non-negativity and Positivity for the Weighted Sum of Powers of Matrices. - S. Akshay 001; Supratik Chakraborty; Debtanu Pal (IJCAR, 2022)

On Synthesizing Computable Skolem Functions for First Order Logic. - Supratik Chakraborty; S. Akshay 001 (MFCS, 2022)

Full-program induction: verifying array programs sans loop invariants. - Supratik Chakraborty; Ashutosh Gupta 001; Divyesh Unadkat (Int. J. Softw. Tools Technol. Transf., 2022)

Functional synthesis via input-output separation. - Supratik Chakraborty; Dror Fried; Lucas M. Tabajara; Moshe Y. Vardi (Formal Methods Syst. Des., 2022)

Counterexample Guided Knowledge Compilation for Boolean Functional Synthesis. - S. Akshay 001; Supratik Chakraborty; Sahil Jain (CAV (1), 2023)

Boolean Functional Synthesis: From Under the Hood of Solvers. - Supratik Chakraborty (ICLA, 2023)

Learning Monitor Ensembles for Operational Design Domains. - Hazem Torfah; Aniruddha R. Joshi; Shetal Shah; S. Akshay 001; Supratik Chakraborty; Sanjit A. Seshia (RV, 2023)

VeriAbsL: Scalable Verification by Abstraction and Strategy Prediction (Competition Contribution). - Priyanka Darke; Bharti Chimdyalwar; Sakshi Agrawal; Shrawan Kumar 001; R. Venkatesh 001; Supratik Chakraborty (TACAS (2), 2023)

Exact ASP Counting with Compact Encodings. - Mohimenul Kabir; Supratik Chakraborty; Kuldeep S. Meel (AAAI, 2024)

Auditable Algorithms for Approximate Model Counting. - Kuldeep S. Meel; Supratik Chakraborty; S. Akshay 001 (AAAI, 2024)

The VeriAbs Tool Suite for Code Verification. - Priyanka Darke; Bharti Chimdyalwar; R. Venkatesh 001; Supratik Chakraborty (ATVA, 2024)

Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic. - S. Akshay 001; Supratik Chakraborty; Amir Kafshdar Goharshady; R. Govind 001; Harshit J. Motwani; Sai Teja Varanasi (FM (1), 2024)

Learning Strategies Using Boolean Program Metrics to Verify Industrial Code. - Priyanka Darke; Bharti Chimdyalwar; Manoj Alladawar; Sahil Sulakhe; R. Venkatesh 001; Supratik Chakraborty (ICSME, 2024)

Automated Synthesis of Decision Lists for Polynomial Specifications over Integers. - S. Akshay 001; Supratik Chakraborty; Amir Kafshdar Goharshady; R. Govind 001; Harshit J. Motwani; Sai Teja Varanasi (LPAR, 2024)

On Dependent Variables in Reactive Synthesis. - S. Akshay 001; Eliyahu Basa; Supratik Chakraborty; Dror Fried (TACAS (1), 2024)

PROTON: PRObes for Termination Or Not (Competition Contribution). - Ravindra Metta; Hrishikesh Karmarkar; Kumar Madhukar; R. Venkatesh 001; Supratik Chakraborty (TACAS (3), 2024)

Weakest Precondition Inference for Non-Deterministic Linear Array Programs. - Sumanth Prabhu 001; Deepak D'Souza; Supratik Chakraborty; R. Venkatesh 001; Grigory Fedyukovich (TACAS (2), 2024)

Network Inversion of Binarised Neural Nets. - Pirzada Suhail; Supratik Chakraborty; Amit Sethi (CoRR, 2024)

A shallow dive into the depths of non-termination checking for C programs. - Ravindra Metta; Hrishikesh Karmarkar; Kumar Madhukar; R. Venkatesh 001; Supratik Chakraborty; Samarjit Chakraborty (CoRR, 2024)

Tractable representations for Boolean functional synthesis. - S. Akshay 001; Supratik Chakraborty; Shetal Shah (Ann. Math. Artif. Intell., 2024)

Repairing Control Safety Violations via Scheduler Patch Synthesis. - Anand Yeolekar; Supratik Chakraborty; R. Venkatesh 001; Samarjit Chakraborty (ICCPS, 2025)

Counting Answer Sets of Disjunctive Answer Set Programs. - Mohimenul Kabir; Supratik Chakraborty; Kuldeep S. Meel (CoRR, 2025)

Presburger Functional Synthesis: Complexity and Tractable Normal Forms. - S. Akshay 001; A. R. Balasubramanian; Supratik Chakraborty; Georg Zetzsche (CoRR, 2025)

Locally Pareto-Optimal Interpretations for Black-Box Machine Learning Models. - Aniruddha R. Joshi; Supratik Chakraborty; S. Akshay 001; Shetal Shah; Hazem Torfah; Sanjit Seshia (CoRR, 2025)