Skip to main content

Publications

What type of publication do you want to show?

2024

2023

2022

On the Skolem Problem and the Skolem Conjecture

Lipton, R., Luca, F., Nieuwveld, J., Ouaknine, J., Purser, D., & Worrell, J. (2022). On the Skolem Problem and the Skolem Conjecture. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Vol. 138 (pp. 1-9). ACM. doi:10.1145/3531130.3533328

DOI
10.1145/3531130.3533328
Conference Paper

Skolem Meets Schanuel

Bilu, Y., Luca, F., Nieuwveld, J., Ouaknine, J., Purser, D., & Worrell, J. (2022). Skolem Meets Schanuel. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 241. doi:10.4230/LIPIcs.MFCS.2022.20

DOI
10.4230/LIPIcs.MFCS.2022.20
Conference Paper

What’s decidable about linear loops?

Karimov, T., Lefaucheux, E., Ouaknine, J., Purser, D., Varonka, A., Whiteland, M. A., & Worrell, J. (2022). What’s decidable about linear loops?. Proceedings of the ACM on Programming Languages, 6(POPL), 1-25. doi:10.1145/3498727

DOI
10.1145/3498727
Journal article

The Big-O Problem

Chistikov, D., Kiefer, S., Murawski, A. S., & Purser, D. (n.d.). The Big-O Problem. Logical Methods in Computer Science, Volume 18, Issue 1. doi:10.46298/lmcs-18(1:40)2022

DOI
10.46298/lmcs-18(1:40)2022
Journal article

2021

Porous Invariants

Lefaucheux, E., Ouaknine, J., Purser, D., & Worrell, J. (2021). Porous Invariants. In Unknown Conference (pp. 172-194). Springer International Publishing. doi:10.1007/978-3-030-81688-9_8

DOI
10.1007/978-3-030-81688-9_8
Conference Paper

2020

The Complexity of Verifying Loop-Free Programs as Differentially Private.

Gaboardi, M., Nissim, K., & Purser, D. (2020). The complexity of verifying loop-free programs as differentially private. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 168. doi:10.4230/LIPIcs.ICALP.2020.129

DOI
10.4230/LIPIcs.ICALP.2020.129
Conference Paper