Lahiri, S., Qadeer, S., Galeotti, J., Voung, J., &; Wies, T. (2009). Intra-module Inference (pp. 493–508). Presented at the CAV: Computer Aided Verification, Springer.https://doi.org/1555 

Hoenicke, J., Leino, K. R., Podelski, A., Schäf, M., &; Wies, T. (2009). It’s Doomed; We Can Prove It (pp. 338–353). Presented at the FM: Formal Methods, Springer.https://doi.org/1557 

Guerraoui, R., Henzinger, T. A., &; Singh, V. (2009). Software transactional memory on relaxed memory models (Vol. 5643, pp. 321–336). Presented at the CAV: Computer Aided Verification, Springer.https://doi.org/10.1007/978-3-642-02658-4_26 

Dragojevic, A., Guerraoui, R., Singh, A., &; Singh, V. (2009). Preventing versus curing: avoiding conflicts in transactional memories (pp. 7–16). Presented at the POPL: Principles of Programming Languages, ACM.https://doi.org/1533 

Lublinerman, R., Chaudhuri, S., &; Cerny, P. (2009). Parallel programming with object assemblies (pp. 61–80). Presented at the Oopsla Object Oriented Programming Systems Languages and Applications, ACM.https://doi.org/1546 

Cerny, P., &; Alur, R. (2009). Automated Analysis of Java Methods for Confidentiality (pp. 173–187). Presented at the CAV: Computer Aided Verification, Springer.https://doi.org/1548 

Alur, R., Cerny, P., &; Weinstein, S. (2009). Algorithmic analysis of array-accessing programs (Vol. 5771, pp. 86–101). Presented at the CSL: Computer Science Logic, Coimbra, Portugal: Springer.https://doi.org/10.1007/978-3-642-04027-6_9 

Henzinger, T. A., Mateescu, M., &; Wolf, V. (2009). Sliding-window abstraction for infinite Markov chains (Vol. 5643, pp. 337–352). Presented at the CAV: Computer Aided Verification, Springer.https://doi.org/10.1007/978-3-642-02658-4_27 

Didier, F., Henzinger, T. A., Mateescu, M., &; Wolf, V. (2009). Approximation of event probabilities in noisy cellular processes (Vol. 5688, pp. 173–188). Presented at the CMSB: Computational Methods in Systems Biology, Springer.https://doi.org/10.1007/978-3-642-03845-7_12 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2009). Alternating weighted automata (Vol. 5699, pp. 3–13). Presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland: Springer.https://doi.org/10.1007/978-3-642-03409-1_2 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2009). A survey of stochastic games with limsup and liminf objectives (Vol. 5556, pp. 1–15). Presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece: Springer.https://doi.org/10.1007/978-3-642-02930-1_1 

Chatterjee, K., Henzinger, T. A., &; Horn, F. (2009). Stochastic games with finitary objectives (Vol. 5734, pp. 34–54). Presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia: Springer.https://doi.org/10.1007/978-3-642-03816-7_4 

Chatterjee, K., De Alfaro, L., &; Henzinger, T. A. (2009). Termination criteria for solving concurrent safety and reachability games (pp. 197–206). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.https://doi.org/10.1137/1.9781611973068.23 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2009). Expressiveness and closure properties for quantitative languages (pp. 199–208). Presented at the LICS: Logic in Computer Science, IEEE.https://doi.org/10.1109/LICS.2009.16 

Bloem, R., Chatterjee, K., Henzinger, T. A., &; Jobstmann, B. (2009). Better quality in synthesis through quantitative objectives (Vol. 5643, pp. 140–156). Presented at the CAV: Computer Aided Verification, Grenoble, France: Springer.https://doi.org/10.1007/978-3-642-02658-4_14 

Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., &; Henzinger, T. A. (2009). Alpaga: A tool for solving parity games with imperfect information (Vol. 5505, pp. 58–61). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer.https://doi.org/10.1007/978-3-642-00768-2_7 

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Radhakrishna, A. (2009). Gist: A solver for probabilistic games. IST Austria.https://doi.org/10.15479/AT:IST-2009-0003 

Chatterjee, K., Henzinger, T. A., &; Horn, F. (2009). Improved lower bounds for request-response and finitary Streett games. IST Austria.https://doi.org/10.15479/AT:IST-2009-0002 

Chatterjee, K. (2009). Probabilistic automata on infinite words: Decidability and undecidability results. IST Austria.https://doi.org/10.15479/AT:IST-2009-0004 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2009). Qualitative analysis of partially-observable Markov decision processes. IST Austria.https://doi.org/10.15479/AT:IST-2009-0001