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.
5735 Publications
2013 | Published | Conference Paper | IST-REx-ID: 1374 | 
Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” In 22nd EACSL Annual Conference on Computer Science Logic, 23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.181.
[Published Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2446 |
Chatterjee, Krishnendu, Andreas Gaiser, and Jan Kretinsky. “Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_37.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Published | Conference Paper | IST-REx-ID: 2444 |
Chatterjee, Krishnendu, and Jakub Ła̧Cki. “Faster Algorithms for Markov Decision Processes with Low Treewidth.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_36.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Published | Journal Article | IST-REx-ID: 2836 |
Chatterjee, Krishnendu, and Vishwanath Raman. “Assume-Guarantee Synthesis for Digital Contract Signing.” Formal Aspects of Computing. Springer, 2013. https://doi.org/10.1007/s00165-013-0283-6.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Published | Journal Article | IST-REx-ID: 2824
Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory-Efficient, Clock-Memory Free, and Non-Zeno Safety Controllers for Timed Systems.” Information and Computation. Elsevier, 2013. https://doi.org/10.1016/j.ic.2013.04.003.
View
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2305 |
Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Trading Performance for Stability in Markov Decision Processes.” In 28th Annual ACM/IEEE Symposium, 331–40. IEEE, 2013. https://doi.org/10.1109/LICS.2013.39.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Published | Conference Paper | IST-REx-ID: 2295 |
Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.165.
[Published Version]
View
| Files available
| DOI
2013 | Published | Technical Report | IST-REx-ID: 5400 |
Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-109-v1-1.
[Published Version]
View
| Files available
| DOI
2013 | Published | Technical Report | IST-REx-ID: 5404 |
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-127-v1-1.
[Published Version]
View
| Files available
| DOI
2013 | Published | Technical Report | IST-REx-ID: 5405 |
Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. Perfect-Information Stochastic Mean-Payoff Parity Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-128-v1-1.
[Published Version]
View
| Files available
| DOI
2013 | Published | Technical Report | IST-REx-ID: 5408 |
Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-141-v1-1.
[Published Version]
View
| Files available
| DOI
2013 | Published | Journal Article | IST-REx-ID: 2817 |
Novak, Sebastian, Krishnendu Chatterjee, and Martin Nowak. “Density Games.” Journal of Theoretical Biology. Elsevier, 2013. https://doi.org/10.1016/j.jtbi.2013.05.029.
[Published Version]
View
| Files available
| DOI
2013 | Published | Journal Article | IST-REx-ID: 2289 |
Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” Computer Science Research and Development. Springer, 2013. https://doi.org/10.1007/s00450-013-0251-7.
[Published Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2181 |
Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, 317–28. ACM, 2013. https://doi.org/10.1145/2429069.2429109.
[Submitted Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2182
Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.” In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, 115–28. ACM, 2013. https://doi.org/10.1145/2429069.2429085.
View
| DOI
2013 | Published | Book Chapter | IST-REx-ID: 5747 |
Dragoi, Cezara, Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. Computer Aided Verification 8044. 2013
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 1387 |
Boker, Udi, Denis Kuperberg, Orna Kupferman, and Michał Skrzypczak. “Nondeterminism in the Presence of a Diverse or Unknown Future.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39212-2_11.
[Submitted Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2301
Desai, Ankush, Vivek Gupta, Ethan Jackson, Shaz Qadeer, Sriram Rajamani, and Damien Zufferey. “P: Safe Asynchronous Event-Driven Programming.” In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, 321–31. ACM, 2013. https://doi.org/10.1145/2491956.2462184.
View
| DOI
| Download None (ext.)
2013 | Published | Conference Paper | IST-REx-ID: 2243 |
Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive Structures.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.563.
[Published Version]
View
| Files available
| DOI