2024
Lefaucheux, E., Ouaknine, J., Purser, D., & Worrell, J. (n.d.). Porous invariants for linear systems. Formal Methods in System Design. doi:10.1007/s10703-024-00444-3DOI: 10.1007/s10703-024-00444-3
2023
Bose, S., Purser, D., & Totzke, P. (2023). History-Deterministic Vector Addition Systems. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 279. doi:10.4230/LIPIcs.CONCUR.2023.18DOI: 10.4230/LIPIcs.CONCUR.2023.18
Daviaud, L., & Purser, D. (2023). The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). In Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Boston, USA: IEEE.
Lefaucheux, E., Ouaknine, J., Purser, D., & Sharifi, M. (2023). Model Checking Linear Dynamical Systems under Floating-point Rounding. In Unknown Conference (pp. 47-65). Springer Nature Switzerland. doi:10.1007/978-3-031-30823-9_3DOI: 10.1007/978-3-031-30823-9_3
2022
Baier, C., Funke, F., Jantsch, S., Karimov, T., Lefaucheux, E., Ouaknine, J., . . . Worrell, J. (2022). Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications. In 33rd International Conference on Concurrency Theory (CONCUR 2022). doi:10.4230/LIPIcs.CONCUR.2022.10DOI: 10.4230/LIPIcs.CONCUR.2022.10
Bilu, Y., Luca, F., Nieuwveld, J., Ouaknine, J., Purser, D., & Worrell, J. (2022). Skolem Meets Schanuel. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). doi:10.4230/LIPIcs.MFCS.2022.20DOI: 10.4230/LIPIcs.MFCS.2022.20
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. ACM. doi:10.1145/3531130.3533328DOI: 10.1145/3531130.3533328
Czerwiński, W., Lefaucheux, E., Mazowiecki, F., Purser, D., & Whiteland, M. (2022). The boundedness and zero isolation problems for weighted automata over nonnegative rationals. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. ACM. doi:10.1145/3531130.3533336DOI: 10.1145/3531130.3533336
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)2022DOI: 10.46298/lmcs-18(1:40)2022
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/3498727DOI: 10.1145/3498727
2021
Baier, C., Funke, F., Jantsch, S., Karimov, T., Lefaucheux, E., Luca, F., . . . Worrell, J. (2021). The Orbit Problem for Parametric Linear Dynamical Systems. In 32nd International Conference on Concurrency Theory (CONCUR 2021). doi:10.4230/LIPIcs.CONCUR.2021.28DOI: 10.4230/LIPIcs.CONCUR.2021.28
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_8DOI: 10.1007/978-3-030-81688-9_8
2020
The Complexity of Verifying Loop-Free Programs as Differentially Private. (Conference Paper)
Gaboardi, M., Nissim, K., & Purser, D. (2020). The Complexity of Verifying Loop-Free Programs as Differentially Private.. In A. Czumaj, A. Dawar, & E. Merelli (Eds.), ICALP Vol. 168 (pp. 129:1). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Retrieved from https://www.dagstuhl.de/dagpub/978-3-95977-138-2DOI: 10.4230/LIPIcs.ICALP.2020.129
