Article

Van Bulck, D., Goossens, D., Clarner, J.-P., Dimitsas, A., Fonseca, G. H. G., Lamas-Fernandez, C., Lester, M. M. ORCID: https://orcid.org/0000-0002-2323-1771, Pedersen, J., Phillips, A. E. and Rosati, R. M. (2024) Which algorithm to select in sports timetabling? European Journal of Operational Research, 318 (2). pp. 575-591. ISSN 0377-2217 doi: https://doi.org/10.1016/j.ejor.2024.06.005

Lester, M. M. ORCID: https://orcid.org/0000-0002-2323-1771 (2022) Pseudo-Boolean optimisation for RobinX sports timetabling. Journal of Scheduling, 25. pp. 287-299. ISSN 1099-1425 doi: https://doi.org/10.1007/s10951-022-00737-7

Lester, M. ORCID: https://orcid.org/0000-0002-2323-1771, Ong, L. and Schäfer, M. (2016) Information flow analysis for a dynamically typed language with staged metaprogramming. Journal of Computer Security, 24 (5). pp. 541-582. ISSN 0926-227X doi: https://doi.org/10.3233/JCS-160557

Book or Report Section

Lester, M. M. ORCID: https://orcid.org/0000-0002-2323-1771 (2024) Cutting the cake into crumbs: verifying envy-free cake cutting protocols using bounded integer arithmetic. In: Gebser, M. and Sergey, I. (eds.) Practical aspects of declarative languages: 26th international symposium, PADL 2024, London, UK, January 15–16, 2024, Proceedings. Lecture Notes in Computer Science (14512). Springer, Cham, pp. 100-115. ISBN 9783031520372 doi: https://doi.org/10.1007/978-3-031-52038-9_7

Lester, M. M. ORCID: https://orcid.org/0000-0002-2323-1771 (2023) CoPTIC: constraint programming translated into C. In: Sankaranarayanan, S. and Sharygina, N. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2023. Lecture Notes in Computer Science (13994). Springer, Cham. ISBN 9783031308192 doi: https://doi.org/10.1007/978-3-031-30820-8_13

Conference or Workshop Item

Makarova, A., Shahzad, M. ORCID: https://orcid.org/0009-0002-9394-343X, Hong, X. ORCID: https://orcid.org/0000-0002-6832-2298 and Lester, M. ORCID: https://orcid.org/0000-0002-2323-1771 (2024) Learning a strategy for preference elicitation in conversational recommender systems. In: International Joint Conference on Neural Networks (IJCNN), 30 Jun - 5 Jul 2024, Yokohama, Japan. doi: https://doi.org/10.1109/ijcnn60899.2024.10650365

Lester, M. ORCID: https://orcid.org/0000-0002-2323-1771 (2022) Reprobate at ITC 2021: pseudoboolean optimisation for RobinX sports timetabling. In: 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2021, 23 Aug 2022 - 26 Aug 2022, Bruges, Belgium, pp. 454-459.

Lester, M. M. ORCID: https://orcid.org/0000-0002-2323-1771 (2021) Scheduling reach mahjong tournaments using pseudoboolean constraints. In: Theory and Applications of Satisfiability Testing – SAT 2021, 5-9 July 2021, Barcelona, Spain. doi: https://doi.org/10.1007/978-3-030-80223-3

Lester, M. M. ORCID: https://orcid.org/0000-0002-2323-1771 (2020) ScAmPER: generating test suites to maximise code coverage in interactive fiction games. In: TAP 2020: 14th International Conference on Tests and Proofs, 22-26 Jun 2020, Bergen, Norway, pp. 169-179. doi: https://doi.org/10.1007/978-3-030-50995-8_10

Lester, M. ORCID: https://orcid.org/0000-0002-2323-1771 (2020) Program transformations enable verification tools to solve interactive fiction games. In: 7th International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 29th June 2020, Virtual.

Lester, M. ORCID: https://orcid.org/0000-0002-2323-1771 (2019) Analysis of MiniJava programs via translation to ML. In: FTfJP '19: Proceedings of the 21st Workshop on Formal Techniques for Java-like Programs, 15th Jul 2019, London. doi: https://doi.org/10.1145/3340672.3341119