T. A. Henzinger and M. Mateescu, “Propagation models for computing biochemical reaction networks,” presented at the CMSB: Computational Methods in Systems Biology, Paris, France, 2011, pp. 1–3.
LibreCat: https://research-explorer.ista.ac.at/record/3299
DOI: 10.1145/2037509.2037510

R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Specification-centered robustness,” in 6th IEEE International Symposium on Industrial and Embedded Systems, Vasteras, Sweden, 2011, pp. 176–185.
LibreCat: https://research-explorer.ista.ac.at/record/3316
DOI: 10.1109/SIES.2011.5953660

S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous relational interfaces,” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33, no. 4. ACM, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3353
DOI: 10.1145/1985342.1985345

R. Halalai, T. A. Henzinger, and V. Singh, “Quantitative evaluation of BFT protocols,” presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany, 2011, pp. 255–264.
LibreCat: https://research-explorer.ista.ac.at/record/3355
DOI: 10.1109/QEST.2011.40

K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4. ACM, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3354
DOI: 10.1145/1970398.1970404

J. Fisher, D. Harel, and T. A. Henzinger, “Biology as reactivity,” Communications of the ACM, vol. 54, no. 10. ACM, pp. 72–82, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3352
DOI: 10.1145/2001269.2001289

J. Fisher, T. A. Henzinger, D. Nickovic, N. Piterman, A. Singh, and M. Vardi, “Dynamic reactive modules,” presented at the CONCUR: Concurrency Theory, Aachen, Germany, 2011, vol. 6901, pp. 404–418.
LibreCat: https://research-explorer.ista.ac.at/record/3362
DOI: 10.1007/978-3-642-23217-6_27

K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.
LibreCat: https://research-explorer.ista.ac.at/record/3365
DOI: 10.1007/978-3-642-19835-9_24

K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.
LibreCat: https://research-explorer.ista.ac.at/record/3363
arXiv: 1104.0127

T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” IJFCS: International Journal of Foundations of Computer Science, vol. 22, no. 4. World Scientific Publishing, pp. 823–841, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3381
DOI: 10.1142/S0129054111008441

K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” Logical Methods in Computer Science, vol. 7, no. 4. International Federation of Computational Logic, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3315
DOI: 10.2168/LMCS-7(4:8)2011

S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted automata ,” presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan, 2011, vol. 6996, pp. 482–491.
LibreCat: https://research-explorer.ista.ac.at/record/3326
DOI: 10.1007/978-3-642-24372-1_37

R. Alur and P. Cerny, “Streaming transducers for algorithmic verification of single pass list processing programs,” presented at the POPL: Principles of Programming Languages, Texas, USA, 2011, vol. 46, no. 1, pp. 599–610.
LibreCat: https://research-explorer.ista.ac.at/record/3325
DOI: 10.1145/1926385.1926454

R. Piskac and T. Wies, “Decision procedures for automating termination proofs,” presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA, 2011, vol. 6538, pp. 371–386.
LibreCat: https://research-explorer.ista.ac.at/record/3324
DOI: 10.1007/978-3-642-18275-4_26

U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.
LibreCat: https://research-explorer.ista.ac.at/record/3360
DOI: 10.4230/LIPIcs.CSL.2011.82

P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.
LibreCat: https://research-explorer.ista.ac.at/record/3361
DOI: 10.1109/CSF.2011.21

T. A. Henzinger, V. Singh, T. Wies, and D. Zufferey, “Scheduling large jobs by abstraction refinement,” presented at the EuroSys, Salzburg, Austria, 2011, pp. 329–342.
LibreCat: https://research-explorer.ista.ac.at/record/3358
DOI: 10.1145/1966445.1966476

P. Cerny and T. A. Henzinger, “From boolean to quantitative synthesis,” presented at the EMSOFT: Embedded Software , Taipei; Taiwan, 2011, pp. 149–154.
LibreCat: https://research-explorer.ista.ac.at/record/3359
DOI: 10.1145/2038642.2038666

K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.
LibreCat: https://research-explorer.ista.ac.at/record/3357
DOI: 10.1007/978-3-642-21254-3_17

F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Approximation of event probabilities in noisy cellular processes,” Theoretical Computer Science, vol. 412, no. 21. Elsevier, pp. 2128–2141, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3364
DOI: 10.1016/j.tcs.2010.10.022

R. Guerraoui, T. A. Henzinger, and V. Singh, “Verification of STM on relaxed memory models,” Formal Methods in System Design, vol. 39, no. 3. Springer, pp. 297–331, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/531
DOI: 10.1007/s10703-011-0131-3

U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3356
DOI: 10.1109/LICS.2011.33

U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications with accumulative values. IST Austria, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/5385
DOI: 10.15479/AT:IST-2011-0003

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

T. Wies, M. Muñiz, and V. Kuncak, “An efficient decision procedure for imperative tree data structures,” presented at the CADE 23: Automated Deduction , Wrocaw, Poland, 2011, vol. 6803, pp. 476–491.
LibreCat: https://research-explorer.ista.ac.at/record/3323
DOI: 10.1007/978-3-642-22438-6_36

P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.
LibreCat: https://research-explorer.ista.ac.at/record/3366
DOI: 10.1007/978-3-642-22110-1_20

R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound Computation for loops,” in Logic for Programming, Artificial Intelligence, and Reasoning, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.
LibreCat: https://research-explorer.ista.ac.at/record/10908
DOI: 10.1007/978-3-642-17511-4_7

J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule-based systems,” presented at the MECBIC: Membrane Computing and Biologically Inspired Process Calculi, Jena, Germany, 2010, vol. 40, pp. 142–161.
LibreCat: https://research-explorer.ista.ac.at/record/3719
arXiv: 1011.0496

F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “SABRE: A tool for the stochastic analysis of biochemical reaction networks,” presented at the QEST: Quantitative Evaluation of Systems, Williamsburg, USA, 2010, pp. 193–194.
LibreCat: https://research-explorer.ista.ac.at/record/3847
DOI: 10.1109/QEST.2010.33

T. A. Henzinger, T. Hottelier, L. Kovács, and A. Rybalchenko, “Aligators for arrays,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 348–356.
LibreCat: https://research-explorer.ista.ac.at/record/3845
DOI: 10.1007/978-3-642-16242-8_25

F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Fast adaptive uniformization of the chemical master equation,” IET Systems Biology, vol. 4, no. 6. Institution of Engineering and Technology, pp. 441–452, 2010.
LibreCat: https://research-explorer.ista.ac.at/record/3842
DOI: 10.1049/iet-syb.2010.0005

K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 246–257.
LibreCat: https://research-explorer.ista.ac.at/record/3856
DOI: 10.1007/978-3-642-15155-2_23

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

R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness in the presence of liveness,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 410–424.
LibreCat: https://research-explorer.ista.ac.at/record/3866
DOI: 10.1007/978-3-642-14295-6_36

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

V. Wolf, R. Goel, M. Mateescu, and T. A. Henzinger, “Solving the chemical master equation using sliding windows,” BMC Systems Biology, vol. 4, no. 42. BioMed Central, pp. 1–19, 2010.
LibreCat: https://research-explorer.ista.ac.at/record/3834
DOI: 10.1186/1752-0509-4-42

T. A. Henzinger, “From boolean to quantitative notions of correctness,” presented at the POPL: Principles of Programming Languages, Madrid, Spain, 2010, vol. 45, no. 1, pp. 157–158.
LibreCat: https://research-explorer.ista.ac.at/record/3840
DOI: 10.1145/1706299.1706319

T. A. Henzinger, T. Hottelier, L. Kovács, and A. Voronkov, “Invariant and type inference for matrices,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 163–179.
LibreCat: https://research-explorer.ista.ac.at/record/3839
DOI: 10.1007/978-3-642-11319-2_14

T. A. Henzinger, M. Mateescu, L. Mikeev, and V. Wolf, “Hybrid numerical solution of the chemical master equation,” presented at the CMSB: Computational Methods in Systems Biology, Trento, Italy, 2010, pp. 55–65.
LibreCat: https://research-explorer.ista.ac.at/record/3838
DOI: 10.1145/1839764.1839772

K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283.
LibreCat: https://research-explorer.ista.ac.at/record/3853
DOI: 10.1007/978-3-642-15375-4_19

K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Generalized mean-payoff and energy games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 505–516.
LibreCat: https://research-explorer.ista.ac.at/record/3860
DOI: 10.4230/LIPIcs.FSTTCS.2010.505

K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395.
LibreCat: https://research-explorer.ista.ac.at/record/3864
DOI: 10.1007/978-3-642-14295-6_34

D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Strategy construction for parity games with imperfect information,” Information and Computation, vol. 208, no. 10. Elsevier, pp. 1206–1220, 2010.
LibreCat: https://research-explorer.ista.ac.at/record/3863
DOI: 10.1016/j.ic.2009.09.006

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

T. Wies, D. Zufferey, and T. A. Henzinger, “Forward analysis of depth-bounded processes,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus, 2010, vol. 6014, pp. 94–108.
LibreCat: https://research-explorer.ista.ac.at/record/4361
DOI: 10.1007/978-3-642-12032-9_8

F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Fast adaptive uniformization of the chemical master equation,” presented at the HIBI: High-Performance Computational Systems Biology, Trento, Italy, 2009, vol. 4, no. 6, pp. 118–127.
LibreCat: https://research-explorer.ista.ac.at/record/3843
DOI: 10.1109/HiBi.2009.23

T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” presented at the RP: Reachability Problems, Palaiseau, France, 2009, vol. 5797, pp. 3–23.
LibreCat: https://research-explorer.ista.ac.at/record/3841
DOI: 10.1007/978-3-642-04420-5_2

T. A. Henzinger, C. Kirsch, E. Marques, and A. Sokolova, “Distributed, modular HTL,” presented at the RTSS: Real-Time Systems Symposium, Washington, DC, United States, 2009, pp. 171–180.
LibreCat: https://research-explorer.ista.ac.at/record/3844
DOI: 10.1109/RTSS.2009.9

S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “On relational interfaces,” in EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded software, Grenoble, France, 2009, pp. 67–76.
LibreCat: https://research-explorer.ista.ac.at/record/3837
DOI: 10.1145/1629335.1629346

K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, Gist: A solver for probabilistic games. IST Austria, 2009.
LibreCat: https://research-explorer.ista.ac.at/record/5393
DOI: 10.15479/AT:IST-2009-0003

K. Chatterjee, T. A. Henzinger, and F. Horn, Improved lower bounds for request-response and finitary Streett games. IST Austria, 2009.
LibreCat: https://research-explorer.ista.ac.at/record/5394
DOI: 10.15479/AT:IST-2009-0002

K. Chatterjee, L. Doyen, and T. A. Henzinger, Qualitative analysis of partially-observable Markov decision processes. IST Austria, 2009.
LibreCat: https://research-explorer.ista.ac.at/record/5395
DOI: 10.15479/AT:IST-2009-0001