skip to content
Home

Department of Computer Science and Technology

PhD students Subscribe to RSS - PhD students

Singular: 
PhD student
Slug: 
phd-students
Read more at: Chris Jensen

Chris Jensen

Read more at: Dan Andrei Iliescu

Dan Andrei Iliescu

Please visit my personal page.

Theses / dissertations

  • Iliescu, DA., 2025 (No publication date). Deep learning for grouped data
    Doi: 10.17863/CAM.119538
    •
    Theses / dissertations

    2025 (No publication date)

  • Iliescu, DA., 2025 (No publication date). Deep learning for grouped data
    Doi: 10.17863/CAM.119538
    •
    Read more at: Chelsea Edmonds

    Chelsea Edmonds

    I recently completed my PhD (awaiting graduation in October 2024) in the Programming, Logic, and Semantics group in the Computer Laboratory at the University of Cambridge, where I was a member of Darwin College. My supervisor was Prof. Larry Paulson, and I was a member of the ALEXANDRIA project group team investigating large scale formal proof for the working mathematician.

    Theses / dissertations

  • Edmonds, C., 2024 (No publication date). Formalising Combinatorial Structures and Proof Techniques in Isabelle/HOL
    Doi: 10.17863/CAM.108886
    •

    Conference proceedings

  • Edmonds, C. and Paulson, LC., 2024. Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma Cpp 2024 Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs Co Located with Popl 2024,
    Doi: 10.1145/3636501.3636946
    •
  • Koutsoukou-Argyraki, A., Bakšys, M. and Edmonds, C., 2023. A Formalisation of the Balog-Szemerédi-Gowers Theorem in Isabelle/HOL Cpp 2023 Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs Co Located with Popl 2023,
    Doi: 10.1145/3573105.3575680
    •
  • Edmonds, C. and Paulson, LC., 2022. Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics 13th International Conference on Interactive Theorem Proving (2022). 11:1-11:19,
    •
  • Edmonds, C. and Paulson, LC., 2022. Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics Leibniz International Proceedings in Informatics Lipics, v. 237
    Doi: 10.4230/LIPIcs.ITP.2022.11
    •
  • Edmonds, C. and Paulson, LC., 2021. A Modular First Formalisation of Combinatorial Design Theory Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, v. 12833 LNAI
    Doi: 10.1007/978-3-030-81097-9_1
    •

    Journal articles

  • Edmonds, C., Koutsoukou-Argyraki, A. and Paulson, LC., 2023. Formalising Szemerédi’s Regularity Lemma and Roth’s Theorem on Arithmetic Progressions in Isabelle/HOL Journal of Automated Reasoning, v. 67
    Doi: 10.1007/s10817-022-09650-2
    •
    Theses / dissertations

    2024 (No publication date)

  • Edmonds, C., 2024 (No publication date). Formalising Combinatorial Structures and Proof Techniques in Isabelle/HOL
    Doi: 10.17863/CAM.108886
    •
    Conference proceedings

    2024

  • Edmonds, C. and Paulson, LC., 2024. Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma Cpp 2024 Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs Co Located with Popl 2024,
    Doi: 10.1145/3636501.3636946
    •

    2023

  • Koutsoukou-Argyraki, A., Bakšys, M. and Edmonds, C., 2023. A Formalisation of the Balog-Szemerédi-Gowers Theorem in Isabelle/HOL Cpp 2023 Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs Co Located with Popl 2023,
    Doi: 10.1145/3573105.3575680
    •

    2022

  • Edmonds, C. and Paulson, LC., 2022. Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics Leibniz International Proceedings in Informatics Lipics, v. 237
    Doi: 10.4230/LIPIcs.ITP.2022.11
    •
  • Edmonds, C. and Paulson, LC., 2022. Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics 13th International Conference on Interactive Theorem Proving (2022). 11:1-11:19,
    •

    2021

  • Edmonds, C. and Paulson, LC., 2021. A Modular First Formalisation of Combinatorial Design Theory Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, v. 12833 LNAI
    Doi: 10.1007/978-3-030-81097-9_1
    •
    Journal articles

    2023

  • Edmonds, C., Koutsoukou-Argyraki, A. and Paulson, LC., 2023. Formalising Szemerédi’s Regularity Lemma and Roth’s Theorem on Arithmetic Progressions in Isabelle/HOL Journal of Automated Reasoning, v. 67
    Doi: 10.1007/s10817-022-09650-2
    •
    Read more at: Paris Flood

    Paris Flood

    Read more at: Mahwish Arif

    Mahwish Arif

    I am a PhD candidate at Hughes Hall, University of Cambridge and my research focuses on analysing existing and emerging software  security threats and develop a software framework that allows developers to quickly and efficiently develop security solutions against these attacks. 

    Datasets

  • Arif, M., Ainsworth, S. and Jones, T., 2025. Research data supporting "Janitizer: Rethinking Binary Tools for Practical and Comprehensive Security"
    Doi: 10.17863/CAM.113967
    •
  • Arif, M., Zhou, R., Ho, H. and Jones, TM., 2021. Research data supporting "Cinnamon: A Domain-Specific Language for Binary Profiling and Monitoring"
    Doi: 10.17863/CAM.62760
    •

    Conference proceedings

  • Arif, M., Zhou, R., Ho, HM. and Jones, TM., 2021. Cinnamon: A Domain-Specific Language for Binary Profiling and Monitoring Cgo 2021 Proceedings of the 2021 IEEE ACM International Symposium on Code Generation and Optimization,
    Doi: 10.1109/CGO51591.2021.9370313
    •
  • Arif, M. and Vandierendonck, H., 2018. Reducing the burden of parallel loop schedulers for many-core processors Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming,
    Doi: 10.1145/3178487.3178517
    •
  • Arif, M., Vandierendonck, H., Nikolopoulos, DS. and de Supinski, BR., 2016. A scalable and composable map-reduce system 2016 IEEE International Conference on Big Data (Big Data),
    Doi: 10.1109/bigdata.2016.7840854
    •
  • Vandierendonck, H., Murphy, K., Arif, M. and Nikolopoulos, DS., 2016. HPTA: High-performance text analytics 2016 IEEE International Conference on Big Data (Big Data),
    Doi: 10.1109/bigdata.2016.7840632
    •

    Journal articles

  • Lee, J., Vandierendonck, H., Arif, M., Peterson, GD. and Nikolopoulos, DS., 2018. Energy-Efficient Iterative Refinement Using Dynamic Precision IEEE Journal on Emerging and Selected Topics in Circuits and Systems, v. 8
    Doi: 10.1109/jetcas.2018.2850665
    •
    Datasets

    2025

  • Arif, M., Ainsworth, S. and Jones, T., 2025. Research data supporting "Janitizer: Rethinking Binary Tools for Practical and Comprehensive Security"
    Doi: 10.17863/CAM.113967
    •

    2021

  • Arif, M., Zhou, R., Ho, H. and Jones, TM., 2021. Research data supporting "Cinnamon: A Domain-Specific Language for Binary Profiling and Monitoring"
    Doi: 10.17863/CAM.62760
    •
    Conference proceedings

    2021

  • Arif, M., Zhou, R., Ho, HM. and Jones, TM., 2021. Cinnamon: A Domain-Specific Language for Binary Profiling and Monitoring Cgo 2021 Proceedings of the 2021 IEEE ACM International Symposium on Code Generation and Optimization,
    Doi: 10.1109/CGO51591.2021.9370313
    •

    2018

  • Arif, M. and Vandierendonck, H., 2018. Reducing the burden of parallel loop schedulers for many-core processors Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming,
    Doi: 10.1145/3178487.3178517
    •

    2016

  • Arif, M., Vandierendonck, H., Nikolopoulos, DS. and de Supinski, BR., 2016. A scalable and composable map-reduce system 2016 IEEE International Conference on Big Data (Big Data),
    Doi: 10.1109/bigdata.2016.7840854
    •
  • Vandierendonck, H., Murphy, K., Arif, M. and Nikolopoulos, DS., 2016. HPTA: High-performance text analytics 2016 IEEE International Conference on Big Data (Big Data),
    Doi: 10.1109/bigdata.2016.7840632
    •
    Journal articles

    2018

  • Lee, J., Vandierendonck, H., Arif, M., Peterson, GD. and Nikolopoulos, DS., 2018. Energy-Efficient Iterative Refinement Using Dynamic Precision IEEE Journal on Emerging and Selected Topics in Circuits and Systems, v. 8
    Doi: 10.1109/jetcas.2018.2850665
    •
    Read more at: Justas Brazauskas

    Justas Brazauskas

    You can reach me at jb2328 [at] cam.ac.uk

    My personal webpage is justas.xyz where you can find more information about my work.

    Justas is a postgrad student at the Department of Computer Science and Technology (Computer Lab), University of Cambridge (funded by Sensors CDT). His interests span the Internet of Things, Human-Computer Interaction and Digital Twins.

    The tentative title of my doctoral dissertation is Human-centric Design of Real-time Digital Twins.

    Department of Computer Science and Technology
    University of Cambridge
    William Gates Building
    15 JJ Thomson Avenue
    Cambridge
    CB3 0FD

    About the department

    Study here
    Research
    News
    Jobs
    How to get here
    About the department

    Contact us

    Website privacy policy

    Social media

    Athena Swan bronze award logo

    Study at Cambridge

    About the University

    Research at Cambridge