Please note that IST 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.

368 Publications


2011 | Journal Article | IST-REx-ID: 3354
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2011). Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1970398.1970404
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3356 | OA
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee, K., Henzinger, T. A., & Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, & C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_17
View | DOI
 

2011 | Conference Paper | IST-REx-ID: 3361 | OA
Cerny, P., Chatterjee, K., & Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE. https://doi.org/10.1109/CSF.2011.21
View | Files available | DOI
 

2011 | Preprint | IST-REx-ID: 3363 | OA
Chatterjee, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.
View | Download Preprint (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3365 | OA
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. https://doi.org/10.1007/978-3-642-19835-9_24
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3366 | OA
Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_20
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 489 | OA
Cristau, J., David, C., & Horn, F. (2010). How do we remember the past in randomised strategies? . In Proceedings of GandALF 2010 (Vol. 25, pp. 30–39). Minori, Amalfi Coast, Italy: Open Publishing Association. https://doi.org/10.4204/EPTCS.25.7
View | DOI | Download Published Version (ext.)
 

2010 | Technical Report | IST-REx-ID: 5388 | OA
Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria. https://doi.org/10.15479/AT:IST-2010-0004
View | Files available | DOI
 

2010 | Technical Report | IST-REx-ID: 5390 | OA
Chatterjee, K., & Fijalkow, N. (2010). Topological, automata-theoretic and logical characterization of finitary languages. IST Austria. https://doi.org/10.15479/AT:IST-2010-0002
View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications