Almagor, Shaull, et al. Formalizing and Reasoning about Quality. Vol. 7966, no. Part 2, Springer, 2013, pp. 15–27, doi:10.1007/978-3-642-39212-2_3.

Chatterjee, Krishnendu, et al. “Strategy Improvement for Concurrent Reachability and Turn Based Stochastic Safety Games.”10.1016/j.jcss.2012.12.001__Journal of Computer and System Sciences, vol. 79, no. 5, Elsevier, 2013, pp. 640–57, doi:10.1016/j.jcss.2012.12.001.

Kucera, Antonin, et al., editors. Mathematical and Engineering Methods in Computer Science. Vol. 7721, Springer, 2013, pp. 1–228, doi:10.1007/978-3-642-36046-6.

Henzinger, Thomas A., and Ali Sezgin. How Free Is Your Linearizable Concurrent Data Structure? IST Austria, 2013, doi:10.15479/AT:IST-2013-123-v1-1.

Chatterjee, Krishnendu, et al. “Distributed Synthesis for LTL Fragments.”10.1109/FMCAD.2013.6679386__13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25, doi:10.1109/FMCAD.2013.6679386.

Chatterjee, Krishnendu, et al. Distributed Synthesis for LTL Fragments. IST Austria, 2013, doi:10.15479/AT:IST-2013-130-v1-1.

Henzinger, Thomas A., and Jan Otop. From Model Checking to Model Measuring. Vol. 8052, Springer, 2013, pp. 273–87, doi:10.1007/978-3-642-40184-8_20.

Henzinger, Thomas A., et al. Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues . IST Austria, 2013, doi:10.15479/AT:IST-2013-124-v1-1.

Dragoi, Cezara, et al. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.”10.1007/978-3-642-39799-8_11__Computer Aided Verification, vol. 8044, Springer Berlin Heidelberg, 2013, pp. 174–90, doi:10.1007/978-3-642-39799-8_11.

Zufferey, Damien. Analysis of Dynamic Message Passing Programs. Institute of Science and Technology Austria, 2013, doi:10.15479/at:ista:1405.

Bansal, Kshitij, et al. Structural Counter Abstraction. Edited by Nir Piterman and Scott Smolka, vol. 7795, Springer, 2013, pp. 62–77, doi:10.1007/978-3-642-36742-7_5.

Cerny, Pavol, et al. Efficient Synthesis for Concurrency by Semantics-Preserving Transformations. Vol. 8044, Springer, 2013, pp. 951–67, doi:10.1007/978-3-642-39799-8_68.

Beyer, Dirk, et al. “Conditional Model Checking: A Technique to Pass Information between Verifiers.”10.1145/2393596.2393664__Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, 57, ACM, 2012, doi:10.1145/2393596.2393664.

Henzinger, Thomas A., and Maria Mateescu. “The Propagation Approach for Computing Biochemical Reaction Networks.”10.1109/TCBB.2012.91__IEEE ACM Transactions on Computational Biology and Bioinformatics, vol. 10, no. 2, IEEE, 2012, pp. 310–22, doi:10.1109/TCBB.2012.91.

Chatterjee, Krishnendu, et al. “Evolutionary Game Dynamics in Populations with Different Learners.”10.1016/j.jtbi.2012.02.021__Journal of Theoretical Biology, vol. 301, Elsevier, 2012, pp. 161–73, doi:10.1016/j.jtbi.2012.02.021.

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

Cerny, Pavol, et al. “Synthesis from Incompatible Specifications.”10.1145/2380356.2380371__Proceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 53–62, doi:10.1145/2380356.2380371.

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

Cerny, Pavol, et al. “Interface Simulation Distances.”10.4204/EPTCS.96.3__Electronic Proceedings in Theoretical Computer Science, vol. 96, EPTCS, 2012, pp. 29–42, doi:10.4204/EPTCS.96.3.

Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.”10.1145/2380356.2380370__Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52, doi:10.1145/2380356.2380370.