Supratik Chakraborty

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 62

Top Venues

CoRR

AAAI

FMCAD

Formal Methods Syst. Des.

Publications

Sumanth Prabhu, Deepak D'Souza, Supratik Chakraborty, R. Venkatesh, Grigory Fedyukovich
Weakest Precondition Inference for Non-Deterministic Linear Array Programs. TACAS (2) (2024)
Pirzada Suhail, Supratik Chakraborty, Amit Sethi
Network Inversion of Binarised Neural Nets. CoRR (2024)
Ravindra Metta, Hrishikesh Karmarkar, Kumar Madhukar, R. Venkatesh, Supratik Chakraborty
PROTON: PRObes for Termination Or Not (Competition Contribution). TACAS (3) (2024)
Kuldeep S. Meel, Supratik Chakraborty, S. Akshay
Auditable Algorithms for Approximate Model Counting. AAAI (2024)
S. Akshay, Eliyahu Basa, Supratik Chakraborty, Dror Fried
On Dependent Variables in Reactive Synthesis. TACAS (1) (2024)
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)
S. Akshay, Eliyahu Basa, Supratik Chakraborty, Dror Fried
On Dependent Variables in Reactive Synthesis. CoRR (2024)
Mohimenul Kabir, Supratik Chakraborty, Kuldeep S. Meel
Exact ASP Counting with Compact Encodings. AAAI (2024)
S. Akshay, Supratik Chakraborty, Sahil Jain
Counterexample Guided Knowledge Compilation for Boolean Functional Synthesis. CAV (1) (2023)
Supratik Chakraborty
Boolean Functional Synthesis: From Under the Hood of Solvers. ICLA (2023)
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)
Mohimenul Kabir, Supratik Chakraborty, Kuldeep S. Meel
Exact ASP Counting with Compact Encodings. CoRR (2023)
Kuldeep S. Meel, Supratik Chakraborty, S. Akshay
Auditable Algorithms for Approximate Model Counting. CoRR (2023)
Hazem Torfah, Aniruddha R. Joshi, Shetal Shah, S. Akshay, Supratik Chakraborty, Sanjit A. Seshia
Learning Monitor Ensembles for Operational Design Domains. RV (2023)
Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat
Full-Program Induction: Verifying Array Programs sans Loop Invariants. CoRR (2022)
S. Akshay, Supratik Chakraborty, Debtanu Pal
On eventual non-negativity and positivity for the weighted sum of powers of matrices. CoRR (2022)
Supratik Chakraborty, Dror Fried, Lucas M. Tabajara, Moshe Y. Vardi
Functional synthesis via input-output separation. Formal Methods Syst. Des. 60 (2) (2022)
Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat
Full-program induction: verifying array programs sans loop invariants. Int. J. Softw. Tools Technol. Transf. 24 (5) (2022)
S. Akshay, Supratik Chakraborty, Debtanu Pal
On Eventual Non-negativity and Positivity for the Weighted Sum of Powers of Matrices. IJCAR (2022)
Supratik Chakraborty, S. Akshay
On Synthesizing Computable Skolem Functions for First Order Logic. MFCS (2022)
Jiong Yang, Supratik Chakraborty, Kuldeep S. Meel
Projected Model Counting: Beyond Independent Support. ATVA (2022)
Hazem Torfah, Shetal Shah, Supratik Chakraborty, S. Akshay, Sanjit A. Seshia
Synthesizing Pareto-Optimal Interpretations for Black-Box Models. FMCAD (2021)
S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah
Boolean functional synthesis: hardness and practical algorithms. Formal Methods Syst. Des. 57 (1) (2021)
Preey Shah, Aman Bansal, S. Akshay, Supratik Chakraborty
A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis. LICS (2021)
Preey Shah, Aman Bansal, S. Akshay, Supratik Chakraborty
A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis. CoRR (2021)
Jiong Yang, Supratik Chakraborty, Kuldeep S. Meel
Projected Model Counting: Beyond Independent Support. CoRR (2021)
Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat
Diffy: Inductive Reasoning of Array Programs using Difference Invariants. CoRR (2021)
Hazem Torfah, Shetal Shah, Supratik Chakraborty, S. Akshay, Sanjit A. Seshia
Synthesizing Pareto-Optimal Interpretations for Black-Box Models. CoRR (2021)
Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat
Diffy: Inductive Reasoning of Array Programs Using Difference Invariants. CAV (2) (2021)
S. Akshay, Supratik Chakraborty
On synthesizing Skolem functions for first order logic formulae. CoRR (2021)
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)
Supratik Chakraborty, Aditya A. Shrotri, Moshe Y. Vardi
On Uniformly Sampling Traces of a Transition System (Extended Version). CoRR (2020)
Swati Jaiswal, Uday P. Khedker, Supratik Chakraborty
Bidirectionality in flow-sensitive demand-driven analysis. Sci. Comput. Program. 190 (2020)
Supratik Chakraborty, Aditya A. Shrotri, Moshe Y. Vardi
On Uniformly Sampling Traces of a Transition System. ICCAD (2020)
Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat
Verifying Array Manipulating Programs with Full-Program Induction. TACAS (1) (2020)
Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat
Verifying Array Manipulating Programs with Full-Program Induction. CoRR (2020)
S. Akshay, Sukanya Basu, Supratik Chakraborty, Rangapriya Sundararajan, Prasanna Venkatraman
Functional Significance Checking in Noisy Gene Regulatory Networks. CP (2019)
Supratik Chakraborty, Vasudeva Varma
Highlights of software R&D in India. Commun. ACM 62 (11) (2019)
Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi
On the Hardness of Probabilistic Inference Relaxations. AAAI (2019)
Supratik Chakraborty, Aditya A. Shrotri, Moshe Y. Vardi
On Symbolic Approaches for Computing the Matrix Permanent. CP (2019)
S. Akshay, Jatin Arora, Supratik Chakraborty, Shankara Narayanan Krishna, Divya Raghunathan, Shetal Shah
Knowledge Compilation for Boolean Functional Synthesis. FMCAD (2019)
Supratik Chakraborty, Aditya A. Shrotri, Moshe Y. Vardi
On Symbolic Approaches for Computing the Matrix Permanent. CoRR (2019)
S. Akshay, Jatin Arora, Supratik Chakraborty, Shankara Narayanan Krishna, Divya Raghunathan, Shetal Shah
Knowledge Compilation for Boolean Functional Synthesis. CoRR (2019)
Swati Jaiswal, Uday P. Khedker, Supratik Chakraborty
Demand-driven Alias Analysis : Formalizing Bidirectional Analyses for Soundness and Precision. CoRR (2018)
S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah
What's Hard About Boolean Functional Synthesis? CAV (1) (2018)
Supratik Chakraborty, Dror Fried, Lucas M. Tabajara, Moshe Y. Vardi
Functional Synthesis via Input-Output Separation. FMCAD (2018)
S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah
What's hard about Boolean Functional Synthesis. CoRR (2018)
Supratik Chakraborty, Dror Fried, Lucas M. Tabajara, Moshe Y. Vardi
Functional Synthesis via Input-Output Separation. CoRR (2018)
S. Akshay, Supratik Chakraborty, Ajith K. John, Shetal Shah
Towards Parallel Boolean Functional Synthesis. TACAS (1) (2017)
Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat
Verifying Array Manipulating Programs by Tiling. SAS (2017)
Supratik Chakraborty, Ashutosh Gupta, Rahul Jain
Matching Multiplications in Bit-Vector Formulas. VMCAI (2017)
Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat
Verifying Array Manipulating Programs by Tiling. CoRR (2017)
S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep
On Petri Nets with Hierarchical Special Arcs. CoRR (2017)
S. Akshay, Supratik Chakraborty, Ajith K. John, Shetal Shah
Towards Parallel Boolean Functional Synthesis. CoRR (2017)
S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep
On Petri Nets with Hierarchical Special Arcs. CONCUR (2017)
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) (2017)
Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi
Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls. IJCAI (2016)
Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty
A generalization of the Łoś-Tarski preservation theorem. Ann. Pure Appl. Log. 167 (3) (2016)
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)
Supratik Chakraborty, Ashutosh Gupta, Rahul Jain
Matching Multiplications in Bit-Vector Formulas. CoRR (2016)
Supratik Chakraborty, Kuldeep S. Meel, Rakesh Mistry, Moshe Y. Vardi
Approximate Probabilistic Inference via Word-Level Counting. AAAI (2016)
Ajith K. John, Supratik Chakraborty
A layered algorithm for quantifier elimination from linear modular constraints. Formal Methods Syst. Des. 49 (3) (2016)
Supratik Chakraborty, Zurab Khasidashvili, Carl-Johan H. Seger, Rajkumar Gajavelly, Tanmay Haldankar, Dinesh Chhatani, Rakesh Mistry
Word-Level Symbolic Trajectory Evaluation. CAV (2) (2015)
Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, Sanjit A. Seshia, Moshe Y. Vardi
On Parallel Scalable Uniform SAT Witness Generation. TACAS (2015)
Ajith K. John, Shetal Shah, Supratik Chakraborty, Ashutosh Trivedi, S. Akshay
Skolem Functions for Factored Formulas. FMCAD (2015)
Supratik Chakraborty, Zurab Khasidashvili, Carl-Johan H. Seger, Rajkumar Gajavelly, Tanmay Haldankar, Dinesh Chhatani, Rakesh Mistry
Word-level Symbolic Trajectory Evaluation. CoRR (2015)
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 (2015)
Ajith K. John, Shetal Shah, Supratik Chakraborty, Ashutosh Trivedi, S. Akshay
Skolem Functions for Factored Formulas. CoRR (2015)
Supratik Chakraborty, Dror Fried, Kuldeep S. Meel, Moshe Y. Vardi
From Weighted to Unweighted Model Counting. IJCAI (2015)
Supratik Chakraborty, Kuldeep S. Meel, Rakesh Mistry, Moshe Y. Vardi
Approximate Probabilistic Inference via Word-Level Counting. CoRR (2015)
Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty
A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures. MFCS (1) (2014)
Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty
A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures. CoRR (2014)
Ajith K. John, Supratik Chakraborty
Quantifier Elimination for Linear Modular Constraints. ICMS (2014)
Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, Sanjit A. Seshia, Moshe Y. Vardi
Distribution-Aware Sampling and Weighted Model Counting for SAT. CoRR (2014)
Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi
Balancing Scalability and Uniformity in SAT Witness Generator. DAC (2014)
Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi
Balancing Scalability and Uniformity in SAT Witness Generator. CoRR (2014)
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)
Hrishikesh Karmarkar, Manas Joglekar, Supratik Chakraborty
Improved Upper and Lower Bounds for Büchi Disambiguation. ATVA (2013)
Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty
Generalizations of the Los-Tarski Preservation Theorem CoRR (2013)
Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi
A Scalable and Nearly Uniform Generator of SAT Witnesses CoRR (2013)
Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi
A Scalable Approximate Model Counter. CP (2013)
Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi
A Scalable and Nearly Uniform Generator of SAT Witnesses. CAV (2013)
Seetha Jayasankar, Supratik Chakraborty
Improving approximate reachability by dynamic interleavings of projections-based algorithms. CACSD (2013)
Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi
A Scalable Approximate Model Counter. CoRR (2013)
Ajith K. John, Supratik Chakraborty
Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors. TACAS (2013)
Abhisekh Sankaran, Bharat Adsul, Vivek Madan, Pritish Kamath, Supratik Chakraborty
Preservation under Substructures modulo Bounded Cores CoRR (2012)
Abhisekh Sankaran, Bharat Adsul, Vivek Madan, Pritish Kamath, Supratik Chakraborty
Preservation under Substructures modulo Bounded Cores. WoLLIC (2012)
Hrishikesh Karmarkar, Supratik Chakraborty
Determinization of $\omega$-automata unified CoRR (2011)
Supratik Chakraborty, Amit Kumar
Frontmatter, Table of Contents, Preface, Conference Organization, External Reviewers. FSTTCS (2011)
Bhargav S. Gulavani, Supratik Chakraborty, G. Ramalingam, Aditya V. Nori
Bottom-up shape analysis using LISF. ACM Trans. Program. Lang. Syst. 33 (5) (2011)
Ajith K. John, Supratik Chakraborty
A Quantifier Elimination Algorithm for Linear Modular Equations and Disequations. CAV (2011)
Bhargav S. Gulavani, Supratik Chakraborty, Aditya V. Nori, Sriram K. Rajamani
Refining abstract interpretations. Inf. Process. Lett. 110 (16) (2010)
Jeff Edmonds, Supratik Chakraborty
Bounding Variance and Expectation of Longest Path Lengths in DAGs. SODA (2010)
Abhisekh Sankaran, Supratik Chakraborty
On Semantic Generalizations of the Bernays-Schönfinkel-Ramsey Class with Finite or Co-finite Spectra CoRR (2010)
Hrishikesh Karmarkar, Supratik Chakraborty
On Minimal Odd Rankings for Büchi Complementation. ATVA (2009)
Bhargav S. Gulavani, Supratik Chakraborty, Ganesan Ramalingam, Aditya V. Nori
Bottom-Up Shape Analysis. SAS (2009)
Dina Thomas, Supratik Chakraborty, Paritosh K. Pandya
Efficient guided symbolic reachability using reachability expressions. Int. J. Softw. Tools Technol. Transf. 10 (2) (2008)
Bhargav S. Gulavani, Supratik Chakraborty, Aditya V. Nori, Sriram K. Rajamani
Automatically Refining Abstract Interpretations. TACAS (2008)
Sasidhar Sunkari, Supratik Chakraborty, Vivekananda M. Vedula, Kailasnath Maneparambil
A Scalable Symbolic Simulator for Verilog RTL. MTV (2007)
Supratik Chakraborty, Joycee Mekie, Dinesh K. Sharma
Reasoning about synchronization in GALS systems. Formal Methods Syst. Des. 28 (2) (2006)

Supratik Chakraborty.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Supratik Chakraborty