Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

406 Publications


2018 | Published | Conference Paper | IST-REx-ID: 182 | OA
Bakhirkin, A., Ferrere, T., & Maler, O. (2018). Efficient parametric identification for STL. In Proceedings of the 21st International Conference on Hybrid Systems (pp. 177–186). Porto, Portugal: ACM. https://doi.org/10.1145/3178126.3178132
[Submitted Version] View | Files available | DOI | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 297 | OA
Brázdil, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89960-2_21
[Published Version] View | Files available | DOI | WoS
 

2017 | Published | Thesis | IST-REx-ID: 1155 | OA
Daca, P. (2017). Statistical and logical methods for property checking. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_730
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 1003 | OA
Avni, G., Guha, S., & Kupferman, O. (2017). An abstraction-refinement methodology for reasoning about network games (pp. 70–76). Presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia: AAAI Press. https://doi.org/10.24963/ijcai.2017/11
[Submitted Version] View | Files available | DOI | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 1011 | OA
Chatterjee, K., Kragl, B., Mishra, S., & Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54434-1_11
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 10418 | OA
Mciver, A., Morgan, C., Kaminski, B. L., & Katoen, J. P. (2017). A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158121
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 1066
Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2017). Quantitative fair simulation games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2016.10.006
View | Files available | DOI | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
Avni, G., Henzinger, T. A., & Chonev, V. K. (2017). Infinite-duration bidding games (Vol. 85). Presented at the CONCUR: Concurrency Theory, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2017.21
[Published Version] View | Files available | DOI | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 962
Trinh, M., Chu, D. H., & Jaffar, J. (2017). Model counting for recursively-defined strings. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10427, pp. 399–418). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63390-9_21
View | DOI | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 963 | OA
Avni, G., Guha, S., & Kupferman, O. (2017). Timed network games with clocks (Vol. 83). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.37
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 941 | OA
Le, X., Chu, D. H., Lo, D., Le Goues, C., & Visser, W. (2017). JFIX: Semantics-based repair of Java programs via symbolic  PathFinder. In Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis (pp. 376–379). Santa Barbara, CA, United States: ACM. https://doi.org/10.1145/3092703.3098225
[Published Version] View | DOI | Download Published Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 942
Le, X., Chu, D. H., Lo, D., Le Goues, C., & Visser, W. (2017). S3: Syntax- and semantic-guided repair synthesis via programming by examples (Vol. F130154, pp. 593–604). Presented at the FSE: Foundations of Software Engineering, Paderborn, Germany: ACM. https://doi.org/10.1145/3106237.3106309
View | DOI | WoS
 

2017 | Published | Technical Report | IST-REx-ID: 6426 | OA
Henzinger, T. A., Kragl, B., & Qadeer, S. (2017). Synchronizing the asynchronous. IST Austria. https://doi.org/10.15479/AT:IST-2018-853-v2-2
[Published Version] View | Files available | DOI
 

2017 | Published | Journal Article | IST-REx-ID: 1338 | OA
Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., & Tarrach, T. (2017). From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-016-0256-5
[Published Version] View | Files available | DOI | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1351 | OA
Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., & Petrov, T. (2017). Model checking the evolution of gene regulatory networks. Acta Informatica. Springer. https://doi.org/10.1007/s00236-016-0278-x
[Published Version] View | Files available | DOI | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1407 | OA
Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., & Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier. https://doi.org/10.1016/j.nahs.2016.04.006
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 1116 | OA
Avni, G., Goel, S., Henzinger, T. A., & Rodríguez Navas, G. (2017). Computing scores of forwarding schemes in switched networks with probabilistic faults (Vol. 10206, pp. 169–187). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54580-5_10
[Submitted Version] View | Files available | DOI | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1196
Henzinger, T. A., & Otop, J. (2017). Model measuring for discrete and hybrid systems. Nonlinear Analysis: Hybrid Systems. Elsevier. https://doi.org/10.1016/j.nahs.2016.09.001
View | DOI | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 465 | OA
Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:23)2017
[Published Version] View | Files available | DOI
 

2017 | Published | Journal Article | IST-REx-ID: 467 | OA
Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3152769
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

department=ToHe

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed