Wies, Thomas, et al. Combining Theories with Shared Set Operations. Springer, 2009, pp. 366–82, doi:1558.
LibreCat: https://research-explorer.ista.ac.at/record/4360
DOI: 1558

Singh, Vasu. “Formalizing and Verifying Transactional Memories.” Formalizing and Verifying Transactional Memories, EPFL Lausanne, 2009.
LibreCat: https://research-explorer.ista.ac.at/record/4363

Lahiri, Shuvendu, et al. Intra-Module Inference. Springer, 2009, pp. 493–508, doi:1555.
LibreCat: https://research-explorer.ista.ac.at/record/4375
DOI: 1555

Hoenicke, Jochen, et al. It’s Doomed; We Can Prove It. Springer, 2009, pp. 338–53, doi:1557.
LibreCat: https://research-explorer.ista.ac.at/record/4377
DOI: 1557

Guerraoui, Rachid, et al. Software Transactional Memory on Relaxed Memory Models. Vol. 5643, Springer, 2009, pp. 321–36, doi:10.1007/978-3-642-02658-4_26.
LibreCat: https://research-explorer.ista.ac.at/record/4383
DOI: 10.1007/978-3-642-02658-4_26

Dragojevic, Aleksandar, et al. Preventing versus Curing: Avoiding Conflicts in Transactional Memories. ACM, 2009, pp. 7–16, doi:1533.
LibreCat: https://research-explorer.ista.ac.at/record/4385
DOI: 1533

Lublinerman, Roberto, et al. Parallel Programming with Object Assemblies. ACM, 2009, pp. 61–80, doi:1546.
LibreCat: https://research-explorer.ista.ac.at/record/4376
DOI: 1546

Cerny, Pavol, and Rajeev Alur. Automated Analysis of Java Methods for Confidentiality. Springer, 2009, pp. 173–87, doi:1548.
LibreCat: https://research-explorer.ista.ac.at/record/4391
DOI: 1548

Alur, Rajeev, et al. Algorithmic Analysis of Array-Accessing Programs. Vol. 5771, Springer, 2009, pp. 86–101, doi:10.1007/978-3-642-04027-6_9.
LibreCat: https://research-explorer.ista.ac.at/record/4403
DOI: 10.1007/978-3-642-04027-6_9

Henzinger, Thomas A., et al. Sliding-Window Abstraction for Infinite Markov Chains. Vol. 5643, Springer, 2009, pp. 337–52, doi:10.1007/978-3-642-02658-4_27.
LibreCat: https://research-explorer.ista.ac.at/record/4453
DOI: 10.1007/978-3-642-02658-4_27

Didier, Frédéric, et al. Approximation of Event Probabilities in Noisy Cellular Processes. Vol. 5688, Springer, 2009, pp. 173–88, doi:10.1007/978-3-642-03845-7_12.
LibreCat: https://research-explorer.ista.ac.at/record/4535
DOI: 10.1007/978-3-642-03845-7_12

Chatterjee, Krishnendu, et al. Alternating Weighted Automata. Vol. 5699, Springer, 2009, pp. 3–13, doi:10.1007/978-3-642-03409-1_2.
LibreCat: https://research-explorer.ista.ac.at/record/4542
DOI: 10.1007/978-3-642-03409-1_2

Chatterjee, Krishnendu, et al. A Survey of Stochastic Games with Limsup and Liminf Objectives. Vol. 5556, Springer, 2009, pp. 1–15, doi:10.1007/978-3-642-02930-1_1.
LibreCat: https://research-explorer.ista.ac.at/record/4545
DOI: 10.1007/978-3-642-02930-1_1

Chatterjee, Krishnendu, et al. Stochastic Games with Finitary Objectives. Vol. 5734, Springer, 2009, pp. 34–54, doi:10.1007/978-3-642-03816-7_4.
LibreCat: https://research-explorer.ista.ac.at/record/4543
DOI: 10.1007/978-3-642-03816-7_4

Chatterjee, Krishnendu, et al. Termination Criteria for Solving Concurrent Safety and Reachability Games. SIAM, 2009, pp. 197–206, doi:10.1137/1.9781611973068.23.
LibreCat: https://research-explorer.ista.ac.at/record/4544
DOI: 10.1137/1.9781611973068.23

Chatterjee, Krishnendu, et al. Expressiveness and Closure Properties for Quantitative Languages. IEEE, 2009, pp. 199–208, doi:10.1109/LICS.2009.16.
LibreCat: https://research-explorer.ista.ac.at/record/4540
DOI: 10.1109/LICS.2009.16

Bloem, Roderick, et al. Better Quality in Synthesis through Quantitative Objectives. Vol. 5643, Springer, 2009, pp. 140–56, doi:10.1007/978-3-642-02658-4_14.
LibreCat: https://research-explorer.ista.ac.at/record/4569
DOI: 10.1007/978-3-642-02658-4_14
arXiv: 0904.2638

Berwanger, Dietmar, et al. Alpaga: A Tool for Solving Parity Games with Imperfect Information. Vol. 5505, Springer, 2009, pp. 58–61, doi:10.1007/978-3-642-00768-2_7.
LibreCat: https://research-explorer.ista.ac.at/record/4580
DOI: 10.1007/978-3-642-00768-2_7

Chatterjee, Krishnendu, et al. Gist: A Solver for Probabilistic Games. IST Austria, 2009, doi:10.15479/AT:IST-2009-0003.
LibreCat: https://research-explorer.ista.ac.at/record/5393
DOI: 10.15479/AT:IST-2009-0003

Chatterjee, Krishnendu, et al. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009, doi:10.15479/AT:IST-2009-0002.
LibreCat: https://research-explorer.ista.ac.at/record/5394
DOI: 10.15479/AT:IST-2009-0002