ISTA Research Explorer

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.

Jakub Svoboda

Raimundo Saona Urmeneta

Mehrdad Karrabi

Ruichen Luo

Krishnendu Chatterjee

Ali Asadi

Ehsan Kafshdar Goharshadi

Valentin Hübner

Joost Katoen

Florian Horn

Hongfei Fu

Sasha Rubin

Amir Goharshady

Martin Chmelik

Mingzhang Huang

Ismael Jecker

Christian Hilbe

Benjamin Aminof

Mathieu Tracol

Andreas Pavlogiannis

Ventsislav Chonev

Jan Kretinsky

Laura Schmid

Petr Novotny

John Lazarsfeld

Djordje Zikelic

Rasmus Ibsen-Jensen

Maximilian Weininger

Viktor Toman

Pepa Tkadlec

Johannes Reiter

Tobias Meggendorfer

Tadeas Priklopil

Maria Kleshnina

483 Publications

Search / Filter

2018 | Published | Journal Article | IST-REx-ID: 6009 |

K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3. Association for Computing Machinery, 2018.

2017 | Published | Conference Paper | IST-REx-ID: 1009 |

K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, and D. Zikelic, “Optimizing expectation with guarantees in POMDPs,” in Proceedings of the 31st AAAI Conference on Artificial Intelligence, San Francisco, CA, United States, 2017, vol. 5, pp. 3725–3732.

[Submitted Version] View | Download Submitted Version (ext.) | WoS

2017 | Published | Conference Paper | IST-REx-ID: 1011 |

K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.

[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS

2017 | Published | Journal Article | IST-REx-ID: 10416 |

K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability for data-dependence and Alias analysis,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.

[Published Version] View | Files available | DOI | arXiv

2017 | Published | Journal Article | IST-REx-ID: 10417 |

M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric dynamic partial order reduction,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.

[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv

2017 | Published | Journal Article | IST-REx-ID: 10418 |

A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, “A new proof rule for almost-sure termination,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.

[Published Version] View | DOI | Download Published Version (ext.) | arXiv

2017 | Published | Journal Article | IST-REx-ID: 1065 |

K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,” Information Processing Letters, vol. 122. Elsevier, pp. 25–29, 2017.

[Submitted Version] View | Files available | DOI | WoS

2017 | Published | Journal Article | IST-REx-ID: 1066

K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, “Quantitative fair simulation games,” Information and Computation, vol. 254, no. 2. Elsevier, pp. 143–166, 2017.

View | Files available | DOI | WoS

2017 | Published | Journal Article | IST-REx-ID: 1080 |

J. Reiter et al., “Reconstructing metastatic seeding patterns of human cancers,” Nature Communications, vol. 8. Nature Publishing Group, 2017.

[Published Version] View | Files available | DOI | WoS

2017 | Published | Conference Paper | IST-REx-ID: 950 |

G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” presented at the CONCUR: Concurrency Theory, Berlin, Germany, 2017, vol. 85.

[Published Version] View | Files available | DOI | arXiv

2017 | Published | Conference Paper | IST-REx-ID: 13160 |

J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record for transforming Rabin automata into parity automata,” in Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 443–460.

[Preprint] View | DOI | Download Preprint (ext.) | arXiv

2017 | Published | Journal Article | IST-REx-ID: 1407 |

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,” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2. Elsevier, pp. 230–253, 2017.

2017 | Published | Journal Article | IST-REx-ID: 464 |

K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.

[Published Version] View | Files available | DOI | arXiv

2017 | Published | Journal Article | IST-REx-ID: 465 |

K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.