Supratik Chakraborty

Professor
Dept. of Computer Science and Engineering
IIT Bombay, Powai
Mumbai 400076

Tel: (+91 22) 25764787 / 25767721
Fax: (+91 22) 25720290

Training

B. Tech.	I.I.T., Kharagpur
M.S. and Ph.D.	Stanford University

Research

My current research interests include:

Constrained counting and sampling, and their applications
Formal methods for analysis and verification of large and complex systems
Automata, logic and finite model theory
Design and analysis of asynchronous and mixed synchronous-asynchronous systems

I'm also affiliated to the Centre for Formal Design and Verification of Software at IIT Bombay.

Publications

Recent Invited Talks/Tutorials

"Scaling Discrete Integration and Sampling: Foundations and Challenges", tutorial co-presented with Kuldeep S. Meel at IJCAI 2018
"Abstract Interpretation and Program Verification", tutorial presented at ACM ISOFT Winter School on Software Engineering [Slides]
"Discrete Sampling and Counting for the AI Practitioner", tutorial co-presented with Kuldeep S. Meel and Moshe Y. Vardi at AAAI 2017
"Counting and Sampling Solutions of SAT/SMT Constraints", invited talk at International Summer School on Satisfiabilty, Satisfiability Modulo Theories and Automated Reasoning 2016
"Discrete Sampling and Integration in High Dimensional Spaces", tutorial co-presented with Kuldeep S. Meel and Moshe Y. Vardi at UAI 2016
"Word-level Quantifier Elimination", invited talk at VMCAI 2015 [ Slides ]

Recent conference committee memberships

2018	AAAI, FMCAD, VSTTE
2017	ATVA
2016	LICS , FMCAD , ForMABS
2015	POPL (Ext Review Committee), ASYNC
2014	ASYNC , ATVA , VLSI Design , FSTTCS
2013	ATVA
2012	CAV , ATVA (PC Co-chair), ICTAC
2011	ASYNC , FSTTCS (PC Co-Chair), SPIN , VLSI Design (Verification Track Chair)
2010	ASYNC , VLSI Design
2009	AFM , ASYNC , FMCAD , FMGALS

Doctoral students

1	Joycee Mekie , now at IIT Gandhinagar (co-supervised with Dinesh K. Sharma )	Interfacing Solutions for Globally Asynchronous Locally Synchronous (GALS) Systems (graduated 2009)
2	Bhargav Gulavani, now at Microsoft Research	On Improving the Precision of Static Program Analysis (graduated 2010, IIT Bombay Excellence in Thesis (CSE) Award 2011)
3	Hrishikesh Karmarkar , now at IIT Bombay	Improved Constructions for Complementation, Disambiguation and Determinization of ω-automata (graduated 2011)
4	Seetha Jayasankar	Reachability Analysis of Large Sequential Circuits (on leave)
5	Abhisekh Sankaran, now at I.M.Sc., Chennai (co-supervised with Bharat Adsul )	A Generalization of the Łoś-Tarski Preservation Theorem (graduated 2016, IIT Bombay Excellence in Thesis (CSE) Award 2017)
6	Ajith K. John, now at BARC	Scalable Quantifier Elimination Techniques for Formal Verification (graduated 2017)
7	Sukanya Basu (co-supervising with Akshay S.)	Formal Methods for Analysis of Biological Systems (ongoing)
8	Kuldeep Singh Meel , now at National University of Singapore (co-supervised with Moshe Y. Vardi, Rice University)	Constrained Counting and Sampling: Bridging the Gap between Theory and Practice (graduated 2017)
9	Divyesh Unadkat (co-supervising with Ashutosh Gupta)	Techniques in Software Verification (ongoing)

Last but not the least, alumni and their contributions to our research efforts.

Teaching

Undergraduate courses: CS101 (Computer Programming and Utilization), CS331 (Theory of Computation), CS208 (Automata Theory and Logic -- well, we hardly had time to cover logic), CS206 (Formal Methods in Computer Science), CS226+CS254 (Digital Logic Design -- theory + lab)

Graduate courses: CS615 (Formal Specification and Verification of Programs), CS719 (Topics in Mathematical Foundations of Formal Verification), CS628 (Introduction to Asynchronous Systems), CS402 (Selected Case Studies of Computer Systems: Formal Verification of Programs -- really, a variant of CS615)

Links to some course home pages:

Ongoing and recent past:
Spring	2018	Digital Logic Design (CS226) + Digital Logic Design Lab (CS254)
Autumn	2017	Formal Specification and Verification of Programs (CS615)
Historically speaking:
Autumn	2014	Computer Programming and Utilization (CS101)
Autumn	2013	Topics in Mathematical Foundations of Formal Verification (CS719)
Spring	2012	Automata Theory and Logic (CS208)
Spring	2008	Formal Methods in Computer Science (CS206)
Autumn	2003	Theory of Computation (CS331)
Spring	2004	Introduction to Asynchronous Systems (CS628)

And for those interested in nothing but business plans ...