K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” Information and Computation, vol. 208, no. 6. Elsevier, pp. 677–693, 2010.
LibreCat: https://research-explorer.ista.ac.at/record/3861
DOI: 10.1016/j.ic.2009.07.004

V. Singh, “Runtime verification for software transactional memories,” presented at the RV: International Conference on Runtime Verification, St. Julians, Malta, 2010, vol. 6418, pp. 421–435.
LibreCat: https://research-explorer.ista.ac.at/record/4362
DOI: 10.1007/978-3-642-16612-9_32

V. Kuncak, R. Piskac, P. Suter, and T. Wies, “Building a calculus of data structures,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 26–44.
LibreCat: https://research-explorer.ista.ac.at/record/4378
DOI: 10.1007/978-3-642-11319-2_6

T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “FlexPRICE: Flexible provisioning of resources in a cloud environment,” presented at the CLOUD: Cloud Computing, Miami, USA, 2010, pp. 83–90.
LibreCat: https://research-explorer.ista.ac.at/record/4381
DOI: 10.1109/CLOUD.2010.71

R. Guerraoui, T. A. Henzinger, M. Kapalka, and V. Singh, “Transactions in the jungle,” presented at the SPAA: ACM Symposium on Parallel Algorithms and Architectures, Santorini, Greece, 2010, pp. 263–272.
LibreCat: https://research-explorer.ista.ac.at/record/4382
DOI: 10.1145/1810479.1810529

T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “A marketplace for cloud resources,” presented at the EMSOFT: Embedded Software , Arizona, USA, 2010, pp. 1–8.
LibreCat: https://research-explorer.ista.ac.at/record/4380
DOI: 10.1145/1879021.1879022

L. Doyen, T. A. Henzinger, A. Legay, and D. Nickovic, “Robustness of sequential circuits,” presented at the ACSD: Application of Concurrency to System Design, 2010, pp. 77–84.
LibreCat: https://research-explorer.ista.ac.at/record/4389
DOI: 10.1109/ACSD.2010.26

P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative Simulation Games,” in Time For Verification: Essays in Memory of Amir Pnueli, vol. 6200, Z. Manna and D. Peled, Eds. Springer, 2010, pp. 42–60.
LibreCat: https://research-explorer.ista.ac.at/record/4392
DOI: 10.1007/978-3-642-13754-9_3

D. Beyer, T. A. Henzinger, G. Théoduloz, and D. Zufferey, “Shape refinement through explicit heap analysis,” presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus, 2010, vol. 6013, pp. 263–277.
LibreCat: https://research-explorer.ista.ac.at/record/4396
DOI: 10.1007/978-3-642-12029-9_19

K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” Logical Methods in Computer Science, vol. 6, no. 3. International Federation of Computational Logic, pp. 1–23, 2010.
LibreCat: https://research-explorer.ista.ac.at/record/3867
DOI: 10.2168/LMCS-6(3:10)2010

R. Alur and P. Cerny, “Expressiveness of streaming string transducers,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 1–12.
LibreCat: https://research-explorer.ista.ac.at/record/488
DOI: 10.4230/LIPIcs.FSTTCS.2010.1

J. Hoenicke, K. Leino, A. Podelski, M. Schäf, and T. Wies, “Doomed program points,” Formal Methods in System Design, vol. 37, no. 2–3. Springer, pp. 171–199, 2010.
LibreCat: https://research-explorer.ista.ac.at/record/533
DOI: 10.1007/s10703-010-0102-0

P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 235–268.
LibreCat: https://research-explorer.ista.ac.at/record/4393
DOI: 10.1007/978-3-642-15375-4_18

K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, Quantitative synthesis for concurrent programs. IST Austria, 2010.
LibreCat: https://research-explorer.ista.ac.at/record/5388
DOI: 10.15479/AT:IST-2010-0004

P. Cerny, T. A. Henzinger, and A. Radhakrishna, Simulation distances. IST Austria, 2010.
LibreCat: https://research-explorer.ista.ac.at/record/5389
DOI: 10.15479/AT:IST-2010-0003

P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, “Model checking of linearizability of concurrent list implementations,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 465–479.
LibreCat: https://research-explorer.ista.ac.at/record/4390
DOI: 10.1007/978-3-642-14295-6_41

K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, “GIST: A solver for probabilistic games,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 665–669.
LibreCat: https://research-explorer.ista.ac.at/record/4388
DOI: 10.1007/978-3-642-14295-6_57
arXiv: 1004.2367

P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, Model checking of linearizability of concurrent list implementations. IST Austria, 2010.
LibreCat: https://research-explorer.ista.ac.at/record/5391
DOI: 10.15479/AT:IST-2010-0001

K. Chatterjee and T. A. Henzinger, “Probabilistic Automata on infinite words: decidability and undecidability results,” presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore, 2010, vol. 6252, pp. 1–16.
LibreCat: https://research-explorer.ista.ac.at/record/3857
DOI: 10.1007/978-3-642-15643-4_1

K. Chatterjee, L. Doyen, and T. A. Henzinger, “Qualitative analysis of partially-observable Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 258–269.
LibreCat: https://research-explorer.ista.ac.at/record/3855
DOI: 10.1007/978-3-642-15155-2_24