Travelled to:
1 × Austria
1 × Hungary
1 × Italy
1 × Russia
2 × United Kingdom
4 × USA
Collaborated with:
A.K.John K.S.Meel M.Y.Vardi P.K.Pandya B.S.Gulavani A.V.Nori D.Thomas B.Sharma G.Ramalingam S.K.Rajamani D.J.Fremont S.A.Seshia S.Akshay S.Goel S.Kulal S.Shah Z.Khasidashvili C.H.Seger R.Gajavelly T.Haldankar D.Chhatani R.Mistry
Talks about:
uniform (3) scalabl (3) generat (3) wit (3) sat (3) reachabl (2) quantifi (2) symbol (2) linear (2) elimin (2)
Person: Supratik Chakraborty
DBLP: Chakraborty:Supratik
Contributed to:
Wrote 11 papers:
- CAV-2015-ChakrabortyKSGH #evaluation
- Word-Level Symbolic Trajectory Evaluation (SC, ZK, CJHS, RG, TH, DC, RM), pp. 128–143.
- TACAS-2015-ChakrabortyFMSV #generative #on the #parallel #satisfiability #scalability
- On Parallel Scalable Uniform SAT Witness Generation (SC, DJF, KSM, SAS, MYV), pp. 304–319.
- DAC-2014-ChakrabortyMV #generative #satisfiability #scalability
- Balancing Scalability and Uniformity in SAT Witness Generator (SC, KSM, MYV), p. 6.
- CAV-2013-ChakrabortyMV #generative #satisfiability #scalability
- A Scalable and Nearly Uniform Generator of SAT Witnesses (SC, KSM, MYV), pp. 608–623.
- TACAS-2013-JohnC #linear #quantifier
- Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors (AKJ, SC), pp. 78–92.
- CAV-2011-JohnC #algorithm #composition #equation #linear #quantifier
- A Quantifier Elimination Algorithm for Linear Modular Equations and Disequations (AKJ, SC), pp. 486–503.
- SAS-2009-GulavaniCRN #analysis #bottom-up
- Bottom-Up Shape Analysis (BSG, SC, GR, AVN), pp. 188–204.
- TACAS-2008-GulavaniCNR #abstract interpretation #automation
- Automatically Refining Abstract Interpretations (BSG, SC, AVN, SKR), pp. 443–458.
- TACAS-2006-ThomasCP #performance #reachability #using
- Efficient Guided Symbolic Reachability Using Reachability Expressions (DT, SC, PKP), pp. 120–134.
- TACAS-2005-SharmaPC #bound #logic
- Bounded Validity Checking of Interval Duration Logic (BS, PKP, SC), pp. 301–316.
- CAV-2018-AkshayCGKS #functional #question #synthesis #what
- What's Hard About Boolean Functional Synthesis? (SA, SC, SG, SK, SS), pp. 251–269.