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.

5658 Publications


2018 | Published | Technical Report | IST-REx-ID: 5457 | OA
Anonymous, 1, Anonymous, 2, Anonymous, 3, Anonymous, 4, Anonymous, 5, & Anonymous, 6. (2018). Cost analysis of nondeterministic probabilistic programs. IST Austria.
[Published Version] View | Files available
 

2018 | Published | Journal Article | IST-REx-ID: 608 | OA
Avni, G., & Kupferman, O. (2018). Synthesis from component libraries with costs. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2017.11.001
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 182 | OA
Bakhirkin, Alexey, Efficient parametric identification for STL. Proceedings of the 21st International Conference on Hybrid Systems. 2018
[Submitted Version] View | Files available | DOI | WoS
 

2018 | Conference Paper | IST-REx-ID: 5679 | OA
Huang, M., Fu, H., & Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer. https://doi.org/10.1007/978-3-030-02768-1_11
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 325 | OA
Agrawal, S., Chatterjee, K., & Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 142 | OA
Kong, H., Bartocci, E., & Henzinger, T. A. (2018). Reachable set over-approximation for nonlinear systems using piecewise barrier tubes (Vol. 10981, pp. 449–467). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96145-3_24
[Published Version] View | Files available | DOI | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 78 | OA
Bakhirkin, A., Ferrere, T., Nickovic, D., Maler, O., & Asarin, E. (2018). Online timed pattern matching using automata (Vol. 11022, pp. 215–232). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China: Springer. https://doi.org/10.1007/978-3-030-00151-3_13
[Submitted Version] View | Files available | DOI | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 5959 | OA
Bakhirkin, Alexey, Keynote: The first-order logic of signals. 2018 International Conference on Embedded Software. 2018
[Published Version] View | Files available | DOI | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 183
Bartocci, Ezio, Localizing faults in simulink/stateflow models with STL. 2018
View | DOI | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 160 | OA
Kragl, B., & Qadeer, S. (2018). Layered Concurrent Programs (Vol. 10981, pp. 79–102). Presented at the CAV: Computer Aided Verification, Oxford, UK: Springer. https://doi.org/10.1007/978-3-319-96145-3_5
[Published Version] View | Files available | DOI | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 156 | OA
Ferrere, Thomas, The compound interest in relaxing punctuality. 10951. 2018
[Submitted Version] View | Files available | DOI | WoS
 

2018 | Published | Journal Article | IST-REx-ID: 434
Jiang, Y., Liu, H., Song, H., Kong, H., Wang, R., Guan, Y., & Sha, L. (2018). Safety-assured model-driven design of the multifunction vehicle bus controller. IEEE Transactions on Intelligent Transportation Systems. IEEE. https://doi.org/10.1109/TITS.2017.2778077
View | Files available | DOI | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 140 | OA
Frehse, G., Giacobbe, M., & Henzinger, T. A. (2018). Space-time interpolants (Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96145-3_25
[Published Version] View | Files available | DOI | WoS
 

2018 | Conference Paper | IST-REx-ID: 5788 | OA
Avni, G., Henzinger, T. A., & Ibsen-Jensen, R. (2018). Infinite-duration poorman-bidding games (Vol. 11316, pp. 21–36). Presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK: Springer. https://doi.org/10.1007/978-3-030-04612-5_2
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 143 | OA
Brázdil, T., Chatterjee, K., Kučera, A., Novotný, P., Velan, D., & Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE. https://doi.org/10.1145/3209108.3209191
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 25 | OA
Horák, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/662
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 24 | OA
Chatterjee, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 310 | OA
Chatterjee, K., Dvorák, W., Henzinger, M., & Loitzenbauer, V. (2018). Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter (pp. 2341–2356). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States: ACM. https://doi.org/10.1137/1.9781611975031.151
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 35 | OA
Chatterjee, Krishnendu, Algorithms and conditional lower bounds for planning problems. 28th International Conference on Automated Planning and Scheduling . 2018
[Preprint] View | Files available | Download Preprint (ext.) | WoS | arXiv
 

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
 

Filters and Search Terms

extern<>1

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed