Wies T, Muñiz M, Kuncak V. 2011. On an efficient decision procedure for imperative tree data structures, IST Austria, 25p.

Wies T, Muñiz M, Kuncak V. 2011. An efficient decision procedure for imperative tree data structures. CADE 23: Automated Deduction , LNAI , vol. 6803, 476–491.

Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.

Blanc R, Henzinger TA, Hottelier T, Kovács L. 2010. ABC: Algebraic Bound Computation for loops. Logic for Programming, Artificial Intelligence, and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and ReasoningLNCS vol. 6355, 103–118.

Feret J, Henzinger TA, Koeppl H, Petrov T. 2010. Lumpability abstractions of rule-based systems. MECBIC: Membrane Computing and Biologically Inspired Process Calculi, EPTCS, vol. 40, 142–161.

Didier F, Henzinger TA, Mateescu M, Wolf V. 2010. SABRE: A tool for the stochastic analysis of biochemical reaction networks. QEST: Quantitative Evaluation of Systems, 193–194.

Henzinger TA, Hottelier T, Kovács L, Rybalchenko A. 2010. Aligators for arrays. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397, 348–356.

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

Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.

Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed systems, Springer,p.

Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174, 410–424.

Nickovic D, Piterman N. 2010. From MTL to deterministic timed automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6246, 152–167.

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

Henzinger TA. 2010. From boolean to quantitative notions of correctness. POPL: Principles of Programming Languages vol. 45, 157–158.

Henzinger TA, Hottelier T, Kovács L, Voronkov A. 2010. Invariant and type inference for matrices. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 5944, 163–179.

Henzinger TA, Mateescu M, Mikeev L, Wolf V. 2010. Hybrid numerical solution of the chemical master equation. CMSB: Computational Methods in Systems Biology, 55–65.

Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.

Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 505–516.

Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing systems in probabilistic environments. CAV: Computer Aided Verification, LNCS, vol. 6174, 380–395.

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