Approximation of event probabilities in noisy cellular processes
F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, Theoretical Computer Science 412 (2011) 2128–2141.

Verification of STM on relaxed memory models
R. Guerraoui, T.A. Henzinger, V. Singh, Formal Methods in System Design 39 (2011) 297–331.

Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.

Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.

On an efficient decision procedure for imperative tree data structures
T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative Tree Data Structures, IST Austria, 2011.

An efficient decision procedure for imperative tree data structures
T. Wies, M. Muñiz, V. Kuncak, in:, Springer, 2011, pp. 476–491.

Quantitative synthesis for concurrent programs
P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.

ABC: Algebraic Bound Computation for loops
R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118.

Lumpability abstractions of rule-based systems
J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, in:, Open Publishing Association, 2010, pp. 142–161.

SABRE: A tool for the stochastic analysis of biochemical reaction networks
F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2010, pp. 193–194.

Aligators for arrays
T.A. Henzinger, T. Hottelier, L. Kovács, A. Rybalchenko, in:, Springer, 2010, pp. 348–356.

Fast adaptive uniformization of the chemical master equation
F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, IET Systems Biology 4 (2010) 441–452.

Randomness for free
K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, pp. 246–257.

Formal modeling and analysis of timed systems
K. Chatterjee, T.A. Henzinger, eds., Formal Modeling and Analysis of Timed Systems, Springer, 2010.

Robustness in the presence of liveness
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, T. Touili, B. Cook, P. Jackson (Eds.), Springer, 2010, pp. 410–424.

From MTL to deterministic timed automata
D. Nickovic, N. Piterman, in:, T.A. Henzinger, K. Chatterjee (Eds.), Springer, 2010, pp. 152–167.

Solving the chemical master equation using sliding windows
V. Wolf, R. Goel, M. Mateescu, T.A. Henzinger, BMC Systems Biology 4 (2010) 1–19.

From boolean to quantitative notions of correctness
T.A. Henzinger, in:, ACM, 2010, pp. 157–158.

Invariant and type inference for matrices
T.A. Henzinger, T. Hottelier, L. Kovács, A. Voronkov, in:, Springer, 2010, pp. 163–179.

Hybrid numerical solution of the chemical master equation
T.A. Henzinger, M. Mateescu, L. Mikeev, V. Wolf, in:, Springer, 2010, pp. 55–65.

Mean-payoff automaton expressions
K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.

Generalized mean-payoff and energy games
K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–516.

Measuring and synthesizing systems in probabilistic environments
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395.

Strategy construction for parity games with imperfect information
D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information and Computation 208 (2010) 1206–1220.

Strategy logic
K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208 (2010) 677–693.

Runtime verification for software transactional memories
V. Singh, in:, O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner, K. Havelund, I. Lee, G. Pace (Eds.), Springer, 2010, pp. 421–435.

Building a calculus of data structures
V. Kuncak, R. Piskac, P. Suter, T. Wies, in:, G. Barthe, M. Hermenegildo (Eds.), Springer, 2010, pp. 26–44.

FlexPRICE: Flexible provisioning of resources in a cloud environment
T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, IEEE, 2010, pp. 83–90.

Transactions in the jungle
R. Guerraoui, T.A. Henzinger, M. Kapalka, V. Singh, in:, ACM, 2010, pp. 263–272.

A marketplace for cloud resources
T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2010, pp. 1–8.

Robustness of sequential circuits
L. Doyen, T.A. Henzinger, A. Legay, D. Nickovic, in:, IEEE, 2010, pp. 77–84.

Quantitative Simulation Games
P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Z. Manna, D. Peled (Eds.), Time For Verification: Essays in Memory of Amir Pnueli, Springer, 2010, pp. 42–60.

Shape refinement through explicit heap analysis
D. Beyer, T.A. Henzinger, G. Théoduloz, D. Zufferey, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 263–277.

Expressiveness and closure properties for quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23.

Expressiveness of streaming string transducers
R. Alur, P. Cerny, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12.

Doomed program points
J. Hoenicke, K. Leino, A. Podelski, M. Schäf, T. Wies, Formal Methods in System Design 37 (2010) 171–199.

Simulation distances
P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–268.

Quantitative synthesis for concurrent programs
K. Chatterjee, P. Cerny, T.A. Henzinger, A. Radhakrishna, R. Singh, Quantitative Synthesis for Concurrent Programs, IST Austria, 2010.

Simulation distances
P. Cerny, T.A. Henzinger, A. Radhakrishna, Simulation Distances, IST Austria, 2010.

Model checking of linearizability of concurrent list implementations
P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, in:, Springer, 2010, pp. 465–479.

GIST: A solver for probabilistic games
K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.

Model checking of linearizability of concurrent list implementations
P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, Model Checking of Linearizability of Concurrent List Implementations, IST Austria, 2010.

Probabilistic Automata on infinite words: decidability and undecidability results
K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.

Qualitative analysis of partially-observable Markov Decision Processes
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.

Forward analysis of depth-bounded processes
T. Wies, D. Zufferey, T.A. Henzinger, in:, L. Ong (Ed.), Springer, 2010, pp. 94–108.

Fast adaptive uniformization of the chemical master equation
F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2009, pp. 118–127.

Formalisms for specifying Markovian population models
T.A. Henzinger, B. Jobstmann, V. Wolf, in:, Springer, 2009, pp. 3–23.

Distributed, modular HTL
T.A. Henzinger, C. Kirsch, E. Marques, A. Sokolova, in:, IEEE, 2009, pp. 171–180.

On relational interfaces
S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, in:, EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, ACM, 2009, pp. 67–76.

Gist: A solver for probabilistic games
K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, Gist: A Solver for Probabilistic Games, IST Austria, 2009.

Improved lower bounds for request-response and finitary Streett games
K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.

Qualitative analysis of partially-observable Markov decision processes
K. Chatterjee, L. Doyen, T.A. Henzinger, Qualitative Analysis of Partially-Observable Markov Decision Processes, IST Austria, 2009.