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. Springer, 2011, pp. 1–3, doi:10.1145/2037509.2037510.

Bloem, Roderick, et al. “Specification-Centered Robustness.”10.1109/SIES.2011.5953660__6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–85, doi:10.1109/SIES.2011.5953660.

Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.”10.1145/1985342.1985345__ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33, no. 4, 14, ACM, 2011, doi:10.1145/1985342.1985345.

Halalai, Raluca, et al. Quantitative Evaluation of BFT Protocols. IEEE, 2011, pp. 255–64, doi:10.1109/QEST.2011.40.

Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.”10.1145/1970398.1970404__ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4, 28, ACM, 2011, doi:10.1145/1970398.1970404.

Fisher, Jasmin, et al. “Biology as Reactivity.”10.1145/2001269.2001289__Communications of the ACM, vol. 54, no. 10, ACM, 2011, pp. 72–82, doi:10.1145/2001269.2001289.

Fisher, Jasmin, et al. Dynamic Reactive Modules. Vol. 6901, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–18, doi:10.1007/978-3-642-23217-6_27.

Chatterjee, Krishnendu, et al. QUASY: Quantitative Synthesis Tool. Vol. 6605, Springer, 2011, pp. 267–71, doi:10.1007/978-3-642-19835-9_24.

Chatterjee, Krishnendu, et al. The Decidability Frontier for Probabilistic Automata on Infinite Words. ArXiv.

Henzinger, Thomas A., et al. “Formalisms for Specifying Markovian Population Models.”10.1142/S0129054111008441__IJFCS: International Journal of Foundations of Computer Science, vol. 22, no. 4, World Scientific Publishing, 2011, pp. 823–41, doi:10.1142/S0129054111008441.

Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.”10.2168/LMCS-7(4:8)2011__Logical Methods in Computer Science, vol. 7, no. 4, International Federation of Computational Logic, 2011, doi:10.2168/LMCS-7(4:8)2011.

Almagor, Shaull, et al. What’s Decidable about Weighted Automata . Vol. 6996, Springer, 2011, pp. 482–91, doi:10.1007/978-3-642-24372-1_37.

Alur, Rajeev, and Pavol Cerny. Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs. Vol. 46, no. 1, ACM, 2011, pp. 599–610, doi:10.1145/1926385.1926454.

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

Boker, Udi, and Thomas A. Henzinger. Determinizing Discounted-Sum Automata. Vol. 12, Springer, 2011, pp. 82–96, doi:10.4230/LIPIcs.CSL.2011.82.

Cerny, Pavol, et al. The Complexity of Quantitative Information Flow Problems. IEEE, 2011, pp. 205–17, doi:10.1109/CSF.2011.21.

Henzinger, Thomas A., et al. Scheduling Large Jobs by Abstraction Refinement. ACM, 2011, pp. 329–42, doi:10.1145/1966445.1966476.

Cerny, Pavol, and Thomas A. Henzinger. From Boolean to Quantitative Synthesis. ACM, 2011, pp. 149–54, doi:10.1145/2038642.2038666.

Chatterjee, Krishnendu, et al. The Complexity of Request-Response Games. Edited by Adrian-Horia Dediu et al., vol. 6638, Springer, 2011, pp. 227–37, doi:10.1007/978-3-642-21254-3_17.

Didier, Frédéric, et al. “Approximation of Event Probabilities in Noisy Cellular Processes.”10.1016/j.tcs.2010.10.022__Theoretical Computer Science, vol. 412, no. 21, Elsevier, 2011, pp. 2128–41, doi:10.1016/j.tcs.2010.10.022.

Guerraoui, Rachid, et al. “Verification of STM on Relaxed Memory Models.”10.1007/s10703-011-0131-3__Formal Methods in System Design, vol. 39, no. 3, Springer, 2011, pp. 297–331, doi:10.1007/s10703-011-0131-3.

Boker, Udi, et al. Temporal Specifications with Accumulative Values. 5970226, IEEE, 2011, doi:10.1109/LICS.2011.33.

Boker, Udi, et al. Temporal Specifications with Accumulative Values. IST Austria, 2011, doi:10.15479/AT:IST-2011-0003.

Wies, Thomas, et al. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria, 2011, doi:10.15479/AT:IST-2011-0005.

Wies, Thomas, et al. An Efficient Decision Procedure for Imperative Tree Data Structures. Vol. 6803, Springer, 2011, pp. 476–91, doi:10.1007/978-3-642-22438-6_36.

Cerny, Pavol, et al. Quantitative Synthesis for Concurrent Programs. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 243–59, doi:10.1007/978-3-642-22110-1_20.

Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.”10.1007/978-3-642-17511-4_7__Logic for Programming, Artificial Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:10.1007/978-3-642-17511-4_7.

Feret, Jérôme, et al. Lumpability Abstractions of Rule-Based Systems. Vol. 40, Open Publishing Association, 2010, pp. 142–61.

Didier, Frédéric, et al. SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks. IEEE, 2010, pp. 193–94, doi:10.1109/QEST.2010.33.

Henzinger, Thomas A., et al. Aligators for Arrays. Vol. 6397, Springer, 2010, pp. 348–56, doi:10.1007/978-3-642-16242-8_25.

Didier, Frédéric, et al. “Fast Adaptive Uniformization of the Chemical Master Equation.”10.1049/iet-syb.2010.0005__IET Systems Biology, vol. 4, no. 6, Institution of Engineering and Technology, 2010, pp. 441–52, doi:10.1049/iet-syb.2010.0005.

Chatterjee, Krishnendu, et al. Randomness for Free. Vol. 6281, Springer, 2010, pp. 246–57, doi:10.1007/978-3-642-15155-2_23.

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

Bloem, Roderick, et al. Robustness in the Presence of Liveness. Edited by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:10.1007/978-3-642-14295-6_36.

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

Wolf, Verena, et al. “Solving the Chemical Master Equation Using Sliding Windows.”10.1186/1752-0509-4-42__BMC Systems Biology, vol. 4, no. 42, BioMed Central, 2010, pp. 1–19, doi:10.1186/1752-0509-4-42.

Henzinger, Thomas A. From Boolean to Quantitative Notions of Correctness. Vol. 45, no. 1, ACM, 2010, pp. 157–58, doi:10.1145/1706299.1706319.

Henzinger, Thomas A., et al. Invariant and Type Inference for Matrices. Vol. 5944, Springer, 2010, pp. 163–79, doi:10.1007/978-3-642-11319-2_14.

Henzinger, Thomas A., et al. Hybrid Numerical Solution of the Chemical Master Equation. Springer, 2010, pp. 55–65, doi:10.1145/1839764.1839772.

Chatterjee, Krishnendu, et al. Mean-Payoff Automaton Expressions. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:10.1007/978-3-642-15375-4_19.

Chatterjee, Krishnendu, et al. Generalized Mean-Payoff and Energy Games. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–16, doi:10.4230/LIPIcs.FSTTCS.2010.505.

Chatterjee, Krishnendu, et al. Measuring and Synthesizing Systems in Probabilistic Environments. Vol. 6174, Springer, 2010, pp. 380–95, doi:10.1007/978-3-642-14295-6_34.

Berwanger, Dietmar, et al. “Strategy Construction for Parity Games with Imperfect Information.”10.1016/j.ic.2009.09.006__Information and Computation, vol. 208, no. 10, Elsevier, 2010, pp. 1206–20, doi:10.1016/j.ic.2009.09.006.

Chatterjee, Krishnendu, et al. “Strategy Logic.”10.1016/j.ic.2009.07.004__Information and Computation, vol. 208, no. 6, Elsevier, 2010, pp. 677–93, doi:10.1016/j.ic.2009.07.004.

Singh, Vasu. Runtime Verification for Software Transactional Memories. Edited by Oleg Sokolsky et al., vol. 6418, Springer, 2010, pp. 421–35, doi:10.1007/978-3-642-16612-9_32.

Kuncak, Viktor, et al. Building a Calculus of Data Structures. Edited by Gilles Barthe and Manuel Hermenegildo, vol. 5944, Springer, 2010, pp. 26–44, doi:10.1007/978-3-642-11319-2_6.

Henzinger, Thomas A., et al. FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment. IEEE, 2010, pp. 83–90, doi:10.1109/CLOUD.2010.71.

Guerraoui, Rachid, et al. Transactions in the Jungle. ACM, 2010, pp. 263–72, doi:10.1145/1810479.1810529.

Henzinger, Thomas A., et al. A Marketplace for Cloud Resources. ACM, 2010, pp. 1–8, doi:10.1145/1879021.1879022.

Doyen, Laurent, et al. Robustness of Sequential Circuits. IEEE, 2010, pp. 77–84, doi:10.1109/ACSD.2010.26.

Cerny, Pavol, et al. “Quantitative Simulation Games.”10.1007/978-3-642-13754-9_3__Time For Verification: Essays in Memory of Amir Pnueli, edited by Zohar Manna and Doron Peled, vol. 6200, Springer, 2010, pp. 42–60, doi:10.1007/978-3-642-13754-9_3.

Beyer, Dirk, et al. Shape Refinement through Explicit Heap Analysis. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer, 2010, pp. 263–77, doi:10.1007/978-3-642-12029-9_19.

Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative Languages.”10.2168/LMCS-6(3:10)2010__Logical Methods in Computer Science, vol. 6, no. 3, International Federation of Computational Logic, 2010, pp. 1–23, doi:10.2168/LMCS-6(3:10)2010.

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

Hoenicke, Jochen, et al. “Doomed Program Points.”10.1007/s10703-010-0102-0__Formal Methods in System Design, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:10.1007/s10703-010-0102-0.

Cerny, Pavol, et al. Simulation Distances. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–68, doi:10.1007/978-3-642-15375-4_18.

Chatterjee, Krishnendu, et al. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010, doi:10.15479/AT:IST-2010-0004.

Cerny, Pavol, et al. Simulation Distances. IST Austria, 2010, doi:10.15479/AT:IST-2010-0003.

Cerny, Pavol, et al. Model Checking of Linearizability of Concurrent List Implementations. Vol. 6174, Springer, 2010, pp. 465–79, doi:10.1007/978-3-642-14295-6_41.

Chatterjee, Krishnendu, et al. GIST: A Solver for Probabilistic Games. Vol. 6174, Springer, 2010, pp. 665–69, doi:10.1007/978-3-642-14295-6_57.

Cerny, Pavol, et al. Model Checking of Linearizability of Concurrent List Implementations. IST Austria, 2010, doi:10.15479/AT:IST-2010-0001.

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

Chatterjee, Krishnendu, et al. Qualitative Analysis of Partially-Observable Markov Decision Processes. Vol. 6281, Springer, 2010, pp. 258–69, doi:10.1007/978-3-642-15155-2_24.

Wies, Thomas, et al. Forward Analysis of Depth-Bounded Processes. Edited by Luke Ong, vol. 6014, Springer, 2010, pp. 94–108, doi:10.1007/978-3-642-12032-9_8.

Didier, Frédéric, et al. Fast Adaptive Uniformization of the Chemical Master Equation. Vol. 4, no. 6, IEEE, 2009, pp. 118–27, doi:10.1109/HiBi.2009.23.

Henzinger, Thomas A., et al. Formalisms for Specifying Markovian Population Models. Vol. 5797, Springer, 2009, pp. 3–23, doi:10.1007/978-3-642-04420-5_2.

Henzinger, Thomas A., et al. Distributed, Modular HTL. IEEE, 2009, pp. 171–80, doi:10.1109/RTSS.2009.9.

Tripakis, Stavros, et al. “On Relational Interfaces.”10.1145/1629335.1629346__EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, ACM, 2009, pp. 67–76, doi:10.1145/1629335.1629346.

Chatterjee, Krishnendu, et al. Gist: A Solver for Probabilistic Games. IST Austria, 2009, 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.

Chatterjee, Krishnendu, et al. Qualitative Analysis of Partially-Observable Markov Decision Processes. IST Austria, 2009, doi:10.15479/AT:IST-2009-0001.