MATHEMATICS AND COMPUTER SCIENCE

Henzinger Group

Design and Analysis of Concurrent and Embedded Systems

Humans and computers are surprisingly similar: while the interaction between two actors may be simple, every additional actor complicates matters. The Henzinger group builds the mathematical foundations for designing complex hardware and software systems.

Over 90% of today’s worldwide computing power is found in unexpected places like cell phones or kitchen appliances. Software has become one of the most complicated man-made artifacts, making software bugs unavoidable. The Henzinger group addresses the challenge of reducing software bugs in concurrent and embedded systems. The former consist of parallel processes that interact with one another, whether in a global network or on a tiny chip. Because of the large number of possible interactions between parallel processes, concurrent software is particularly error-prone, and sometimes bugs show up after years of flawless operation. Embedded systems interact with the physical world; an additional challenge for this kind of safety-critical software is to react sufficiently quickly. The Henzinger group invents mathematical methods and develops computational tools for improving the reliability of software in concurrent and embedded systems.

Group Leader


On this site:


Team


Current Projects

Analysis and synthesis of concurrent software | Quantitative modeling and verification of reactive systems | Predictability and robustness for real-time and embedded systems | Model checking biochemical reaction networks


Recent Publications

Avni G, Henzinger TA, Chonev VK. 2019. Infinite-duration bidding games. Journal of the ACM. 66(4), 31. View

Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical Computer Science. View

Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. 2019. Run-time optimization for learned controllers through quantitative games. 31st International Conference on Computer-Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 11561. 630–649. View

Garcia Soto M, Henzinger TA, Schilling C, Zeleznik L. 2019. Membership-based synthesis of linear hybrid automata. 31st International Conference on Computer-Aided Verification. CAV: Computer-Aided Verification, LNCS, vol. 11561. 297–314. View

Avni G, Henzinger TA, Ibsen-Jensen R. 2018. Infinite-duration poorman-bidding games. 14th International Conference on Web and Internet Economics, WINE, LNCS, vol. 11316. 21–36. View

View All Publications

Career

since 2009 Professor, IST Austria
2004 – 2009 Professor, EPFL, Lausanne, Switzerland
1999 – 2000 Director, Max Planck Institute for Computer Science, Saarbrücken, Germany
1998 – 2004 Professor, University of California, Berkeley, USA
1997 – 1998 Associate Professor, University of California, Berkeley, USA
1996 – 1997 Assistant Professor, University of California, Berkeley, USA
1992 – 1995 Assistant Professor, Cornell University, Ithaca, USA
1991 Postdoc, University Joseph Fourier, Grenoble, France
1991 PhD, Stanford University, Palo Alto, USA


Selected Distinctions

ISI Highly Cited Researcher
2019 European Association for Theoretical Computer Science Award
2015 Royal Society Milner Award
2015 EATCS Fellow
2015 Honorary Doctorate, Masaryk University, Brno, Czech Republic
2014 Most Influential 2004 POPL Paper Award
2013 AAAS Fellow
2012 Wittgenstein Award
2012 Honorary Doctorate, University Joseph Fourier, Grenoble, France
2012 Logic in Computer Science Test-of-Time Award
2011 Member, Austrian Academy of Sciences (ÖAW)
2011 ACM SIGSOFT Impact Paper Award
2010 ERC Advanced Grant
2006 ACM Fellow
2006 IEEE Fellow
2006 Member, Academia Europaea
2005 Member, German Academy of Sciences Leopoldina
1995 ONR Young Investigator Award
1995 NSF Faculty Early Career Development Award


Addtional Information

Open Tom Henzinger’s website
View Henzinger Group website



Back to Top