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.

459 Publications


2021 | Conference Paper | IST-REx-ID: 10055 | OA
A Ramsey theorem for finite monoids
I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | WoS
 

2021 | Conference Paper | IST-REx-ID: 9987 | OA
Stateless model checking under a reads-value-from equivalence
P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, V. Toman, in:, 33rd International Conference on Computer-Aided Verification , Springer Nature, 2021, pp. 341–366.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2021 | Journal Article | IST-REx-ID: 10191 | OA
The reads-from equivalence for the TSO and PSO memory models
T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021).
[Published Version] View | Files available | DOI | arXiv
 

2021 | Thesis | IST-REx-ID: 10199 | OA
Improved verification techniques for concurrent systems
V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021.
[Published Version] View | Files available | DOI
 

2021 | Journal Article | IST-REx-ID: 9293 | OA
Algorithms and conditional lower bounds for planning problems
K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, Artificial Intelligence 297 (2021).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Journal Article | IST-REx-ID: 9393 | OA
Faster algorithms for quantitative verification in bounded treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System Design 57 (2021) 401–428.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10414 | OA
On lexicographic proof rules for probabilistic termination
K. Chatterjee, E.K. Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, in:, 24th International Symposium on Formal Methods, Springer Nature, 2021, pp. 619–639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Conference Paper | IST-REx-ID: 9644 | OA
Proving non-termination by program reversal
K. Chatterjee, E.K. Goharshady, P. Novotný, D. Zikelic, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1033–1048.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Research Data Reference | IST-REx-ID: 15284 | OA
RevTerm
K. Chatterjee, A.K. Goharshady, P. Novotný, D. Zikelic, (2021).
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2021 | Thesis | IST-REx-ID: 8934 | OA
Parameterized and algebro-geometric advances in static program analysis
A.K. Goharshady, Parameterized and Algebro-Geometric Advances in Static Program Analysis, Institute of Science and Technology Austria, 2021.
[Published Version] View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications