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 
LibreCat: https://research-explorer.ista.ac.at/record/1992
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1832
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1731
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1856
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1657
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1656
DOI: 10.1109/LICS.2015.72
arXiv: 1606.03598

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2015). Nested weighted automata. IST Austria.https://doi.org/10.15479/AT:IST-2015-170-v2-2 
LibreCat: https://research-explorer.ista.ac.at/record/5436
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1659
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1610
DOI: 10.1007/978-3-662-47666-6_10
arXiv: 1504.08259

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 
LibreCat: https://research-explorer.ista.ac.at/record/5439
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1502
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1501
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1689
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1729
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1835
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1603
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5549
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1392
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1393
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1702
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1869
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1872
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1870
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1875
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2027
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2026
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2053
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2056
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2187
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2190
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2233
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2239
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1733
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2038
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5411
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2217
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5417
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5416
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5415
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2218
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2167
DOI: 10.1109/ICST.2014.50
arXiv: 1904.07083

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 
LibreCat: https://research-explorer.ista.ac.at/record/2063
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5428
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/10898
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1385
DOI: 10.1109/FMCAD.2013.6679394
arXiv: 1308.4767

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 
LibreCat: https://research-explorer.ista.ac.at/record/1387
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2181
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2182
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2237
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2243
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2289
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2288
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2298
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2299
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2301
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2328
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2447
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2517
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2854
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2885
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5402
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1376
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5406
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2327
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/6440
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5747
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1405
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2847
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2445
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1384
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2302
DOI: 10.1109/TCBB.2012.91
PMID: 22778152

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 
LibreCat: https://research-explorer.ista.ac.at/record/2848
DOI: 10.1016/j.jtbi.2012.02.021
PMID: 22394652

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 
LibreCat: https://research-explorer.ista.ac.at/record/2891
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2890
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2888
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2916
DOI: 10.4204/EPTCS.96.3
arXiv: 1210.2450

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 
LibreCat: https://research-explorer.ista.ac.at/record/2936
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2942
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3136
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3162
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3253
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3168
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3846
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3128
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3155
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3836
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2967
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/494
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3249
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/10903
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/10906
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5745
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3251
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3264
DOI: 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.
LibreCat: https://research-explorer.ista.ac.at/record/3302

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.
LibreCat: https://research-explorer.ista.ac.at/record/3301

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 
LibreCat: https://research-explorer.ista.ac.at/record/3299
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3316
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3353
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3355
DOI: 10.1109/QEST.2011.40