Wies T, Muñiz M, Kuncak V. 2011. On an efficient decision procedure for imperative tree data structures, IST Austria, 25p.
LibreCat: https://research-explorer.ista.ac.at/record/5383
DOI: 10.15479/AT:IST-2011-0005

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.
LibreCat: https://research-explorer.ista.ac.at/record/3323
DOI: 10.1007/978-3-642-22438-6_36

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.
LibreCat: https://research-explorer.ista.ac.at/record/3366
DOI: 10.1007/978-3-642-22110-1_20

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.
LibreCat: https://research-explorer.ista.ac.at/record/10908
DOI: 10.1007/978-3-642-17511-4_7

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.
LibreCat: https://research-explorer.ista.ac.at/record/3719
arXiv: 1011.0496

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.
LibreCat: https://research-explorer.ista.ac.at/record/3847
DOI: 10.1109/QEST.2010.33

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.
LibreCat: https://research-explorer.ista.ac.at/record/3845
DOI: 10.1007/978-3-642-16242-8_25

Didier F, Henzinger TA, Mateescu M, Wolf V. 2010. Fast adaptive uniformization of the chemical master equation. IET Systems Biology. 4(6), 441–452.
LibreCat: https://research-explorer.ista.ac.at/record/3842
DOI: 10.1049/iet-syb.2010.0005

Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.
LibreCat: https://research-explorer.ista.ac.at/record/3856
DOI: 10.1007/978-3-642-15155-2_23

Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed systems, Springer,p.
LibreCat: https://research-explorer.ista.ac.at/record/3859
DOI: 10.1007/978-3-642-15297-9

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.
LibreCat: https://research-explorer.ista.ac.at/record/3866
DOI: 10.1007/978-3-642-14295-6_36

Nickovic D, Piterman N. 2010. From MTL to deterministic timed automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6246, 152–167.
LibreCat: https://research-explorer.ista.ac.at/record/4369
DOI: 10.1007/978-3-642-15297-9_13

Wolf V, Goel R, Mateescu M, Henzinger TA. 2010. Solving the chemical master equation using sliding windows. BMC Systems Biology. 4(42), 1–19.
LibreCat: https://research-explorer.ista.ac.at/record/3834
DOI: 10.1186/1752-0509-4-42

Henzinger TA. 2010. From boolean to quantitative notions of correctness. POPL: Principles of Programming Languages vol. 45, 157–158.
LibreCat: https://research-explorer.ista.ac.at/record/3840
DOI: 10.1145/1706299.1706319

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.
LibreCat: https://research-explorer.ista.ac.at/record/3839
DOI: 10.1007/978-3-642-11319-2_14

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.
LibreCat: https://research-explorer.ista.ac.at/record/3838
DOI: 10.1145/1839764.1839772

Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.
LibreCat: https://research-explorer.ista.ac.at/record/3853
DOI: 10.1007/978-3-642-15375-4_19

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.
LibreCat: https://research-explorer.ista.ac.at/record/3860
DOI: 10.4230/LIPIcs.FSTTCS.2010.505

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.
LibreCat: https://research-explorer.ista.ac.at/record/3864
DOI: 10.1007/978-3-642-14295-6_34

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.
LibreCat: https://research-explorer.ista.ac.at/record/3863
DOI: 10.1016/j.ic.2009.09.006