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.

7131 Publications


2013 | Published | Conference Paper | IST-REx-ID: 2444 | OA
Chatterjee, K., & Ła̧Cki, J. (2013). Faster algorithms for Markov decision processes with low treewidth. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. 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 | OA
Chatterjee, K., & Raman, V. (2013). Assume-guarantee synthesis for digital contract signing. Formal Aspects of Computing. Springer. https://doi.org/10.1007/s00165-013-0283-6
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2013 | Published | Conference Paper | IST-REx-ID: 2305 | OA
Brázdil, T., Chatterjee, K., Forejt, V., & Kučera, A. (2013). Trading performance for stability in Markov decision processes. In 28th Annual ACM/IEEE Symposium (pp. 331–340). New Orleans, LA, United States: IEEE. 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 | OA
Chatterjee, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.165
[Published Version] View | Files available | DOI
 

2013 | Published | Technical Report | IST-REx-ID: 5400 | OA
Chatterjee, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with ω-regular objectives. IST Austria. 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 | OA
Chatterjee, K., & Ibsen-Jensen, R. (2013). The complexity of ergodic games. IST Austria. 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 | OA
Chatterjee, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2013). Perfect-information stochastic mean-payoff parity games. IST Austria. 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 | OA
Chatterjee, K., Doyen, L., Nain, S., & Vardi, M. (2013). The complexity of partial-observation stochastic parity games with finite-memory strategies. IST Austria. 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 | OA
Novak, S., Chatterjee, K., & Nowak, M. (2013). Density games. Journal of Theoretical Biology. Elsevier. https://doi.org/10.1016/j.jtbi.2013.05.029
[Published Version] View | Files available | DOI
 

2013 | Published | Journal Article | IST-REx-ID: 2289 | OA
Henzinger, T. A. (2013). Quantitative reactive modeling and verification. Computer Science Research and Development. Springer. https://doi.org/10.1007/s00450-013-0251-7
[Published Version] View | Files available | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 2181 | OA
Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., & Sokolova, A. (2013). Quantitative relaxation of concurrent data structures. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language (pp. 317–328). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429109
[Submitted Version] View | Files available | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 1387 | OA
Boker, U., Kuperberg, D., Kupferman, O., & Skrzypczak, M. (2013). Nondeterminism in the presence of a diverse or unknown future. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_11
[Submitted Version] View | Files available | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 2243 | OA
Michaliszyn, J., & Otop, J. (2013). Elementary modal logics over transitive structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.563
[Published Version] View | Files available | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 2298 | OA
Dragoi, C., Enea, C., & Sighireanu, M. (2013). Local shape analysis for overlaid data structures (Vol. 7935, pp. 150–171). Presented at the SAS: Static Analysis Symposium, Seattle, WA, United States: Springer. https://doi.org/10.1007/978-3-642-38856-9_10
[Submitted Version] View | Files available | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 1385 | OA
Hofferek, G., Gupta, A., Könighofer, B., Jiang, J., & Bloem, R. (2013). Synthesizing multiple boolean functions using interpolation on a single proof. In 2013 Formal Methods in Computer-Aided Design (pp. 77–84). Portland, OR, United States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679394
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2013 | Published | Conference Paper | IST-REx-ID: 2517 | OA
Almagor, S., Boker, U., & Kupferman, O. (2013). Formalizing and reasoning about quality. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_3
[Submitted Version] View | Files available | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 2847 | OA
Bansal, K., Koskinen, E., Wies, T., & Zufferey, D. (2013). Structural Counter Abstraction. (N. Piterman & S. Smolka, Eds.). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Rome, Italy: Springer. https://doi.org/10.1007/978-3-642-36742-7_5
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2013 | Published | Thesis | IST-REx-ID: 1405 | OA
Zufferey, D. (2013). Analysis of dynamic message passing programs. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:1405
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2013 | Published | Conference Paper | IST-REx-ID: 2328 | OA
Henzinger, T. A., Sezgin, A., & Vafeiadis, V. (2013). Aspect-oriented linearizability proofs. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-40184-8_18
[Submitted Version] View | Files available | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 2445 | OA
Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., & Tarrach, T. (2013). Efficient synthesis for concurrency by semantics-preserving transformations (Vol. 8044, pp. 951–967). Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_68
[Submitted Version] View | Files available | DOI
 

Filters and Search Terms

oa=1

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed