Computer-aided Verification, Game Theory
The Chatterjee group is interested in the theoretical foundations of game theory and formal verification. Game theory in the formal verification of software involves the algorithmic analysis of various forms of games played on graphs. This broad framework allows effective analysis of many important questions of computer science and helps in the development of software systems. The Chatterjee group works on theoretical aspects for the better understanding of games and develops new algorithms, presenting the theoretical foundations for the formal verification of systems.
Institute of Science and Technology Austria (IST Austria)
Am Campus 1
A – 3400 Klosterneuburg
Phone: +43 (0)2243 9000-3201
E-mail: krishnendu.chatterjee@ ist.ac.at
- Martin Chmelik, PhD Student
- Ventsislav Chonev, Postdoc
- Hongfei Fu, Postdoc
- Christian Hilbe, Postdoc
- Rasmus Ibsen-Jensen, Postdoc
- Petr Novotny, Postdoc
- Andreas Pavlogiannis, PhD Student
- Josef Tkadlec, PhD Student
- Quantitative verification
- Stochastic game theory
- Modern graph algorithms for verification problems
- Evolutionary game theory
- Brazdil T, Chatterjee K, Forejt V, Kucera A. 2013. Trading Performances for Stability in Markov Decision Processes. Proc. of LICS 2013, 331-340.
- Chatterjee K, Doyen L. 2013. Partial-Observation Stochastic Gamesn: How to Win when Beliefs Fail. Proc. of LICS 2012, 175-184.
- Chatterjee K, Henzinger M. 2012. An O(n²) Time Algorithm for Alternating Büchi Games. Proc. of SODA 2012, 1386-1399.
Since 2014 Professor, IST Austria
2009-2014 Assistant Professor, IST Austria
2008–2009 Postdoc, University of California, Santa Cruz, USA
2007 PhD, University of California, Berkeley, USA
2011 Microsoft Research Faculty Fellowship
2011 ERC Starting Grant
2008 Ackerman Award, best thesis worldwide in Computer Science Logic
2007 David J. Sakrison Prize, best thesis in EECS, University of California, Berkeley, USA
2001 President of India Gold Medal, best IIT student of the year