B Srivathsan
PhD Student in Computer Science,
Advisors: Frédéric Herbreteau, Igor Walukiewicz

LaBRI, Université Bordeaux-1

Domaine Universitaire
351 cours de la libération
33405 Talence Cedex
FRANCE

Phone :+33 5 4000 3553
E-Mail :


Background         Research Interests         Publications         Talks         Other activities

Background

I am a third year PhD student at LaBRI, expecting to defend my thesis by June 2012.

Prior to this, I graduated from the Indian Institute of Technology (IIT), Bombay with a Bachelor of Technology (B.Tech) and a Master of Technology (M.Tech) in Computer Science and Engineering, under the dual degree programme (5 years).

My dual degree thesis was under the supervision of Prof Krishna S.



Research Interests


Publications

Better abstractions for timed automata
with Frédéric Herbreteau and Igor Walukiewicz. (Submitted) PDF

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. Proceedings of CONCUR 2011 PDF (Invited for Special issue in Logical Methods in Computer Science)

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. (Submitted to journal) PDF



Talks

Zone based verification of Timed Automata Revisited    Slides
MoVe (Modélisation et Vérification) seminar - LIF, Marseille, France (November 2011)

Using non-convex Approximations for Efficient Analysis of Timed Automata    Slides
Automata, Concurrency and Timed Systems - III - CMI, Chennai, India (January 2011)
Groupe de Travail Modélisation et Vérification - LaBRI, Bordeaux, France (April 2011)
Verification Seminar - Université Libre de Bruxelles, Brussels, Belgium (November 2011)
FSTTCS - IIT Bombay, India (December 2011)

Efficient emptiness check for Timed Büchi automata    Slides
CFDVS seminar - IIT Bombay, India (August 2010)
CMI - Chennai, India (August 2010)

An alternate proof of Statman's Singleton Theorem    Slides
Workshop on Higher-order Recursion Schemes and Pushdown Automata - LIAFA, Paris, France (March 2010)



Other activities

Co-organize seminar on Verification at LaBRI


Last updated: January 2012