Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,”https://doi.org/10.1007/978-3-642-15375-4_19__6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.1007/978-3-642-15375-4_19 .

Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Generalized Mean-Payoff and Energy Games,”https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505__8:505–16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,”https://doi.org/10.1007/978-3-642-14295-6_34__6174:380–95. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_34 .

Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect Information.”https://doi.org/10.1016/j.ic.2009.09.006__Information and Computation. Elsevier, 2010.https://doi.org/10.1016/j.ic.2009.09.006 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic.”https://doi.org/10.1016/j.ic.2009.07.004__Information and Computation. Elsevier, 2010.https://doi.org/10.1016/j.ic.2009.07.004 .

Singh, Vasu. “Runtime Verification for Software Transactional Memories.”https://doi.org/10.1007/978-3-642-16612-9_32__edited by Oleg Sokolsky, Grigore Rosu, Nikolai Tilmann, Howard Barringer, Ylies Falcone, Bernd Finkbeiner, Klaus Havelund, Insup Lee, and Gordon Pace, 6418:421–35. Springer, 2010.https://doi.org/10.1007/978-3-642-16612-9_32 .

Kuncak, Viktor, Ruzica Piskac, Philippe Suter, and Thomas Wies. “Building a Calculus of Data Structures.”https://doi.org/10.1007/978-3-642-11319-2_6__edited by Gilles Barthe and Manuel Hermenegildo, 5944:26–44. Springer, 2010.https://doi.org/10.1007/978-3-642-11319-2_6 .

Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment,”https://doi.org/10.1109/CLOUD.2010.71__83–90. IEEE, 2010.https://doi.org/10.1109/CLOUD.2010.71 .

Guerraoui, Rachid, Thomas A Henzinger, Michal Kapalka, and Vasu Singh. “Transactions in the Jungle,”https://doi.org/10.1145/1810479.1810529__263–72. ACM, 2010.https://doi.org/10.1145/1810479.1810529 .

Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “A Marketplace for Cloud Resources,”https://doi.org/10.1145/1879021.1879022__1–8. ACM, 2010.https://doi.org/10.1145/1879021.1879022 .

Doyen, Laurent, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Robustness of Sequential Circuits,”https://doi.org/10.1109/ACSD.2010.26__77–84. IEEE, 2010.https://doi.org/10.1109/ACSD.2010.26 .

Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Simulation Games.”https://doi.org/10.1007/978-3-642-13754-9_3__In Time For Verification: Essays in Memory of Amir Pnueli, edited by Zohar Manna and Doron Peled, 6200:42–60. Essays in Memory of Amir Pnueli. Springer, 2010.https://doi.org/10.1007/978-3-642-13754-9_3 .

Beyer, Dirk, Thomas A Henzinger, Grégory Théoduloz, and Damien Zufferey. “Shape Refinement through Explicit Heap Analysis.”https://doi.org/10.1007/978-3-642-12029-9_19__edited by David Rosenblum and Gabriele Taenzer, 6013:263–77. Springer, 2010.https://doi.org/10.1007/978-3-642-12029-9_19 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.”https://doi.org/10.2168/LMCS-6(3:10)2010__Logical Methods in Computer Science. International Federation of Computational Logic, 2010.https://doi.org/10.2168/LMCS-6(3:10)2010 .

Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,”https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1__8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1 .

Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.”https://doi.org/10.1007/s10703-010-0102-0__Formal Methods in System Design. Springer, 2010.https://doi.org/10.1007/s10703-010-0102-0 .

Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances,”https://doi.org/10.1007/978-3-642-15375-4_18__6269:235–68. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.1007/978-3-642-15375-4_18 .

Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010.https://doi.org/10.15479/AT:IST-2010-0004 .

Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. Simulation Distances. IST Austria, 2010.https://doi.org/10.15479/AT:IST-2010-0003 .

Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. “Model Checking of Linearizability of Concurrent List Implementations,”https://doi.org/10.1007/978-3-642-14295-6_41__6174:465–79. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_41 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,”https://doi.org/10.1007/978-3-642-14295-6_57__6174:665–69. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_57 .

Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. Model Checking of Linearizability of Concurrent List Implementations. IST Austria, 2010.https://doi.org/10.15479/AT:IST-2010-0001 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Automata on Infinite Words: Decidability and Undecidability Results,”https://doi.org/10.1007/978-3-642-15643-4_1__6252:1–16. Springer, 2010.https://doi.org/10.1007/978-3-642-15643-4_1 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Qualitative Analysis of Partially-Observable Markov Decision Processes,”https://doi.org/10.1007/978-3-642-15155-2_24__6281:258–69. Springer, 2010.https://doi.org/10.1007/978-3-642-15155-2_24 .

Wies, Thomas, Damien Zufferey, and Thomas A Henzinger. “Forward Analysis of Depth-Bounded Processes.”https://doi.org/10.1007/978-3-642-12032-9_8__edited by Luke Ong, 6014:94–108. Springer, 2010.https://doi.org/10.1007/978-3-642-12032-9_8 .

Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Fast Adaptive Uniformization of the Chemical Master Equation,”https://doi.org/10.1109/HiBi.2009.23__4:118–27. IEEE, 2009.https://doi.org/10.1109/HiBi.2009.23 .

Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models,”https://doi.org/10.1007/978-3-642-04420-5_2__5797:3–23. Springer, 2009.https://doi.org/10.1007/978-3-642-04420-5_2 .

Henzinger, Thomas A, Christoph Kirsch, Eduardo Marques, and Ana Sokolova. “Distributed, Modular HTL,”https://doi.org/10.1109/RTSS.2009.9__171–80. IEEE, 2009.https://doi.org/10.1109/RTSS.2009.9 .

Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “On Relational Interfaces.”https://doi.org/10.1145/1629335.1629346__In EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, 67–76. ACM, 2009.https://doi.org/10.1145/1629335.1629346 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. Gist: A Solver for Probabilistic Games. IST Austria, 2009.https://doi.org/10.15479/AT:IST-2009-0003 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009.https://doi.org/10.15479/AT:IST-2009-0002 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. Qualitative Analysis of Partially-Observable Markov Decision Processes. IST Austria, 2009.https://doi.org/10.15479/AT:IST-2009-0001 .