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.
385 Publications
2017 |
Published |
Journal Article |
IST-REx-ID: 1407 |
M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2. Elsevier, pp. 230–253, 2017.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 |
Published |
Conference Paper |
IST-REx-ID: 941
X. Le, D. H. Chu, D. Lo, C. Le Goues, and W. Visser, “JFIX: Semantics-based repair of Java programs via symbolic PathFinder,” in Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, Santa Barbara, CA, United States, 2017, pp. 376–379.
View
| DOI
2017 |
Published |
Conference Paper |
IST-REx-ID: 942
X. Le, D. H. Chu, D. Lo, C. Le Goues, and W. Visser, “S3: Syntax- and semantic-guided repair synthesis via programming by examples,” presented at the FSE: Foundations of Software Engineering, Paderborn, Germany, 2017, vol. F130154, pp. 593–604.
View
| DOI
| WoS
2017 |
Published |
Conference Paper |
IST-REx-ID: 950 |
G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” presented at the CONCUR: Concurrency Theory, Berlin, Germany, 2017, vol. 85.
[Published Version]
View
| Files available
| DOI
| arXiv
2017 |
Published |
Conference Paper |
IST-REx-ID: 963 |
G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Aalborg, Denmark, 2017, vol. 83.
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Conference Paper |
IST-REx-ID: 1003 |
G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia, 2017, pp. 70–76.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 |
Published |
Conference Paper |
IST-REx-ID: 1011 |
K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 |
Published |
Journal Article |
IST-REx-ID: 10418 |
A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, “A new proof rule for almost-sure termination,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2016 |
Published |
Conference Paper |
IST-REx-ID: 1090 |
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted limit-average automata of bounded width,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland, 2016, vol. 58.
[Published Version]
View
| Files available
| DOI
2016 |
Published |
Conference Paper |
IST-REx-ID: 1093 |
P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Linear distances between Markov chains,” presented at the CONCUR: Concurrency Theory, Quebec City; Canada, 2016, vol. 59.
[Published Version]
View
| Files available
| DOI
2016 |
Published |
Conference Paper |
IST-REx-ID: 1095 |
A. Haas et al., “Local linearizability for concurrent container-type data structures,” in Leibniz International Proceedings in Informatics, Quebec City; Canada, 2016, vol. 59.
[Published Version]
View
| Files available
| DOI
2016 |
Published |
Conference Paper |
IST-REx-ID: 1103 |
A. Gurung, A. Deka, E. Bartocci, S. Bogomolov, R. Grosu, and R. Ray, “Parallel reachability analysis for hybrid systems,” presented at the MEMOCODE: International Conference on Formal Methods and Models for System Design, Kanpur, India , 2016.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 |
Published |
Thesis | PhD |
IST-REx-ID: 1130 |
T. Tarrach, “Automatic synthesis of synchronisation primitives for concurrent programs,” Institute of Science and Technology Austria, 2016.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2016 |
Published |
Conference Paper |
IST-REx-ID: 1135 |
G. Avni, S. Guha, and G. Rodríguez Navas, “Synthesizing time triggered schedules for switched networks with faulty links,” in Proceedings of the 13th International Conference on Embedded Software , Pittsburgh, PA, USA, 2016.
[Submitted Version]
View
| Files available
| DOI
2016 |
Published |
Conference Paper |
IST-REx-ID: 1138 |
K. Chatterjee, T. A. Henzinger, and J. Otop, “Quantitative automata under probabilistic semantics,” in Proceedings of the 31st Annual ACM/IEEE Symposium, New York, NY, USA, 2016, pp. 76–85.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2016 |
Published |
Journal Article |
IST-REx-ID: 1148
C. Schilling, S. Bogomolov, T. A. Henzinger, A. Podelski, and J. Ruess, “Adaptive moment closure for parameter inference of biochemical reaction networks,” Biosystems, vol. 149. Elsevier, pp. 15–25, 2016.
View
| Files available
| DOI
2016 |
Published |
Conference Paper |
IST-REx-ID: 1166
K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, AZ, USA, 2016, vol. 2016, pp. 3225–3232.
View
| Files available