Boker, U., &; Henzinger, T. A. (2014). Exact and approximate determinization of discounted-sum automata. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-10(1:10)2014 

Boker, U., Henzinger, T. A., &; Radhakrishna, A. (2014). Battery transition systems (Vol. 49, pp. 595–606). Presented at the POPL: Principles of Programming Languages, San Diego, USA: ACM.https://doi.org/10.1145/2535838.2535875 

Cerny, P., Chmelik, M., Henzinger, T. A., &; Radhakrishna, A. (2014). Interface simulation distances. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2014.08.019 

Boker, U., Chatterjee, K., Henzinger, T. A., &; Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/2629686 

Daca, P., Henzinger, T. A., Krenn, W., &; Nickovic, D. (2014). Compositional specifications for IOCO testing. IST Austria.https://doi.org/10.15479/AT:IST-2014-148-v2-1 

Henzinger, T. A., &; Otop, J. (2014). Model measuring for hybrid systems. In Proceedings of the 17th international conference on Hybrid systems: computation and control (pp. 213–222). Berlin, Germany: Springer.https://doi.org/10.1145/2562059.2562130 

Henzinger, T. A., &; Otop, J. (2014). From model checking to model measuring. IST Austria.https://doi.org/10.15479/AT:IST-2014-172-v1-1 

Henzinger, T. A., &; Otop, J. (2014). Model measuring for hybrid systems. IST Austria.https://doi.org/10.15479/AT:IST-2014-171-v1-1 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2014). Nested weighted automata. IST Austria.https://doi.org/10.15479/AT:IST-2014-170-v1-1 

Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., &; Tarrach, T. (2014). Regression-free synthesis for concurrency (Vol. 8559, pp. 568–584). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer.https://doi.org/10.1007/978-3-319-08867-9_38 

Daca, P., Henzinger, T. A., Krenn, W., &; Nickovic, D. (2014). Compositional specifications for IOCO testing. In IEEE 7th International Conference on Software Testing, Verification and Validation. Cleveland, USA: IEEE.https://doi.org/10.1109/ICST.2014.50 

Chatterjee, K., Chmelik, M., &; Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer.https://doi.org/10.1007/978-3-319-08867-9_31 

Chatterjee, K., Henzinger, T. A., Otop, J., &; Velner, Y. (2014). Quantitative fair simulation games. IST Austria.https://doi.org/10.15479/AT:IST-2014-315-v1-1 

Haas, A., Lippautz, M., Henzinger, T. A., Payer, H., Sokolova, A., Kirsch, C. M., &; Sezgin, A. (2013). Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. Ischia, Italy: ACM Press.https://doi.org/10.1145/2482767.2482789 

Hofferek, G., Gupta, A., Könighofer, B., Jiang, J., &; Bloem, R. (2013). Synthesizing multiple boolean functions using interpolation on a single proof. In 2013 Formal Methods in Computer-Aided Design (pp. 77–84). Portland, OR, United States: IEEE.https://doi.org/10.1109/FMCAD.2013.6679394 

Boker, U., Kuperberg, D., Kupferman, O., &; Skrzypczak, M. (2013). Nondeterminism in the presence of a diverse or unknown future. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer.https://doi.org/10.1007/978-3-642-39212-2_11 

Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., &; Sokolova, A. (2013). Quantitative relaxation of concurrent data structures. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language (pp. 317–328). Rome, Italy: ACM.https://doi.org/10.1145/2429069.2429109 

Cerny, P., Henzinger, T. A., &; Radhakrishna, A. (2013). Quantitative abstraction refinement. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language (pp. 115–128). Rome, Italy: ACM.https://doi.org/10.1145/2429069.2429085 

Blanc, R., Gupta, A., Kovács, L., &; Kragl, B. (2013). Tree interpolation in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer.https://doi.org/10.1007/978-3-642-45221-5_13 

Michaliszyn, J., &; Otop, J. (2013). Elementary modal logics over transitive structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CSL.2013.563 

Henzinger, T. A. (2013). Quantitative reactive modeling and verification. Computer Science Research and Development. Springer.https://doi.org/10.1007/s00450-013-0251-7 

Gupta, A., &; Henzinger, T. A. (Eds.). (2013). Computational Methods in Systems Biology (Vol. 8130). Presented at the CMSB: Computational Methods in Systems Biology, Klosterneuburg, Austria: Springer.https://doi.org/10.1007/978-3-642-40708-6 

Dragoi, C., Enea, C., &; Sighireanu, M. (2013). Local shape analysis for overlaid data structures (Vol. 7935, pp. 150–171). Presented at the SAS: Static Analysis Symposium, Seattle, WA, United States: Springer.https://doi.org/10.1007/978-3-642-38856-9_10 

Godhal, Y., Chatterjee, K., &; Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. Springer.https://doi.org/10.1007/s10009-011-0207-9 

Desai, A., Gupta, V., Jackson, E., Qadeer, S., Rajamani, S., &; Zufferey, D. (2013). P: Safe asynchronous event-driven programming. In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 321–331). Seattle, WA, United States: ACM.https://doi.org/10.1145/2491956.2462184 

Henzinger, T. A., Sezgin, A., &; Vafeiadis, V. (2013). Aspect-oriented linearizability proofs. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-642-40184-8_18 

Piskac, R., Wies, T., &; Zufferey, D. (2013). Automating separation logic using SMT. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer.https://doi.org/10.1007/978-3-642-39799-8_54 

Almagor, S., Boker, U., &; Kupferman, O. (2013). Formalizing and reasoning about quality. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer.https://doi.org/10.1007/978-3-642-39212-2_3 

Chatterjee, K., De Alfaro, L., &; Henzinger, T. A. (2013). Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2012.12.001 

Kucera, A., Henzinger, T. A., Nesetril, J., Vojnar, T., &; Antos, D. (Eds.). (2013). Mathematical and Engineering Methods in Computer Science (Vol. 7721, pp. 1–228). Presented at the MEMICS: Mathematical and Engineering methods in computer science, Znojmo, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-36046-6 

Henzinger, T. A., &; Sezgin, A. (2013). How free is your linearizable concurrent data structure? IST Austria.https://doi.org/10.15479/AT:IST-2013-123-v1-1 

Chatterjee, K., Henzinger, T. A., Otop, J., &; Pavlogiannis, A. (2013). Distributed synthesis for LTL fragments. In 13th International Conference on Formal Methods in Computer-Aided Design (pp. 18–25). Portland, OR, United States: IEEE.https://doi.org/10.1109/FMCAD.2013.6679386 

Chatterjee, K., Henzinger, T. A., Otop, J., &; Pavlogiannis, A. (2013). Distributed synthesis for LTL Fragments. IST Austria.https://doi.org/10.15479/AT:IST-2013-130-v1-1 

Henzinger, T. A., &; Otop, J. (2013). From model checking to model measuring. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Springer.https://doi.org/10.1007/978-3-642-40184-8_20 

Henzinger, T. A., Payer, H., &; Sezgin, A. (2013). Replacing competition with cooperation to achieve scalable lock-free FIFO queues . IST Austria.https://doi.org/10.15479/AT:IST-2013-124-v1-1 

Dragoi, C., Gupta, A., &; Henzinger, T. A. (2013). Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In Computer Aided Verification (Vol. 8044, pp. 174–190). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-39799-8_11 

Zufferey, D. (2013). Analysis of dynamic message passing programs. Institute of Science and Technology Austria.https://doi.org/10.15479/at:ista:1405 

Bansal, K., Koskinen, E., Wies, T., &; Zufferey, D. (2013). Structural Counter Abstraction. (N. Piterman &; S. Smolka, Eds.). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Rome, Italy: Springer.https://doi.org/10.1007/978-3-642-36742-7_5 

Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., &; Tarrach, T. (2013). Efficient synthesis for concurrency by semantics-preserving transformations (Vol. 8044, pp. 951–967). Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer.https://doi.org/10.1007/978-3-642-39799-8_68 

Beyer, D., Henzinger, T. A., Keremoglu, M., &; Wendler, P. (2012). Conditional model checking: A technique to pass information between verifiers. In Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering. Cary, NC, USA: ACM.https://doi.org/10.1145/2393596.2393664 

Henzinger, T. A., &; Mateescu, M. (2012). The propagation approach for computing biochemical reaction networks. IEEE ACM Transactions on Computational Biology and Bioinformatics. IEEE.https://doi.org/10.1109/TCBB.2012.91 

Chatterjee, K., Zufferey, D., &; Nowak, M. (2012). Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. Elsevier.https://doi.org/10.1016/j.jtbi.2012.02.021 

Boker, U., &; Henzinger, T. A. (2012). Approximate determinization of quantitative automata. In Leibniz International Proceedings in Informatics (Vol. 18, pp. 362–373). Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362 

Cerny, P., Gopi, S., Henzinger, T. A., Radhakrishna, A., &; Totla, N. (2012). Synthesis from incompatible specifications. In Proceedings of the tenth ACM international conference on Embedded software (pp. 53–62). Tampere, Finland: ACM.https://doi.org/10.1145/2380356.2380371 

Henzinger, T. A. (2012). Quantitative reactive models. In Conference proceedings MODELS 2012 (Vol. 7590, pp. 1–2). Innsbruck, Austria: Springer.https://doi.org/10.1007/978-3-642-33666-9_1 

Cerny, P., Chmelik, M., Henzinger, T. A., &; Radhakrishna, A. (2012). Interface Simulation Distances. In Electronic Proceedings in Theoretical Computer Science (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS.https://doi.org/10.4204/EPTCS.96.3 

Chatterjee, K., Henzinger, T. A., &; Prabhu, V. (2012). Finite automata with time delay blocks. In roceedings of the tenth ACM international conference on Embedded software (pp. 43–52). Tampere, Finland: ACM.https://doi.org/10.1145/2380356.2380370 

Henzinger, T. A., &; Nickovic, D. (2012). Independent implementability of viewpoints. In https://doi.org/10.1007/978-3-642-34059-8_20__Conference proceedings Monterey Workshop 2012 (Vol. 7539, pp. 380–395). Oxford, UK: Springer.https://doi.org/10.1007/978-3-642-34059-8_20 

Guet, C. C., Gupta, A., Henzinger, T. A., Mateescu, M., &; Sezgin, A. (2012). Delayed continuous time Markov chains for genetic regulatory circuits (Vol. 7358, pp. 294–309). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer.https://doi.org/10.1007/978-3-642-31424-7_24 

Asarin, E., Donzé, A., Maler, O., &; Nickovic, D. (2012). Parametric identification of temporal properties (Vol. 7186, pp. 147–160). Presented at the RV: Runtime Verification, San Francisco, CA, United States: Springer.https://doi.org/10.1007/978-3-642-29860-8_12 

Bouajjani, A., Dragoi, C., Enea, C., &; Sighireanu, M. (2012). Abstract domains for automated reasoning about list manipulating programs with infinite data (Vol. 7148, pp. 1–22). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer.https://doi.org/10.1007/978-3-642-27940-9_1 

Feret, J., Henzinger, T. A., Koeppl, H., &; Petrov, T. (2012). Lumpability abstractions of rule based systems. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2011.12.059 

Chatterjee, K., &; Henzinger, T. A. (2012). A survey of stochastic <9 regular games. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2011.05.002 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2012). A survey of partial-observation stochastic parity games. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-012-0164-2 

Delahaye, B., Fahrenberg, U., Henzinger, T. A., Legay, A., &; Nickovic, D. (2012). Synchronous interface theories and time triggered scheduling (Vol. 7273, pp. 203–218). Presented at the FORTE: Formal Techniques for Networked and Distributed Systems &; FMOODS: Formal Methods for Open Object-Based Distributed Systems , Stockholm, Sweden: Springer.https://doi.org/10.1007/978-3-642-30793-5_13 

Ghosal, A., Iercan, D., Kirsch, C., Henzinger, T. A., &; Sangiovanni Vincentelli, A. (2012). Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. Science of Computer Programming. Elsevier.https://doi.org/10.1016/j.scico.2010.06.004 

Alur, R., Cerny, P., &; Weinstein, S. (2012). Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/2287718.2287727 

Boker, U., &; Kupferman, O. (2012). Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/2362355.2362357 

Cerny, P., Henzinger, T. A., &; Radhakrishna, A. (2012). Simulation distances. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2011.08.002 

Bouajjani, A., Dragoi, C., Enea, C., &; Sighireanu, M. (2012). Accurate invariant checking for programs manipulating lists and arrays with infinite data. In Automated Technology for Verification and Analysis (Vol. 7561, pp. 167–182). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-33386-6_14 

Grebenshchikov, S., Gupta, A., Lopes, N. P., Popeea, C., &; Rybalchenko, A. (2012). HSF(C): A software verifier based on Horn clauses. In C. Flanagan &; B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems (Vol. 7214, pp. 549–551). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-28756-5_46 

Gupta, A. (2012). Improved Single Pass Algorithms for Resolution Proof Reduction. In Automated Technology for Verification and Analysis (Vol. 7561, pp. 107–121). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-33386-6_10 

Zufferey, D., Wies, T., &; Henzinger, T. A. (2012). Ideal abstractions for well structured transition systems (Vol. 7148, pp. 445–460). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer.https://doi.org/10.1007/978-3-642-27940-9_29 

Gupta, A., Popeea, C., &; Rybalchenko, A. (2011). Solving recursion-free Horn clauses over LI+UIF. In H. Yang (Ed.) (Vol. 7078, pp. 188–203). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan: Springer.https://doi.org/10.1007/978-3-642-25318-8_16 

Henzinger, T. A., Singh, A., Singh, V., Wies, T., &; Zufferey, D. (2011). Static scheduling in clouds (pp. 1–6). Presented at the HotCloud: Workshop on Hot Topics in Cloud Computing, USENIX.

Henzinger, T. A., &; Mateescu, M. (2011). Tail approximation for the chemical master equation. Presented at the WCSB: Workshop on Computational Systems Biology (TICSP), Tampere International Center for Signal Processing.

Henzinger, T. A., &; Mateescu, M. (2011). Propagation models for computing biochemical reaction networks (pp. 1–3). Presented at the CMSB: Computational Methods in Systems Biology, Paris, France: Springer.https://doi.org/10.1145/2037509.2037510 

Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., &; Jobstmann, B. (2011). Specification-centered robustness. In 6th IEEE International Symposium on Industrial and Embedded Systems (pp. 176–185). Vasteras, Sweden: IEEE.https://doi.org/10.1109/SIES.2011.5953660 

Tripakis, S., Lickly, B., Henzinger, T. A., &; Lee, E. (2011). A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). ACM.https://doi.org/10.1145/1985342.1985345 

Halalai, R., Henzinger, T. A., &; Singh, V. (2011). Quantitative evaluation of BFT protocols (pp. 255–264). Presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany: IEEE.https://doi.org/10.1109/QEST.2011.40 

Chatterjee, K., De Alfaro, L., &; Henzinger, T. A. (2011). Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/1970398.1970404 

Fisher, J., Harel, D., &; Henzinger, T. A. (2011). Biology as reactivity. Communications of the ACM. ACM.https://doi.org/10.1145/2001269.2001289 

Fisher, J., Henzinger, T. A., Nickovic, D., Piterman, N., Singh, A., &; Vardi, M. (2011). Dynamic reactive modules (Vol. 6901, pp. 404–418). Presented at the CONCUR: Concurrency Theory, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-642-23217-6_27 

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer.https://doi.org/10.1007/978-3-642-19835-9_24 

Chatterjee, K., Henzinger, T. A., &; Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.

Henzinger, T. A., Jobstmann, B., &; Wolf, V. (2011). Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. World Scientific Publishing.https://doi.org/10.1142/S0129054111008441 

Chatterjee, K., Henzinger, T. A., &; Prabhu, V. (2011). Timed parity games: Complexity and robustness. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-7(4:8)2011 

Almagor, S., Boker, U., &; Kupferman, O. (2011). What’s decidable about weighted automatahttps://doi.org/10.1007/978-3-642-24372-1_37__(Vol. 6996, pp. 482–491). Presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan: Springer.https://doi.org/10.1007/978-3-642-24372-1_37 

Alur, R., &; Cerny, P. (2011). Streaming transducers for algorithmic verification of single pass list processing programs (Vol. 46, pp. 599–610). Presented at the POPL: Principles of Programming Languages, Texas, USA: ACM.https://doi.org/10.1145/1926385.1926454 

Piskac, R., &; Wies, T. (2011). Decision procedures for automating termination proofs. In R. Jhala &; D. Schmidt (Eds.) (Vol. 6538, pp. 371–386). Presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA: Springer.https://doi.org/10.1007/978-3-642-18275-4_26 

Boker, U., &; Henzinger, T. A. (2011). Determinizing discounted-sum automata (Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway: Springer.https://doi.org/10.4230/LIPIcs.CSL.2011.82 

Cerny, P., Chatterjee, K., &; Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE.https://doi.org/10.1109/CSF.2011.21 

Henzinger, T. A., Singh, V., Wies, T., &; Zufferey, D. (2011). Scheduling large jobs by abstraction refinement (pp. 329–342). Presented at the EuroSys, Salzburg, Austria: ACM.https://doi.org/10.1145/1966445.1966476 

Cerny, P., &; Henzinger, T. A. (2011). From boolean to quantitative synthesis (pp. 149–154). Presented at the EMSOFT: Embedded Software , Taipei; Taiwan: ACM.https://doi.org/10.1145/2038642.2038666 

Chatterjee, K., Henzinger, T. A., &; Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, &; C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer.https://doi.org/10.1007/978-3-642-21254-3_17 

Didier, F., Henzinger, T. A., Mateescu, M., &; Wolf, V. (2011). Approximation of event probabilities in noisy cellular processes. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2010.10.022 

Guerraoui, R., Henzinger, T. A., &; Singh, V. (2011). Verification of STM on relaxed memory models. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-011-0131-3 

Boker, U., Chatterjee, K., Henzinger, T. A., &; Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE.https://doi.org/10.1109/LICS.2011.33 

Boker, U., Chatterjee, K., Henzinger, T. A., &; Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria.https://doi.org/10.15479/AT:IST-2011-0003 

Wies, T., Muñiz, M., &; Kuncak, V. (2011). On an efficient decision procedure for imperative tree data structures. IST Austria.https://doi.org/10.15479/AT:IST-2011-0005 

Wies, T., Muñiz, M., &; Kuncak, V. (2011). An efficient decision procedure for imperative tree data structures (Vol. 6803, pp. 476–491). Presented at the CADE 23: Automated Deduction , Wrocaw, Poland: Springer.https://doi.org/10.1007/978-3-642-22438-6_36 

Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., &; Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan &; S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer.https://doi.org/10.1007/978-3-642-22110-1_20 

Blanc, R., Henzinger, T. A., Hottelier, T., &; Kovács, L. (2010). ABC: Algebraic Bound Computation for loops. In E. M. Clarke &; A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (Vol. 6355, pp. 103–118). Berlin, Heidelberg: Springer Nature.https://doi.org/10.1007/978-3-642-17511-4_7 

Feret, J., Henzinger, T. A., Koeppl, H., &; Petrov, T. (2010). Lumpability abstractions of rule-based systems (Vol. 40, pp. 142–161). Presented at the MECBIC: Membrane Computing and Biologically Inspired Process Calculi, Jena, Germany: Open Publishing Association.

Didier, F., Henzinger, T. A., Mateescu, M., &; Wolf, V. (2010). SABRE: A tool for the stochastic analysis of biochemical reaction networks (pp. 193–194). Presented at the QEST: Quantitative Evaluation of Systems, Williamsburg, USA: IEEE.https://doi.org/10.1109/QEST.2010.33 

Henzinger, T. A., Hottelier, T., Kovács, L., &; Rybalchenko, A. (2010). Aligators for arrays (Vol. 6397, pp. 348–356). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer.https://doi.org/10.1007/978-3-642-16242-8_25 

Didier, F., Henzinger, T. A., Mateescu, M., &; Wolf, V. (2010). Fast adaptive uniformization of the chemical master equation. IET Systems Biology. Institution of Engineering and Technology.https://doi.org/10.1049/iet-syb.2010.0005 

Chatterjee, K., Doyen, L., Gimbert, H., &; Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-15155-2_23 

Chatterjee, K., &; Henzinger, T. A. (Eds.). (2010). Formal modeling and analysis of timed systems (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer.https://doi.org/10.1007/978-3-642-15297-9 

Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., &; Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, &; P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer.https://doi.org/10.1007/978-3-642-14295-6_36