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.
436 Publications
2015 |
Published |
Technical Report |
IST-REx-ID: 5439 |
U. Boker, T. A. Henzinger, and J. Otop, The target discounted-sum problem. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |
Research Data |
IST-REx-ID: 5549 |
A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |
Published |
Conference Paper |
IST-REx-ID: 1729 |
P. Cerny et al., “From non-preemptive to preemptive scheduling using synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015.
[Submitted Version]
View
| Files available
| DOI
| WoS
2015 |
Published |
Conference Paper |
IST-REx-ID: 1502 |
N. Beneš, P. Daca, T. A. Henzinger, J. Kretinsky, and D. Nickovic, “Complete composition operators for IOCO-testing theory,” presented at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada, 2015, pp. 101–110.
[Submitted Version]
View
| Files available
| DOI
| WoS
2015 |
Published |
Journal Article |
IST-REx-ID: 1501 |
K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for compositional analysis of qualitative properties in Markov decision processes,” Formal Methods in System Design, vol. 47, no. 2. Springer, pp. 230–264, 2015.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2015 |
Published |
Conference Paper |
IST-REx-ID: 1610 |
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in 42nd International Colloquium on Automata, Languages, and Programming, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2014 |
Published |
Conference Paper |
IST-REx-ID: 1392 |
C. Dragoi, T. A. Henzinger, H. Veith, J. Widder, and D. Zufferey, “A logic-based framework for verifying consensus algorithms,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, San Diego, USA, 2014, vol. 8318, pp. 161–181.
[Submitted Version]
View
| Files available
| DOI
2014 |
Published |
Conference Paper |
IST-REx-ID: 1393 |
A. Gordon, T. A. Henzinger, A. Nori, and S. Rajamani, “Probabilistic programming,” in Proceedings of the on Future of Software Engineering, Hyderabad, India, 2014, pp. 167–181.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2014 |
Published |
Conference Paper |
IST-REx-ID: 1870 |
T. A. Henzinger, J. Otop, and R. Samanta, “Lipschitz robustness of finite-state transducers,” in Leibniz International Proceedings in Informatics, LIPIcs, Delhi, India, 2014, vol. 29, pp. 431–443.
[Published Version]
View
| Files available
| DOI
2014 |
Published |
Conference Paper |
IST-REx-ID: 1872 |
A. Gupta, L. Kovács, B. Kragl, and A. Voronkov, “Extensional crisis and proving identity,” in ATVA 2014, Sydney, Australia, 2014, vol. 8837, pp. 185–200.
[Submitted Version]
View
| Files available
| DOI
2014 |
Published |
Conference Paper |
IST-REx-ID: 2026
Z. Komárková and J. Kretinsky, “Rabinizer 3: Safraless translation of ltl to small deterministic automata,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sydney, Australia, 2014, vol. 8837, pp. 235–241.
View
| DOI
2014 |
Published |
Conference Paper |
IST-REx-ID: 2027 |
T. Brázdil et al., “Verification of markov decision processes using learning algorithms,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sydney, Australia, 2014, vol. 8837, pp. 98–114.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2014 |
Published |
Journal Article |
IST-REx-ID: 2038 |
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4. ACM, 2014.
[Submitted Version]
View
| Files available
| DOI
| WoS
2014 |
Published |
Conference Paper |
IST-REx-ID: 2053 |
H. Hermanns, J. Krčál, and J. Kretinsky, “Probabilistic bisimulation: Naturally on distributions,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 249–265.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2014 |
Published |
Journal Article |
IST-REx-ID: 2056 |
A. Ganguly, T. Petrov, and H. Koeppl, “Markov chain aggregation and its applications to combinatorial reaction networks,” Journal of Mathematical Biology, vol. 69, no. 3. Springer, pp. 767–797, 2014.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2014 |
Published |
Conference Paper |
IST-REx-ID: 1875 |
R. Samanta, O. Olivo, and E. Allen, “Cost-aware automatic program repair,” presented at the SAS: Static Analysis Symposium, Munich, Germany, 2014, vol. 8723, pp. 268–284.
[Submitted Version]
View
| Files available
| DOI
2014 |
Published |
Journal Article |
IST-REx-ID: 2187 |
R. Bloem et al., “Synthesizing robust systems,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 193–220, 2014.
[Submitted Version]
View
| Files available
| DOI
| WoS
2014 |
Published |
Conference Paper |
IST-REx-ID: 2190 |
J. Esparza and J. Kretinsky, “From LTL to deterministic automata: A safraless compositional approach,” presented at the CAV: Computer Aided Verification, 2014, vol. 8559, pp. 192–208.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2014 |
Published |
Conference Paper |
IST-REx-ID: 2217 |
T. A. Henzinger and J. Otop, “Model measuring for hybrid systems,” in Proceedings of the 17th international conference on Hybrid systems: computation and control, Berlin, Germany, 2014, pp. 213–222.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)