Koval, Nikita, et al. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.”10.1145/3591230__Proceedings of the ACM on Programming Languages, vol. 7, 116, Association for Computing Machinery , 2023, doi:10.1145/3591230.
LibreCat: https://research-explorer.ista.ac.at/record/13179
DOI: 10.1145/3591230

Mühlböck, Fabian, and Ross Tate. “Transitioning from Structural to Nominal Code with Efficient Gradual Typing.”10.1145/3485504__Proceedings of the ACM on Programming Languages, vol. 5, 127, Association for Computing Machinery, 2021, doi:10.1145/3485504.
LibreCat: https://research-explorer.ista.ac.at/record/10153
DOI: 10.1145/3485504

Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.”10.1145/3485541__Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:10.1145/3485541.
LibreCat: https://research-explorer.ista.ac.at/record/10191
DOI: 10.1145/3485541
arXiv: 2011.11763

Wang, Peixin, et al. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.”10.1145/3371093__Proceedings of the ACM on Programming Languages, vol. 4, no. POPL, 25, ACM, 2020, doi:10.1145/3371093.
LibreCat: https://research-explorer.ista.ac.at/record/8324
DOI: 10.1145/3371093
arXiv: 1902.04744

Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.”10.1145/3360550__Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, vol. 3, 124, ACM, 2019, doi:10.1145/3360550.
LibreCat: https://research-explorer.ista.ac.at/record/10190
DOI: 10.1145/3360550
arXiv: 1909.00989

Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.”10.1145/3158121__Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 33, Association for Computing Machinery, 2017, doi:10.1145/3158121.
LibreCat: https://research-explorer.ista.ac.at/record/10418
DOI: 10.1145/3158121
arXiv: 1711.03588

Chatterjee, Krishnendu, et al. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.”10.1145/3158118__Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 30, Association for Computing Machinery, 2017, doi:10.1145/3158118.
LibreCat: https://research-explorer.ista.ac.at/record/10416
DOI: 10.1145/3158118
arXiv: 1910.00241

Chalupa, Marek, et al. “Data-Centric Dynamic Partial Order Reduction.”10.1145/3158119__Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 31, Association for Computing Machinery, 2017, doi:10.1145/3158119.
LibreCat: https://research-explorer.ista.ac.at/record/10417
DOI: 10.1145/3158119
arXiv: 1610.01188