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