Supratik Chakraborty

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

Upcoming and Recent Talks

"Counting and Sampling Solutions of SAT/SMT Constraints", International Summer School on Satisfiabilty, Satisfiability Modulo Theories and Automated Reasoning 2016
"Discrete Sampling and Integration in High Dimensional Spaces", tutorial to be co-presented with Kuldeep S. Meel and Moshe Y. Vardi at UAI 2016
"Word-level Quantifier Elimination", invited talk at VMCAI 2015 [ Slides ]
"Proving Programs Correct by Abstract Interpretation", invited talk at WEPL 2015 [ Slides ]

Recent conference committee memberships

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

Ph.D. student theses

1	Joycee Mekie (co-supervised with Dinesh K. Sharma )	Interfacing Solutions for Globally Asynchronous Locally Synchronous (GALS) Systems (graduated, 2009)
2	Bhargav Gulavani	On Improving the Precision of Static Program Analysis (graduated, 2010)
3	Hrishikesh Karmarkar	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 (co-supervised with Bharat Adsul )	A Generalization of the Łoś-Tarski Preservation Theorem (graduated, 2016)
6	Ajith K. John	Scalable Quantifier Elimination Techniques for Formal Verification (submitted)
7	Sukanya Basu (co-supervising with Akshay S.)	Formal Methods for Analysis of Biological Systems (ongoing)
8	Kuldeep Singh Meel (co-supervising with Moshe Y. Vardi, Rice University)	Studies in hashing based randomized techniques for combinatorial problems (ongoing)
7	Divyesh Unadkat (co-supervising with Ashutosh Gupta, TIFR Mumbai)	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: CS628 (Introduction to Asynchronous Systems), CS719 (Topics in Mathematical Foundations of Formal Verification), CS615 (Formal Specification and Verification of Programs), 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:
Autumn	2016	Formal Specification and Verification of Programs (CS615)
Spring	2016	Digital Logic Design (CS226) + Digital Logic Design Lab (CS254)
Autumn	2014	Computer Programming and Utilization (CS101)
Autumn	2013	Topics in Mathematical Foundations of Formal Verification (CS719)
Spring	2012	Automata Theory and Logic (CS208)
Historically speaking:
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 ...