Aarhus University Seal

Publications

2025

Contribution to journal

Conrado, G. K. & Pavlogiannis, A. (2025). CFL-based methods for approximating interleaved Dyck reachability. International Journal on Software Tools for Technology Transfer, 27(2), 255-266. Article 106135. https://doi.org/10.1007/s10009-025-00787-0
Møldrup, L. & Pavlogiannis, A. (2025). AWDIT: An Optimal Weak Database Isolation Tester. Proceedings of the ACM on Programming Languages , 9, 1540-1564. Article 209. https://doi.org/10.1145/3742465
Krishna, S., Lal, A., Pavlogiannis, A. & Tuppe, O. (2024). On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability. Proceedings of the ACM on Programming Languages , 8(POPL), 1239-1268. https://doi.org/10.1145/3632884
Chakraborty, S., Krishna, S. N., Mathur, U. & Pavlogiannis, A. (2024). How Hard Is Weak-Memory Testing? Proceedings of the ACM on Programming Languages , 8, Article 66. https://doi.org/10.1145/3632908
Schenck, R., Hinnerskov, N. H., Henriksen, T., Madsen, M. & Elsman, M. (2024). AUTOMAP: Inferring Rank-Polymorphic Function Applications with Integer Linear Programming. Proceedings of the ACM on Programming Languages , 8(OOPSLA2), 1787-1813. Article 334. https://doi.org/10.1145/3689774
Tunç, H. C., Mathur, U., Pavlogiannis, A. & Viswanathan, M. (2023). Sound Dynamic Deadlock Prediction in Linear Time. Proceedings of the ACM on Programming Languages , 7, 1733-1758. https://doi.org/10.1145/3591291
Tunç, H. C., Abdulla, P. A., Chakraborty, S., Krishna, S., Mathur, U. & Pavlogiannis, A. (2023). Optimal Reads-From Consistency Checking for C11-Style Memory Models. Proceedings of the ACM on Programming Languages , 7(PLDI), 761–785. Article 137. https://doi.org/10.1145/3591251
Lutze, M., Madsen, M., Schuster, P. & Brachthäuser, J. I. (2023). With or Without You: Programming with Effect Exclusion. Proceedings of the ACM on Programming Languages , 7(ICFP), 448-475. https://doi.org/10.1145/3607846
Madsen, M., Van De Pol, J. & Henriksen, T. (2023). Fast and Efficient Boolean Unification for Hindley-Milner-Style Type and Effect Systems. Proceedings of the ACM on Programming Languages , 7(OOPSLA2), 516–543. Article 240. https://doi.org/10.1145/3622816
Müller, M., Schuster, P., Starup, J. L., Ostermann, K. & Brachthäuser, J. I. (2023). From Capabilities to Regions: Enabling Efficient Compilation of Lexical Effect Handlers. Proceedings of the ACM on Programming Languages , 7(OOPSLA2), Article 255. https://doi.org/10.1145/3622831
Svoboda, J., Tkadlec, J., Pavlogiannis, A., Chatterjee, K. & Nowak, M. A. (2022). Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports, 12, Article 1526. https://doi.org/10.1038/s41598-022-05333-5
Chatterjee, K., Svoboda, J., Žikelić, Đ., Pavlogiannis, A. & Tkadlec, J. (2022). Social balance on networks: Local minima and best-edge dynamics. Physical Review E, 106(3), Article 034321. https://doi.org/10.1103/PhysRevE.106.034321
Brendborg, J., Karras, P., Pavlogiannis, A., Rasmussen, A. U. & Tkadlec, J. (2022). Fixation Maximization in the Positional Moran Process. Proceedings of the AAAI Conference on Artificial Intelligence, 36(9, AAAI Technical Track on Multiagent Systems), 9304-9312. https://doi.org/10.1609/aaai.v36i9.21160
Tkadlec, J., Pavlogiannis, A., Chatterjee, K. & Nowak, M. A. (2021). Fast and strong amplifiers of natural selection. Nature Communications, 12(1), Article 4009. https://doi.org/10.1038/s41467-021-24271-w
Chatterjee, K., Ibsen-Jensen, R. & Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design, 57(3), 401-428. https://doi.org/10.1007/s10703-021-00373-5
Tkadlec, J., Pavlogiannis, A., Chatterjee, K. & Nowak, M. A. (2020). Limits on amplifiers of natural selection under death-Birth updating. PLoS Computational Biology, 16(1), Article e1007494. https://doi.org/10.1371/journal.pcbi.1007494
Li, Y., Tan, T., Møller, A. & Smaragdakis, Y. (2020). A Principled Approach to Selective Context Sensitivity for Pointer Analysis. ACM Transactions on Programming Languages and Systems, 42(2), Article 10. https://doi.org/10.1145/3381915
Pavlogiannis, A., Schaumberger, N., Schmid, U. & Chatterjee, K. (2020). Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 39(11), 3981-3992. Article 9211419. https://doi.org/10.1109/TCAD.2020.3012803
Chatterjee, K., Pavlogiannis, A. & Toman, V. (2019). Value-centric Dynamic Partial Order Reduction. Proceedings of the ACM on Programming Languages , 3(OOPSLA), Article 124. https://doi.org/10.1145/3360550
Stein, B., Nielsen, B. B., Chang, B.-Y. E. & Møller, A. (2019). Static Analysis with Demand-driven Value Refinement. Proceedings of the ACM on Programming Languages , 3(OOPSLA), Article 140. https://doi.org/10.1145/3360566
Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R. & Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraicqueries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems, 41(4), Article 23. https://doi.org/10.1145/3363525
Chatterjee, K., Goharshady, A. K., Okati, N. & Pavlogiannis, A. (2019). Efficient Parameterized Algorithms for Data Packing. Proceedings of the ACM on Programming Languages , 3(POPL), Article 53. https://doi.org/10.1145/3290366