Daca, P., Henzinger, T. A., &; Kupriyanov, A. (2016). Array folds logic (Vol. 9780, pp. 230–248). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer.https://doi.org/10.1007/978-3-319-41540-6_13 

Jiang, Y., Liu, H., Song, H., Kong, H., Gu, M., Sun, J., &; Sha, L. (2016). Safety assured formal model driven design of the multifunction vehicle bus controller (Vol. 9995, pp. 757–763). Presented at the FM: International Symposium on Formal Methods, Limassol, Cyprus: Springer.https://doi.org/10.1007/978-3-319-48989-6_47 

Parise, F., Lygeros, J., &; Ruess, J. (2015). Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study. Frontiers in Environmental Science. Frontiers.https://doi.org/10.3389/fenvs.2015.00042 

Dragoi, C., Henzinger, T. A., &; Zufferey, D. (2015). The need for language support for fault-tolerant distributed systems. Presented at the SNAPL: Summit oN Advances in Programming Languages, Asilomar, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SNAPL.2015.90 

Kretinsky, J., Larsen, K., Laursen, S., &; Srba, J. (2015). Polynomial time decidability of weighted synchronization under partial observability (Vol. 42, pp. 142–154). Presented at the CONCUR: Concurrency Theory, Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2015.142 

Ruess, J. (2015). Minimal moment equations for stochastic models of biochemical reaction networks with partially finite state space. Journal of Chemical Physics. American Institute of Physics.https://doi.org/10.1063/1.4937937 

Ruess, J., Parise, F., Milias Argeitis, A., Khammash, M., &; Lygeros, J. (2015). Iterative experiment design guides the characterization of a light-inducible gene expression circuit. PNAS. National Academy of Sciences.https://doi.org/10.1073/pnas.1423947112 

Ray, R., Gurung, A., Das, B., Bartocci, E., Bogomolov, S., &; Grosu, R. (2015). XSpeed: Accelerating reachability analysis on multi-core processors. Presented at the HVC: Haifa Verification Conference, Haifa, Israel: Springer.https://doi.org/10.1007/978-3-319-26287-1_1 

Forejt, V., Krdál, J., &; Kretinsky, J. (2015). Controller synthesis for MDPs and frequency LTL\'47U (Vol. 9450, pp. 162–177). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Suva, Fiji: Springer.https://doi.org/10.1007/978-3-662-48899-7_12 

Babiak, T., Blahoudek, F., Duret Lutz, A., Klein, J., Kretinsky, J., Mueller, D.,https://doi.org/10.1007/978-3-319-21690-4_31__Strejdek, J. (2015). The Hanoi omega-automata format (Vol. 9206, pp. 479–486). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer.https://doi.org/10.1007/978-3-319-21690-4_31 

Bogomolov, S., Schilling, C., Bartocci, E., Batt, G., Kong, H., &; Grosu, R. (2015). Abstraction-based parameter synthesis for multiaffine systems (Vol. 9434, pp. 19–35). Presented at the HVC: Haifa Verification Conference, Haifa, Israel: Springer.https://doi.org/10.1007/978-3-319-26287-1_2 

Nguyen, L., Schilling, C., Bogomolov, S., &; Johnson, T. (2015). Runtime verification for hybrid analysis tools. In 6th International Conference (Vol. 9333, pp. 281–286). Vienna, Austria: Springer Nature.https://doi.org/10.1007/978-3-319-23820-3_19 

Bogomolov, S., Henzinger, T. A., Podelski, A., Ruess, J., &; Schilling, C. (2015). Adaptive moment closure for parameter inference of biochemical reaction networks. Presented at the CMSB: Computational Methods in Systems Biology, Nantes, France: Springer.https://doi.org/10.1007/978-3-319-23401-4_8 

Bogomolov, S., Magazzeni, D., Minopoli, S., &; Wehrle, M. (2015). PDDL+ planning with hybrid automata: Foundations of translating must behavior (pp. 42–46). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Jerusalem, Israel: AAAI Press.

Michaliszyn, J., Otop, J., &; Kieroski, E. (2015). On the decidability of elementary modal logics. ACM Transactions on Computational Logic. ACM.https://doi.org/10.1145/2817825 

Frehse, G., Bogomolov, S., Greitschus, M., Strump, T., &; Podelski, A. (2015). Eliminating spurious transitions in reachability with support functions. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 149–158). Seattle, WA, United States: ACM.https://doi.org/10.1145/2728606.2728622 

Bak, S., Bogomolov, S., &; Johnson, T. (2015). HYST: A source transformation and translation tool for hybrid automaton models (pp. 128–133). Presented at the HSCC: Hybrid Systems - Computation and Control, Seattle, WA, United States: Springer.https://doi.org/10.1145/2728606.2728630 

Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., &; Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.03.001 

Gupta, A., &; Henzinger, T. A. (2015). Guest editors’ introduction to special issue on computational methods in systems biology. ACM Transactions on Modeling and Computer Simulation. ACM.https://doi.org/10.1145/2745799 

Cerny, P., Henzinger, T. A., Kovács, L., Radhakrishna, A., &; Zwirchmayr, J. (2015). Segment abstraction for worst-case execution time analysis. Presented at the ESOP: European Symposium on Programming, London, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-46669-8_5 

Benes, N., Kretinsky, J., Larsen, K., Möller, M., Sickert, S., &; Srba, J. (2015). Refinement checking on parametric modal transition systems. Acta Informatica. Springer.https://doi.org/10.1007/s00236-015-0215-4 

Geiger, B., Petrov, T., Kubin, G., &; Koeppl, H. (2015). Optimal Kullback-Leibler aggregation via information bottleneck. IEEE Transactions on Automatic Control. IEEE.https://doi.org/10.1109/TAC.2014.2364971 

Ruess, J., &; Lygeros, J. (2015). Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. ACM Transactions on Modeling and Computer Simulation. ACM.https://doi.org/10.1145/2688906 

Henzinger, T. A., &; Raskin, J. (2015). The equivalence problem for finite automata: Technical perspective. Communications of the ACM. ACM.https://doi.org/10.1145/2701001 

Fahrenberg, U., Kretinsky, J., Legay, A., &; Traonouez, L. (2015). Compositionality for quantitative specifications (Vol. 8997, pp. 306–324). Presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy: Springer.https://doi.org/10.1007/978-3-319-15317-9_19 

Gupta, A., Henzinger, T. A., Radhakrishna, A., Samanta, R., &; Tarrach, T. (2015). Succinct representation of concurrent trace sets (pp. 433–444). Presented at the POPL: Principles of Programming Languages, Mumbai, India: ACM.https://doi.org/10.1145/2676726.2677008 

Chakraborty, S., Henzinger, T. A., Sezgin, A., &; Vafeiadis, V. (2015). Aspect-oriented linearizability proofs. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-11(1:20)2015 

Chatterjee, K., Doyen, L., Gimbert, H., &; Henzinger, T. A. (2015). Randomness for free. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.06.003 

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. ACM.https://doi.org/10.1145/2699430 

Chatterjee, K., Komárková, Z., &; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.32 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2015). Nested weighted automata. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.72 

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

Boker, U., Henzinger, T. A., &; Otop, J. (2015). The target discounted-sum problem. In LICS (pp. 750–761). Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.74 

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &; Otop, J. (2015). Edit distance for pushdown automata. In 42nd International Colloquium (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature.https://doi.org/10.1007/978-3-662-47666-6_10 

Boker, U., Henzinger, T. A., &; Otop, J. (2015). The target discounted-sum problem. IST Austria.https://doi.org/10.15479/AT:IST-2015-335-v1-1 

Benes, N., Daca, P., Henzinger, T. A., Kretinsky, J., &; Nickovic, D. (2015). Complete composition operators for IOCO-testing theory (pp. 101–110). Presented at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada: ACM.https://doi.org/10.1145/2737166.2737175 

Chatterjee, K., Chmelik, M., &; Daca, P. (2015). CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-015-0235-2 

Svoreová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cbrná, I., &; Belta, C. (2015). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 259–268). Seattle, WA, United States: ACM.https://doi.org/10.1145/2728606.2728608 

Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., &; Tarrach, T. (2015). From non-preemptive to preemptive scheduling using synchronization synthesis. Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer.https://doi.org/10.1007/978-3-319-21668-3_11 

Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., &; Petrov, T. (2015). Model checking gene regulatory networks. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-46681-0_47 

Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., &; Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer.https://doi.org/10.1007/978-3-319-21690-4_10 

Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:28 

Dragoi, C., Henzinger, T. A., Veith, H., Widder, J., &; Zufferey, D. (2014). A logic-based framework for verifying consensus algorithms (Vol. 8318, pp. 161–181). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, San Diego, USA: Springer.https://doi.org/10.1007/978-3-642-54013-4_10 

Gordon, A., Henzinger, T. A., Nori, A., &; Rajamani, S. (2014). Probabilistic programming. In Proceedings of the on Future of Software Engineering (pp. 167–181). Hyderabad, India: ACM.https://doi.org/10.1145/2593882.2593900 

Gupta, A., Popeea, C., &; Rybalchenko, A. (2014). Generalised interpolation by solving recursion free-horn clauses. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 169, pp. 31–38). Vienna, Austria: Open Publishing.https://doi.org/10.4204/EPTCS.169.5 

Hofferek, G., &; Gupta, A. (2014). Suraq - a controller synthesis tool using uninterpreted functions. In E. Yahav (Ed.), HVC 2014 (Vol. 8855, pp. 68–74). Haifa, Israel: Springer.https://doi.org/10.1007/978-3-319-13338-6_6 

Gupta, A., Kovács, L., Kragl, B., &; Voronkov, A. (2014). Extensional crisis and proving identity. In F. Cassez &; J.-F. Raskin (Eds.), ATVA 2014 (Vol. 8837, pp. 185–200). Sydney, Australia: Springer.https://doi.org/10.1007/978-3-319-11936-6_14 

Henzinger, T. A., Otop, J., &; Samanta, R. (2014). Lipschitz robustness of finite-state transducers. In Leibniz International Proceedings in Informatics, LIPIcs (Vol. 29, pp. 431–443). Delhi, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2014.431 

Samanta, R., Olivo, O., &; Allen, E. (2014). Cost-aware automatic program repair. In M. Müller-Olm &; H. Seidl (Eds.) (Vol. 8723, pp. 268–284). Presented at the SAS: Static Analysis Symposium, Munich, Germany: Springer.https://doi.org/10.1007/978-3-319-10936-7_17 

Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M.,https://doi.org/10.1007/978-3-319-11936-6_8__Ujma, M. (2014). Verification of markov decision processes using learning algorithms. In F. Cassez &; J.-F. Raskin (Eds.), https://doi.org/10.1007/978-3-319-11936-6_8__Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8837, pp. 98–114). Sydney, Australia: Society of Industrial and Applied Mathematics.https://doi.org/10.1007/978-3-319-11936-6_8 

Komárková, Z., &; Kretinsky, J. (2014). Rabinizer 3: Safraless translation of ltl to small deterministic automata. In F. Cassez &; J.-F. Raskin (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8837, pp. 235–241). Sydney, Australia: Springer.https://doi.org/10.1007/978-3-319-11936-6_17 

Hermanns, H., Krdál, J., &; Kretinsky, J. (2014). Probabilistic bisimulation: Naturally on distributions. In P. Baldan &; D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 249–265). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-662-44584-6_18 

Ganguly, A., Petrov, T., &; Koeppl, H. (2014). Markov chain aggregation and its applications to combinatorial reaction networks. Journal of Mathematical Biology. Springer.https://doi.org/10.1007/s00285-013-0738-7 

Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B.,https://doi.org/10.1007/s00236-013-0191-5__Könighofer, R. (2014). Synthesizing robust systems. Acta Informatica. Springer.https://doi.org/10.1007/s00236-013-0191-5 

Esparza, J., &; Kretinsky, J. (2014). From LTL to deterministic automata: A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the CAV: Computer Aided Verification, Springer.https://doi.org/10.1007/978-3-319-08867-9_13 

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