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.
499 Publications
2012 | Published | Conference Paper | IST-REx-ID: 3135 | 
B. Brázdil, K. Chatterjee, A. Kučera, and P. Novotný, “Efficient controller synthesis for consumption games with multiple resource types,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 23–38.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 2916 |
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in Electronic Proceedings in Theoretical Computer Science, Napoli, Italy, 2012, vol. 96, pp. 29–42.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 3252 |
K. Chatterjee and V. Raman, “Synthesizing protocols for digital contract signing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 152–168.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 2956 |
K. Chatterjee and Y. Velner, “Mean payoff pushdown games,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Technical Report | IST-REx-ID: 5377 |
K. Chatterjee and Y. Velner, Mean-payoff pushdown games. IST Austria, 2012.
[Published Version]
View
| Files available
| DOI
2012 | Published | Conference Paper | IST-REx-ID: 10904 |
K. Chatterjee, M. Randour, and J.-F. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” in CONCUR 2012 - Concurrency Theory, Newcastle upon Tyne, United Kingdom, 2012, vol. 7454, pp. 115–131.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 2947 |
K. Chatterjee, M. Chmelik, and R. Majumdar, “Equivalence of games with probabilistic uncertainty and partial observation games,” presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 385–399.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 3165 |
K. Chatterjee and M. Henzinger, “An O(n2) time algorithm for alternating Büchi games,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Kyoto, Japan, 2012, pp. 1386–1399.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Journal Article | IST-REx-ID: 2972 |
K. Chatterjee and L. Doyen, “Energy parity games,” Theoretical Computer Science, vol. 458. Elsevier, pp. 49–60, 2012.
[Published Version]
View
| Files available
| DOI
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 496 |
A. Rabinovich and S. Rubin, “Interpretations in trees with countably many branches,” presented at the LICS: Logic in Computer Science, Dubrovnik, Croatia, 2012.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3343 |
K. Chatterjee and M. Henzinger, “Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States, 2011, pp. 1318–1336.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3365 |
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Journal Article | IST-REx-ID: 3315 |
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” Logical Methods in Computer Science, vol. 7, no. 4. International Federation of Computational Logic, 2011.
[Published Version]
View
| Files available
| DOI
2011 | Published | Journal Article | IST-REx-ID: 3354
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4. ACM, 2011.
View
| Files available
| DOI
2011 | Published | Technical Report | IST-REx-ID: 5384 |
K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on infinite words. IST Austria, 2011.
[Published Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3366 |
P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3361 |
P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3356 |
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Technical Report | IST-REx-ID: 5385 |
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications with accumulative values. IST Austria, 2011.
[Published Version]
View
| Files available
| DOI