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.
386 Publications
2015 | Journal Article | IST-REx-ID: 1538 | 
J. Ruess, F. Parise, A. Milias Argeitis, M. Khammash, and J. Lygeros, “Iterative experiment design guides the characterization of a light-inducible gene expression circuit,” PNAS, vol. 112, no. 26. National Academy of Sciences, pp. 8148–8153, 2015.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2015 | Conference Paper | IST-REx-ID: 1601 |
T. Babiak et al., “The Hanoi omega-automata format,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 479–486.
[Submitted Version]
View
| Files available
| DOI
2015 | Conference Paper | IST-REx-ID: 1605 |
S. Bogomolov, C. Schilling, E. Bartocci, G. Batt, H. Kong, and R. Grosu, “Abstraction-based parameter synthesis for multiaffine systems,” presented at the HVC: Haifa Verification Conference, Haifa, Israel, 2015, vol. 9434, pp. 19–35.
[Submitted Version]
View
| Files available
| DOI
2015 | Conference Paper | IST-REx-ID: 1658
S. Bogomolov, T. A. Henzinger, A. Podelski, J. Ruess, and C. Schilling, “Adaptive moment closure for parameter inference of biochemical reaction networks,” vol. 9308. Springer, pp. 77–89, 2015.
View
| Files available
| DOI
2015 | Conference Paper | IST-REx-ID: 1670
S. Bogomolov, D. Magazzeni, S. Minopoli, and M. Wehrle, “PDDL+ planning with hybrid automata: Foundations of translating must behavior,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Jerusalem, Israel, 2015, pp. 42–46.
View
| Download None (ext.)
2015 | Conference Paper | IST-REx-ID: 1692
G. Frehse, S. Bogomolov, M. Greitschus, T. Strump, and A. Podelski, “Eliminating spurious transitions in reachability with support functions,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 149–158.
View
| DOI
2015 | Journal Article | IST-REx-ID: 1698 |
Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. Rabinovich, and J. Raskin, “The complexity of multi-mean-payoff and multi-energy games,” Information and Computation, vol. 241, no. 4. Elsevier, pp. 177–196, 2015.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2015 | Journal Article | IST-REx-ID: 1846 |
N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, and J. Srba, “Refinement checking on parametric modal transition systems,” Acta Informatica, vol. 52, no. 2–3. Springer, pp. 269–297, 2015.
[Submitted Version]
View
| Files available
| DOI
2015 | Journal Article | IST-REx-ID: 1840 |
B. Geiger, T. Petrov, G. Kubin, and H. Koeppl, “Optimal Kullback-Leibler aggregation via information bottleneck,” IEEE Transactions on Automatic Control, vol. 60, no. 4. IEEE, pp. 1010–1022, 2015.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2015 | Conference Paper | IST-REx-ID: 1882 |
U. Fahrenberg, J. Kretinsky, A. Legay, and L. Traonouez, “Compositionality for quantitative specifications,” presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy, 2015, vol. 8997, pp. 306–324.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2015 | Conference Paper | IST-REx-ID: 1992 |
A. Gupta, T. A. Henzinger, A. Radhakrishna, R. Samanta, and T. Tarrach, “Succinct representation of concurrent trace sets,” presented at the POPL: Principles of Programming Languages, Mumbai, India, 2015, pp. 433–444.
[Submitted Version]
View
| Files available
| DOI
2015 | Journal Article | IST-REx-ID: 1832 |
S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” Logical Methods in Computer Science, vol. 11, no. 1. International Federation of Computational Logic, 2015.
[Published Version]
View
| Files available
| DOI
2015 | Journal Article | IST-REx-ID: 1731 |
K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” Information and Computation, vol. 245, no. 12. Elsevier, pp. 3–16, 2015.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2015 | Journal Article | IST-REx-ID: 1856 |
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” Journal of the ACM, vol. 62, no. 1. ACM, 2015.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2015 | Conference Paper | IST-REx-ID: 1657
K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015.
View
| Files available
| DOI
2015 | Conference Paper | IST-REx-ID: 1656
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.
View
| Files available
| DOI
| arXiv
2015 | Technical Report | IST-REx-ID: 5436 |
K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 | Conference Paper | IST-REx-ID: 1659 |
U. Boker, T. A. Henzinger, and J. Otop, “The target discounted-sum problem,” in LICS, Kyoto, Japan, 2015, pp. 750–761.
[Submitted Version]
View
| Files available
| DOI
2015 | 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, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.
View
| Files available
| DOI
| Download None (ext.)
| arXiv
2015 | 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 | 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
2015 | 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.)
2015 | Conference Paper | IST-REx-ID: 1689 |
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,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 259–268.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2015 | 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
2015 | Conference Paper | IST-REx-ID: 1835 |
M. Giacobbe, C. C. Guet, A. Gupta, T. A. Henzinger, T. Paixao, and T. Petrov, “Model checking gene regulatory networks,” vol. 9035. Springer, pp. 469–483, 2015.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2015 | Conference Paper | IST-REx-ID: 1603 |
T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, and J. Kretinsky, “Counterexample explanation by learning small strategies in Markov decision processes,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 158–177.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
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
2014 | 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 | 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 | Conference Paper | IST-REx-ID: 1702 |
A. Gupta, C. Popeea, and A. Rybalchenko, “Generalised interpolation by solving recursion free-horn clauses,” in Electronic Proceedings in Theoretical Computer Science, EPTCS, Vienna, Austria, 2014, vol. 169, pp. 31–38.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | 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 | 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 | 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 | 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.)
2014 | 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 | 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.)
2014 | 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.)
2014 | 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
2014 | 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.)
2014 | Journal Article | IST-REx-ID: 2233 |
U. Boker and T. A. Henzinger, “Exact and approximate determinization of discounted-sum automata,” Logical Methods in Computer Science, vol. 10, no. 1. International Federation of Computational Logic, 2014.
[Published Version]
View
| Files available
| DOI