B Srivathsan
Assistant Professor

Computer Science Department
Chennai Mathematical Institute


Room number 406
H1, SIPCOT IT Park, Siruseri
Kelambakkam 603 103
India


Phone :+91 44 674 80 960
E-Mail :



Education and employment

Post-doc Jul 2012 - Jun 2013 RWTH-Aachen
Software modeling and verification group
Head: Joost-Pieter Katoen
 
Ph.D Oct 2009 - Jun 2012 LaBRI
University of Bordeaux
Advisors: Frédéric Herbreteau, Igor Walukiewicz
 
B.Tech + M.Tech Jul 2004 - Jul 2009 IIT Bombay
(Dual degree) Computer science and engineering department
Advisors: S N Krishna, Paritosh Pandya



Teaching

Current:
Past:

Research Interests

Publications

Why liveness for timed automata is hard and what we can do about it
with F. Herbreteau, T. T. Tran, I. Walukiewicz. Accepted at FSTTCS 2016. PDF

Better abstractions for timed automata
with Frédéric Herbreteau and Igor Walukiewicz. To appear in Infomation and Computation. PDF (Shorter version appeared in LICS'12)

Nesting depth of operators in graph database queries: Expressiveness vs evaluation complexity
with M. Praveen. Proceedings of ICALP 2016 PDF

Defining relations in graphs: how hard is it in the presence of node partitions?
with M. Praveen. Proceedings of PODS 2015 PDF

Lazy abstractions for timed automata
with Frédéric Herbreteau and Igor Walukiewicz. Proceedings of CAV 2013 PDF

Abstractions for timed automata
Ph.D thesis, LaBRI, University of Bordeaux, 2012     Dissertation       Defence slides

Using non-convex approximations for efficient analysis of timed automata
with Frédéric Herbreteau, Dileep Kini and Igor Walukiewicz. Proceedings of FSTTCS 2011 PDF

Coarse abstractions make Zeno behaviours difficult to detect
with Frédéric Herbreteau. Logical Methods in Computer Science PDF (CONCUR 2011, Special issue)

Efficient on-the-fly emptiness check for timed Büchi automata
with Frédéric Herbreteau. Proceedings of ATVA 2010 PDF

Efficient emptiness check for timed Büchi automata
with Frédéric Herbreteau and Igor Walukiewicz. Formal Methods in System Design PDF, (CAV 2010, Special issue) Conference version

An alternate proof of Statman's finite completeness theorem
with Igor Walukiewicz. Information Processing Letters PDF


Last updated: September 2016