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.

10 Publications


2024 |Published| Journal Article | IST-REx-ID: 17162 | OA
Quantitative bounds on resource usage of probabilistic programs
K. Chatterjee, A.K. Goharshady, T. Meggendorfer, D. Zikelic, Proceedings of the ACM on Programming Languages 8 (2024).
[Published Version] View | Files available | DOI
 

2024 |Published| Journal Article | IST-REx-ID: 17283 | OA
Equivalence and similarity refutation for probabilistic programs
K. Chatterjee, E. Goharshady, P. Novotný, D. Zikelic, Proceedings of the ACM on Programming Languages 8 (2024).
[Published Version] View | Files available | DOI | arXiv
 

2023 |Published| Journal Article | IST-REx-ID: 13179 | OA
CQS: A formally-verified framework for fair and abortable synchronization
N. Koval, D. Khalanskiy, D.-A. Alistarh, Proceedings of the ACM on Programming Languages 7 (2023).
[Published Version] View | Files available | DOI
 

2021 |Published| Journal Article | IST-REx-ID: 10153 | OA
Transitioning from structural to nominal code with efficient gradual typing
F. Mühlböck, R. Tate, Proceedings of the ACM on Programming Languages 5 (2021).
[Published Version] View | Files available | DOI
 

2021 |Published| 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
 

2020 |Published| Conference Paper | IST-REx-ID: 8324 | OA
Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time
P. Wang, H. Fu, K. Chatterjee, Y. Deng, M. Xu, in:, Proceedings of the ACM on Programming Languages, ACM, 2020.
[Published Version] View | Files available | DOI | arXiv
 

2019 |Published| Conference Paper | IST-REx-ID: 10190 | OA
Value-centric dynamic partial order reduction
K. Chatterjee, A. Pavlogiannis, V. Toman, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, ACM, 2019.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2017 |Published| Journal Article | IST-REx-ID: 10418 | OA
A new proof rule for almost-sure termination
A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM on Programming Languages 2 (2017).
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 |Published| Journal Article | IST-REx-ID: 10416 | OA
Optimal Dyck reachability for data-dependence and Alias analysis
K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 2 (2017).
[Published Version] View | Files available | DOI | arXiv
 

2017 |Published| Journal Article | IST-REx-ID: 10417 | OA
Data-centric dynamic partial order reduction
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings of the ACM on Programming Languages 2 (2017).
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

Filters and Search Terms

eissn=2475-1421

Search

Filter Publications

Display / Sort

Export / Embed