Chatterjee, Krishnendu, Damien Zufferey, and Martin Nowak. “Evolutionary Game Dynamics in Populations with Different Learners.”https://doi.org/10.1016/j.jtbi.2012.02.021__Journal of Theoretical Biology. Elsevier, 2012.https://doi.org/10.1016/j.jtbi.2012.02.021 .

Boker, Udi, and Thomas A Henzinger. “Approximate Determinization of Quantitative Automata.”https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362__In Leibniz International Proceedings in Informatics, 18:362–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012.https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362 .

Cerny, Pavol, Sivakanth Gopi, Thomas A Henzinger, Arjun Radhakrishna, and Nishant Totla. “Synthesis from Incompatible Specifications.”https://doi.org/10.1145/2380356.2380371__In Proceedings of the Tenth ACM International Conference on Embedded Software, 53–62. ACM, 2012.https://doi.org/10.1145/2380356.2380371 .

Henzinger, Thomas A. “Quantitative Reactive Models.”https://doi.org/10.1007/978-3-642-33666-9_1__In Conference Proceedings MODELS 2012, 7590:1–2. Springer, 2012.https://doi.org/10.1007/978-3-642-33666-9_1 .

Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.”https://doi.org/10.4204/EPTCS.96.3__In Electronic Proceedings in Theoretical Computer Science, 96:29–42. EPTCS, 2012.https://doi.org/10.4204/EPTCS.96.3 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.”https://doi.org/10.1145/2380356.2380370__In Roceedings of the Tenth ACM International Conference on Embedded Software, 43–52. ACM, 2012.https://doi.org/10.1145/2380356.2380370 .

Henzinger, Thomas A, and Dejan Nickovic. “Independent Implementability of Viewpoints.”https://doi.org/10.1007/978-3-642-34059-8_20__In https://doi.org/10.1007/978-3-642-34059-8_20__Conference Proceedings Monterey Workshop 2012, 7539:380–95. Springer, 2012.https://doi.org/10.1007/978-3-642-34059-8_20 .

Guet, Calin C, Ashutosh Gupta, Thomas A Henzinger, Maria Mateescu, and Ali Sezgin. “Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits,”https://doi.org/10.1007/978-3-642-31424-7_24__7358:294–309. Springer, 2012.https://doi.org/10.1007/978-3-642-31424-7_24 .

Asarin, Eugene, Alexandre Donzé, Oded Maler, and Dejan Nickovic. “Parametric Identification of Temporal Properties,”https://doi.org/10.1007/978-3-642-29860-8_12__7186:147–60. Springer, 2012.https://doi.org/10.1007/978-3-642-29860-8_12 .

Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data,”https://doi.org/10.1007/978-3-642-27940-9_1__7148:1–22. Springer, 2012.https://doi.org/10.1007/978-3-642-27940-9_1 .

Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule Based Systems.”https://doi.org/10.1016/j.tcs.2011.12.059__Theoretical Computer Science. Elsevier, 2012.https://doi.org/10.1016/j.tcs.2011.12.059 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic <9 Regular Games.”https://doi.org/10.1016/j.jcss.2011.05.002__Journal of Computer and System Sciences. Elsevier, 2012.https://doi.org/10.1016/j.jcss.2011.05.002 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Partial-Observation Stochastic Parity Games.”https://doi.org/10.1007/s10703-012-0164-2__Formal Methods in System Design. Springer, 2012.https://doi.org/10.1007/s10703-012-0164-2 .

Delahaye, Benoît, Uli Fahrenberg, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Synchronous Interface Theories and Time Triggered Scheduling,”https://doi.org/10.1007/978-3-642-30793-5_13__7273:203–18. Springer, 2012.https://doi.org/10.1007/978-3-642-30793-5_13 .

Ghosal, Arkadeb, Daniel Iercan, Christoph Kirsch, Thomas A Henzinger, and Alberto Sangiovanni Vincentelli. “Separate Compilation of Hierarchical Real-Time Programs into Linear-Bounded Embedded Machine Code.”https://doi.org/10.1016/j.scico.2010.06.004__Science of Computer Programming. Elsevier, 2012.https://doi.org/10.1016/j.scico.2010.06.004 .

Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs.”https://doi.org/10.1145/2287718.2287727__ACM Transactions on Computational Logic (TOCL). ACM, 2012.https://doi.org/10.1145/2287718.2287727 .

Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.”https://doi.org/10.1145/2362355.2362357__ACM Transactions on Computational Logic (TOCL). ACM, 2012.https://doi.org/10.1145/2362355.2362357 .

Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances.”https://doi.org/10.1016/j.tcs.2011.08.002__Theoretical Computer Science. Elsevier, 2012.https://doi.org/10.1016/j.tcs.2011.08.002 .

Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.”https://doi.org/10.1007/978-3-642-33386-6_14__In Automated Technology for Verification and Analysis, 7561:167–82. LNCS. Berlin, Heidelberg: Springer, 2012.https://doi.org/10.1007/978-3-642-33386-6_14 .

Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.”https://doi.org/10.1007/978-3-642-28756-5_46__In Tools and Algorithms for the Construction and Analysis of Systems, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012.https://doi.org/10.1007/978-3-642-28756-5_46 .

Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.”https://doi.org/10.1007/978-3-642-33386-6_10__In Automated Technology for Verification and Analysis, 7561:107–21. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.https://doi.org/10.1007/978-3-642-33386-6_10 .

Zufferey, Damien, Thomas Wies, and Thomas A Henzinger. “Ideal Abstractions for Well Structured Transition Systems,”https://doi.org/10.1007/978-3-642-27940-9_29__7148:445–60. Springer, 2012.https://doi.org/10.1007/978-3-642-27940-9_29 .

Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Solving Recursion-Free Horn Clauses over LI+UIF.”https://doi.org/10.1007/978-3-642-25318-8_16__edited by Hongseok Yang, 7078:188–203. Springer, 2011.https://doi.org/10.1007/978-3-642-25318-8_16 .

Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey. “Static Scheduling in Clouds,” 1–6. USENIX, 2011.

Henzinger, Thomas A, and Maria Mateescu. “Tail Approximation for the Chemical Master Equation.” Tampere International Center for Signal Processing, 2011.

Henzinger, Thomas A, and Maria Mateescu. “Propagation Models for Computing Biochemical Reaction Networks,”https://doi.org/10.1145/2037509.2037510__1–3. Springer, 2011.https://doi.org/10.1145/2037509.2037510 .

Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Specification-Centered Robustness.”https://doi.org/10.1109/SIES.2011.5953660__In 6th IEEE International Symposium on Industrial and Embedded Systems, 176–85. IEEE, 2011.https://doi.org/10.1109/SIES.2011.5953660 .

Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.”https://doi.org/10.1145/1985342.1985345__ACM Transactions on Programming Languages and Systems (TOPLAS). ACM, 2011.https://doi.org/10.1145/1985342.1985345 .

Halalai, Raluca, Thomas A Henzinger, and Vasu Singh. “Quantitative Evaluation of BFT Protocols,”https://doi.org/10.1109/QEST.2011.40__255–64. IEEE, 2011.https://doi.org/10.1109/QEST.2011.40 .

Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.”https://doi.org/10.1145/1970398.1970404__ACM Transactions on Computational Logic (TOCL). ACM, 2011.https://doi.org/10.1145/1970398.1970404 .

Fisher, Jasmin, David Harel, and Thomas A Henzinger. “Biology as Reactivity.”https://doi.org/10.1145/2001269.2001289__Communications of the ACM. ACM, 2011.https://doi.org/10.1145/2001269.2001289 .

Fisher, Jasmin, Thomas A Henzinger, Dejan Nickovic, Nir Piterman, Anmol Singh, and Moshe Vardi. “Dynamic Reactive Modules,”https://doi.org/10.1007/978-3-642-23217-6_27__6901:404–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011.https://doi.org/10.1007/978-3-642-23217-6_27 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,”https://doi.org/10.1007/978-3-642-19835-9_24__6605:267–71. Springer, 2011.https://doi.org/10.1007/978-3-642-19835-9_24 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.

Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models.”https://doi.org/10.1142/S0129054111008441__IJFCS: International Journal of Foundations of Computer Science. World Scientific Publishing, 2011.https://doi.org/10.1142/S0129054111008441 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.”https://doi.org/10.2168/LMCS-7(4:8)2011__Logical Methods in Computer Science. International Federation of Computational Logic, 2011.https://doi.org/10.2168/LMCS-7(4:8)2011 .

Almagor, Shaull, Udi Boker, and Orna Kupferman. “What’s Decidable about Weighted Automata ,”https://doi.org/10.1007/978-3-642-24372-1_37__6996:482–91. Springer, 2011.https://doi.org/10.1007/978-3-642-24372-1_37 .

Alur, Rajeev, and Pavol Cerny. “Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs,”https://doi.org/10.1145/1926385.1926454__46:599–610. ACM, 2011.https://doi.org/10.1145/1926385.1926454 .

Piskac, Ruzica, and Thomas Wies. “Decision Procedures for Automating Termination Proofs.”https://doi.org/10.1007/978-3-642-18275-4_26__edited by Ranjit Jhala and David Schmidt, 6538:371–86. Springer, 2011.https://doi.org/10.1007/978-3-642-18275-4_26 .

Boker, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,”https://doi.org/10.4230/LIPIcs.CSL.2011.82__12:82–96. Springer, 2011.https://doi.org/10.4230/LIPIcs.CSL.2011.82 .

Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,”https://doi.org/10.1109/CSF.2011.21__205–17. IEEE, 2011.https://doi.org/10.1109/CSF.2011.21 .

Henzinger, Thomas A, Vasu Singh, Thomas Wies, and Damien Zufferey. “Scheduling Large Jobs by Abstraction Refinement,”https://doi.org/10.1145/1966445.1966476__329–42. ACM, 2011.https://doi.org/10.1145/1966445.1966476 .

Cerny, Pavol, and Thomas A Henzinger. “From Boolean to Quantitative Synthesis,”https://doi.org/10.1145/2038642.2038666__149–54. ACM, 2011.https://doi.org/10.1145/2038642.2038666 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.”https://doi.org/10.1007/978-3-642-21254-3_17__edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011.https://doi.org/10.1007/978-3-642-21254-3_17 .

Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Approximation of Event Probabilities in Noisy Cellular Processes.”https://doi.org/10.1016/j.tcs.2010.10.022__Theoretical Computer Science. Elsevier, 2011.https://doi.org/10.1016/j.tcs.2010.10.022 .

Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Verification of STM on Relaxed Memory Models.”https://doi.org/10.1007/s10703-011-0131-3__Formal Methods in System Design. Springer, 2011.https://doi.org/10.1007/s10703-011-0131-3 .

Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.”https://doi.org/10.1109/LICS.2011.33__IEEE, 2011.https://doi.org/10.1109/LICS.2011.33 .

Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0003 .

Wies, Thomas, Marco Muñiz, and Viktor Kuncak. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0005 .

Wies, Thomas, Marco Muñiz, and Viktor Kuncak. “An Efficient Decision Procedure for Imperative Tree Data Structures,”https://doi.org/10.1007/978-3-642-22438-6_36__6803:476–91. Springer, 2011.https://doi.org/10.1007/978-3-642-22438-6_36 .

Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.”https://doi.org/10.1007/978-3-642-22110-1_20__edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011.https://doi.org/10.1007/978-3-642-22110-1_20 .

Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács. “ABC: Algebraic Bound Computation for Loops.”https://doi.org/10.1007/978-3-642-17511-4_7__In Logic for Programming, Artificial Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov, 6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010.https://doi.org/10.1007/978-3-642-17511-4_7 .

Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule-Based Systems,” 40:142–61. Open Publishing Association, 2010.

Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks,”https://doi.org/10.1109/QEST.2010.33__193–94. IEEE, 2010.https://doi.org/10.1109/QEST.2010.33 .

Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrey Rybalchenko. “Aligators for Arrays,”https://doi.org/10.1007/978-3-642-16242-8_25__6397:348–56. Springer, 2010.https://doi.org/10.1007/978-3-642-16242-8_25 .

Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Fast Adaptive Uniformization of the Chemical Master Equation.”https://doi.org/10.1049/iet-syb.2010.0005__IET Systems Biology. Institution of Engineering and Technology, 2010.https://doi.org/10.1049/iet-syb.2010.0005 .

Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free,”https://doi.org/10.1007/978-3-642-15155-2_23__6281:246–57. Springer, 2010.https://doi.org/10.1007/978-3-642-15155-2_23 .

Chatterjee, Krishnendu, and Thomas A Henzinger, eds. Formal Modeling and Analysis of Timed Systems. Vol. 6246. Springer, 2010.https://doi.org/10.1007/978-3-642-15297-9 .

Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Robustness in the Presence of Liveness.”https://doi.org/10.1007/978-3-642-14295-6_36__edited by Tayssir Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_36 .

Nickovic, Dejan, and Nir Piterman. “From MTL to Deterministic Timed Automata.”https://doi.org/10.1007/978-3-642-15297-9_13__edited by Thomas A. Henzinger and Krishnendu Chatterjee, 6246:152–67. Springer, 2010.https://doi.org/10.1007/978-3-642-15297-9_13 .

Wolf, Verena, Rushil Goel, Maria Mateescu, and Thomas A Henzinger. “Solving the Chemical Master Equation Using Sliding Windows.”https://doi.org/10.1186/1752-0509-4-42__BMC Systems Biology. BioMed Central, 2010.https://doi.org/10.1186/1752-0509-4-42 .

Henzinger, Thomas A. “From Boolean to Quantitative Notions of Correctness,”https://doi.org/10.1145/1706299.1706319__45:157–58. ACM, 2010.https://doi.org/10.1145/1706299.1706319 .

Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrei Voronkov. “Invariant and Type Inference for Matrices,”https://doi.org/10.1007/978-3-642-11319-2_14__5944:163–79. Springer, 2010.https://doi.org/10.1007/978-3-642-11319-2_14 .

Henzinger, Thomas A, Maria Mateescu, Linar Mikeev, and Verena Wolf. “Hybrid Numerical Solution of the Chemical Master Equation,”https://doi.org/10.1145/1839764.1839772__55–65. Springer, 2010.https://doi.org/10.1145/1839764.1839772 .

Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,”https://doi.org/10.1007/978-3-642-15375-4_19__6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.1007/978-3-642-15375-4_19 .

Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Generalized Mean-Payoff and Energy Games,”https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505__8:505–16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,”https://doi.org/10.1007/978-3-642-14295-6_34__6174:380–95. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_34 .

Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect Information.”https://doi.org/10.1016/j.ic.2009.09.006__Information and Computation. Elsevier, 2010.https://doi.org/10.1016/j.ic.2009.09.006 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic.”https://doi.org/10.1016/j.ic.2009.07.004__Information and Computation. Elsevier, 2010.https://doi.org/10.1016/j.ic.2009.07.004 .

Singh, Vasu. “Runtime Verification for Software Transactional Memories.”https://doi.org/10.1007/978-3-642-16612-9_32__edited by Oleg Sokolsky, Grigore Rosu, Nikolai Tilmann, Howard Barringer, Ylies Falcone, Bernd Finkbeiner, Klaus Havelund, Insup Lee, and Gordon Pace, 6418:421–35. Springer, 2010.https://doi.org/10.1007/978-3-642-16612-9_32 .

Kuncak, Viktor, Ruzica Piskac, Philippe Suter, and Thomas Wies. “Building a Calculus of Data Structures.”https://doi.org/10.1007/978-3-642-11319-2_6__edited by Gilles Barthe and Manuel Hermenegildo, 5944:26–44. Springer, 2010.https://doi.org/10.1007/978-3-642-11319-2_6 .

Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment,”https://doi.org/10.1109/CLOUD.2010.71__83–90. IEEE, 2010.https://doi.org/10.1109/CLOUD.2010.71 .

Guerraoui, Rachid, Thomas A Henzinger, Michal Kapalka, and Vasu Singh. “Transactions in the Jungle,”https://doi.org/10.1145/1810479.1810529__263–72. ACM, 2010.https://doi.org/10.1145/1810479.1810529 .

Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “A Marketplace for Cloud Resources,”https://doi.org/10.1145/1879021.1879022__1–8. ACM, 2010.https://doi.org/10.1145/1879021.1879022 .

Doyen, Laurent, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Robustness of Sequential Circuits,”https://doi.org/10.1109/ACSD.2010.26__77–84. IEEE, 2010.https://doi.org/10.1109/ACSD.2010.26 .

Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Simulation Games.”https://doi.org/10.1007/978-3-642-13754-9_3__In Time For Verification: Essays in Memory of Amir Pnueli, edited by Zohar Manna and Doron Peled, 6200:42–60. Essays in Memory of Amir Pnueli. Springer, 2010.https://doi.org/10.1007/978-3-642-13754-9_3 .

Beyer, Dirk, Thomas A Henzinger, Grégory Théoduloz, and Damien Zufferey. “Shape Refinement through Explicit Heap Analysis.”https://doi.org/10.1007/978-3-642-12029-9_19__edited by David Rosenblum and Gabriele Taenzer, 6013:263–77. Springer, 2010.https://doi.org/10.1007/978-3-642-12029-9_19 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.”https://doi.org/10.2168/LMCS-6(3:10)2010__Logical Methods in Computer Science. International Federation of Computational Logic, 2010.https://doi.org/10.2168/LMCS-6(3:10)2010 .

Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,”https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1__8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1 .

Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.”https://doi.org/10.1007/s10703-010-0102-0__Formal Methods in System Design. Springer, 2010.https://doi.org/10.1007/s10703-010-0102-0 .

Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances,”https://doi.org/10.1007/978-3-642-15375-4_18__6269:235–68. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.1007/978-3-642-15375-4_18 .

Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010.https://doi.org/10.15479/AT:IST-2010-0004 .

Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. Simulation Distances. IST Austria, 2010.https://doi.org/10.15479/AT:IST-2010-0003 .

Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. “Model Checking of Linearizability of Concurrent List Implementations,”https://doi.org/10.1007/978-3-642-14295-6_41__6174:465–79. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_41 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,”https://doi.org/10.1007/978-3-642-14295-6_57__6174:665–69. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_57 .

Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. Model Checking of Linearizability of Concurrent List Implementations. IST Austria, 2010.https://doi.org/10.15479/AT:IST-2010-0001 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Automata on Infinite Words: Decidability and Undecidability Results,”https://doi.org/10.1007/978-3-642-15643-4_1__6252:1–16. Springer, 2010.https://doi.org/10.1007/978-3-642-15643-4_1 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Qualitative Analysis of Partially-Observable Markov Decision Processes,”https://doi.org/10.1007/978-3-642-15155-2_24__6281:258–69. Springer, 2010.https://doi.org/10.1007/978-3-642-15155-2_24 .

Wies, Thomas, Damien Zufferey, and Thomas A Henzinger. “Forward Analysis of Depth-Bounded Processes.”https://doi.org/10.1007/978-3-642-12032-9_8__edited by Luke Ong, 6014:94–108. Springer, 2010.https://doi.org/10.1007/978-3-642-12032-9_8 .

Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Fast Adaptive Uniformization of the Chemical Master Equation,”https://doi.org/10.1109/HiBi.2009.23__4:118–27. IEEE, 2009.https://doi.org/10.1109/HiBi.2009.23 .

Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models,”https://doi.org/10.1007/978-3-642-04420-5_2__5797:3–23. Springer, 2009.https://doi.org/10.1007/978-3-642-04420-5_2 .

Henzinger, Thomas A, Christoph Kirsch, Eduardo Marques, and Ana Sokolova. “Distributed, Modular HTL,”https://doi.org/10.1109/RTSS.2009.9__171–80. IEEE, 2009.https://doi.org/10.1109/RTSS.2009.9 .

Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “On Relational Interfaces.”https://doi.org/10.1145/1629335.1629346__In EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, 67–76. ACM, 2009.https://doi.org/10.1145/1629335.1629346 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. Gist: A Solver for Probabilistic Games. IST Austria, 2009.https://doi.org/10.15479/AT:IST-2009-0003 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009.https://doi.org/10.15479/AT:IST-2009-0002 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. Qualitative Analysis of Partially-Observable Markov Decision Processes. IST Austria, 2009.https://doi.org/10.15479/AT:IST-2009-0001 .