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.

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.

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.

N. H. Barton, J. Kelleher, and A. Etheridge, “A new model for extinction and recolonization in two dimensions: Quantifying phylogeography,” Evolution, vol. 64, no. 9. Wiley-Blackwell, pp. 2701–2715, 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.

J. Cristau, C. David, and F. Horn, “How do we remember the past in randomised strategies? ,” in Proceedings of GandALF 2010, Minori, Amalfi Coast, Italy, 2010, vol. 25, pp. 30–39.

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.

P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 235–268.

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

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

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.

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.

P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, Model checking of linearizability of concurrent list implementations. IST Austria, 2010.

K. Chatterjee and N. Fijalkow, Topological, automata-theoretic and logical characterization of finitary languages. IST Austria, 2010.

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.

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.

A. Zemach et al., “Local DNA hypomethylation activates genes in rice endosperm,” Proceedings of the National Academy of Sciences, vol. 107, no. 43. National Academy of Sciences, pp. 18729–18734, 2010.

A. Zemach and D. Zilberman, “Evolution of eukaryotic DNA methylation and the pursuit of safer sex,” Current Biology, vol. 20, no. 17. Elsevier, pp. 0–5, 2010.

A. Zemach, I. E. McDaniel, P. Silva, and D. Zilberman, “Genome-wide evolutionary analysis of eukaryotic DNA methylation,” Science, vol. 328, no. 5980. American Association for the Advancement of Science, pp. 916–919, 2010.

U. Rosas, N. H. Barton, L. Copsey, P. Barbier De Reuille, and E. Coen, “Cryptic variation between species and the basis of hybrid performance,” PLoS Biology, vol. 8, no. 7. Public Library of Science, 2010.