Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
387 Publications
2018 | Conference Paper | IST-REx-ID: 24 | 
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 | Journal Article | IST-REx-ID: 6006 |
Avni, G., Guha, S., & Kupferman, O. (2018). An abstraction-refinement methodology for reasoning about network games. Games. MDPI AG. https://doi.org/10.3390/g9030039
[Published Version]
View
| Files available
| DOI
2018 | Journal Article | IST-REx-ID: 5677 |
Benveniste, A., Nickovic, D., Caillaud, B., Passerone, R., Raclet, J. B., Reinkemeier, P., … Larsen, K. G. (2018). Contracts for system design. Foundations and Trends in Electronic Design Automation. Now Publishers. https://doi.org/10.1561/1000000053
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Journal Article | IST-REx-ID: 10418 |
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 | Journal Article | IST-REx-ID: 471 |
Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2017). Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3060139
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)