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.
385 Publications
2017 |
Published |
Journal Article |
IST-REx-ID: 1407 |
Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2, Elsevier, 2017, pp. 230–53, doi:10.1016/j.nahs.2016.04.006.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 |
Published |
Conference Paper |
IST-REx-ID: 941
Le, Xuan, et al. “JFIX: Semantics-Based Repair of Java Programs via Symbolic PathFinder.” Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, ACM, 2017, pp. 376–79, doi:10.1145/3092703.3098225.
View
| DOI
2017 |
Published |
Conference Paper |
IST-REx-ID: 942
Le, Xuan, et al. S3: Syntax- and Semantic-Guided Repair Synthesis via Programming by Examples. Vol. F130154, ACM, 2017, pp. 593–604, doi:10.1145/3106237.3106309.
View
| DOI
| WoS
2017 |
Published |
Conference Paper |
IST-REx-ID: 950 |
Avni, Guy, et al. Infinite-Duration Bidding Games. Vol. 85, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.21.
[Published Version]
View
| Files available
| DOI
| arXiv
2017 |
Published |
Conference Paper |
IST-REx-ID: 962
Trinh, Minh, et al. Model Counting for Recursively-Defined Strings. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10427, Springer, 2017, pp. 399–418, doi:10.1007/978-3-319-63390-9_21.
View
| DOI
| WoS
2017 |
Published |
Conference Paper |
IST-REx-ID: 963 |
Avni, Guy, et al. Timed Network Games with Clocks. Vol. 83, 37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.37.
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Conference Paper |
IST-REx-ID: 1003 |
Avni, Guy, et al. An Abstraction-Refinement Methodology for Reasoning about Network Games. AAAI Press, 2017, pp. 70–76, doi:10.24963/ijcai.2017/11.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 |
Published |
Conference Paper |
IST-REx-ID: 1011 |
Chatterjee, Krishnendu, et al. Faster Algorithms for Weighted Recursive State Machines. Edited by Hongseok Yang, vol. 10201, Springer, 2017, pp. 287–313, doi: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 |
Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 33, Association for Computing Machinery, 2017, doi:10.1145/3158121.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 |
Published |
Journal Article |
IST-REx-ID: 1196
Henzinger, Thomas A., and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.” Nonlinear Analysis: Hybrid Systems, vol. 23, Elsevier, 2017, pp. 166–90, doi:10.1016/j.nahs.2016.09.001.
View
| DOI
| WoS
2016 |
Published |
Conference Paper |
IST-REx-ID: 1090 |
Chatterjee, Krishnendu, et al. Nested Weighted Limit-Average Automata of Bounded Width. Vol. 58, 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.MFCS.2016.24.
[Published Version]
View
| Files available
| DOI
2016 |
Published |
Conference Paper |
IST-REx-ID: 1093 |
Daca, Przemyslaw, et al. Linear Distances between Markov Chains. Vol. 59, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.20.
[Published Version]
View
| Files available
| DOI
2016 |
Published |
Conference Paper |
IST-REx-ID: 1095 |
Haas, Andreas, et al. “Local Linearizability for Concurrent Container-Type Data Structures.” Leibniz International Proceedings in Informatics, vol. 59, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.6.
[Published Version]
View
| Files available
| DOI
2016 |
Published |
Conference Paper |
IST-REx-ID: 1103 |
Gurung, Amit, et al. Parallel Reachability Analysis for Hybrid Systems. 7797741, IEEE, 2016, doi:10.1109/MEMCOD.2016.7797741.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 |
Published |
Thesis | PhD |
IST-REx-ID: 1130 |
Tarrach, Thorsten. Automatic Synthesis of Synchronisation Primitives for Concurrent Programs. Institute of Science and Technology Austria, 2016, doi:10.15479/at:ista:1130.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2016 |
Published |
Conference Paper |
IST-REx-ID: 1134
Duggirala, Parasara, et al. “Tutorial: Software Tools for Hybrid Systems Verification Transformation and Synthesis C2E2 HyST and TuLiP.” 2016 IEEE Conference on Control Applications, 7587948, IEEE, 2016, doi:10.1109/CCA.2016.7587948.
View
| DOI
2016 |
Published |
Conference Paper |
IST-REx-ID: 1135 |
Avni, Guy, et al. “Synthesizing Time Triggered Schedules for Switched Networks with Faulty Links.” Proceedings of the 13th International Conference on Embedded Software , 26, ACM, 2016, doi:10.1145/2968478.2968499.
[Submitted Version]
View
| Files available
| DOI
2016 |
Published |
Conference Paper |
IST-REx-ID: 1138 |
Chatterjee, Krishnendu, et al. “Quantitative Automata under Probabilistic Semantics.” Proceedings of the 31st Annual ACM/IEEE Symposium, IEEE, 2016, pp. 76–85, doi:10.1145/2933575.2933588.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2016 |
Published |
Journal Article |
IST-REx-ID: 1148
Schilling, Christian, et al. “Adaptive Moment Closure for Parameter Inference of Biochemical Reaction Networks.” Biosystems, vol. 149, Elsevier, 2016, pp. 15–25, doi:10.1016/j.biosystems.2016.07.005.
View
| Files available
| DOI
2016 |
Published |
Conference Paper |
IST-REx-ID: 1166
Chatterjee, Krishnendu, et al. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, vol. 2016, AAAI Press, 2016, pp. 3225–32.
View
| Files available