Find Academic Supervisors

Christine Rizkallah is a Senior Lecturer in the School of Computing and Information Systems at the University of Melbourne, Australia. She joined the university in December 2021 after serving as a Lecturer at the University of New South Wales (UNSW) from April 2018 to December 2021. Her research focuses on interactive theorem proving, formal verification, programming languages, and systems, with an emphasis on building practical tools for high-assurance software development. She leads a research group working on the Cogent and Dargent languages, aiming to reduce the burden of formal verification in systems programming. Education: PhD in Computer Science, Universität des Saarlandes and Max-Planck-Institut für Informatik, Germany (2015), thesis: Verification of Program Computations , supervised by Prof. Dr. Kurt Mehlhorn. MSc in Computer Science, Universität des Saarlandes, Germany (2009), thesis: Proof Representations for Higher Order Logic , supervised by Prof. Dr. Gert Smolka and Dr. Chad E. Brown. BSc in Computer Science, German University in Cairo, Egypt (2007), thesis: X2-Planner: A Hierarchical Task Network Planner for Real Time Gaming Applications , supervised by Prof. Dr. Slim Abdennadher and Dr. Thorsten Maier. Her research interests lie at the intersection of programming languages and formal methods. She develops domain-specific languages with strong type systems and verified compilers to enable trustworthy software systems. Her work spans algorithms, logic, security, and social choice theory, reflecting a strong interdisciplinary approach. She has published extensively in top venues such as POPL, ICFP, ASPLOS, JAR, and PACMPL, with a focus on certifying compilation, refinement verification, and mechanized reasoning. Her recent publications reveal a consistent focus on formal verification of systems software, particularly through the Cogent language and its ecosystem. Key themes include verified data layout refinement (Dargent), property-based testing, termination analysis, cost modeling, and integration with foreign functions. Her work combines theoretical rigor with practical implementation, often involving mechanized proofs in Isabelle/HOL and Coq. Scientific Awards and Recognition: Distinguished Artefact Award at SLE'22 (awarded to Zilin Chen for work under her supervision). First Prize, SPLASH'22 Student Research Competition (undergraduate), won by Raphael Douglas Giles. Second Prize, ACM-wide Student Research Competition (undergraduate, 2023), won by Raphael Douglas Giles. She has supervised numerous PhD, Masters, and Honours students, many of whom have continued in academia or industry research roles. She has received research funding through institutional support and collaborative grants, though specific grants are not detailed in the provided text. She is actively involved in the programming languages community, serving on program committees for POPL, ICFP, CPP, PLDI, and others, and holding leadership roles such as Program Chair for FUNARCH'25 and Diversity and Inclusion Co-Chair for PLDI'25. She teaches core courses including Declarative Programming and Models of Computation at the University of Melbourne. She leads a vibrant research team and collaborates widely across institutions including UNSW, University of Pennsylvania, and international partners. Her lab focuses on building verified systems using functional programming and formal methods, with strong ties to the DeepSpec project and the Isabelle/HOL community.

• Interactive Theorem Proving
• Formal Verification
• Programming Languages
• +7 more

Dr. Peter J. Robinson is an Honorary Research Fellow at the School of Electrical Engineering & Computer Science, The University of Queensland. His academic career spans over three decades, focusing on foundational research in programming languages, formal methods, and distributed systems. His work includes contributions to Qu-Prolog, a multi-threaded Prolog implementation, and TeleoR, a robotic task programming framework. Research interests include agent-based systems, blockchain security for aerospace applications, software verification, concurrent programming, and education technology. Notable projects include the Pedro publish/subscribe server and MyPyTutor, an interactive Python learning tool. He has collaborated on railway safety protocols and spacecraft control systems using blockchain. Publications span journals like Formal Aspects of Computing and conferences such as IEEE Symposium on Computers and Communications. Technical reports include work on unification algorithms and multi-agent verification frameworks. He has advised on projects involving IoT architectures and swarm intelligence simulations.

• Computer Science
• Software Verification
• Formal Methods
• +6 more

Dr. Zoltan Kocsis is a mathematical logician and educator based at the University of New South Wales (UNSW), where he currently holds the position of Adjunct Lecturer. His research spans multiple areas including proof theory, nonstandard analysis, category theory, and computational logic, with a focus on logical verification, degree of satisfiability, and structured decompositions. PhD in Mathematics from the University of Manchester (2019) Adjunct Lecturer at UNSW Work with interactive theorem proving software like Agda Dr. Kocsis' work on degree of satisfiability explores the probability of logical formulas holding in algebraic structures, revealing gaps in equations from Heyting algebras to group theory. His research on structured decompositions and spined categories provides categorical frameworks for fixed-parameter tractability and tree-width generalizations. In formal verification, he contributed to the seL4 kernel on RISC-V architecture. Recent publications include Proof-theoretic methods in quantifier-free definability (2025), Apartness relations between propositions (2024), and Degree of satisfiability in Heyting algebras (2024). Earlier works cover pseudo-random sequences, homology, and nonstandard analysis in group theory. He has received the CSIRO SCS Engineering and Technology award (2021) and the IBM Prize (2018) for his contributions to logical satisfiability. His collaborations include work with Ben Bumpus on spined categories and Jade Master on structured decompositions, alongside teams at CSIRO and Tallinn University of Technology.

• Mathematical Logic
• Set Theory
• Lattices
• +28 more

Murray Elder is a Professor at the University of Technology Sydney, affiliated with the School of Mathematical and Physical Sciences. His research focuses on geometric group theory, complexity theory, automata and formal language theory, enumerative combinatorics, and pattern-avoiding permutations. He serves as a Managing Editor for the Journal of Groups, Complexity, Cryptology and has held roles such as member of the Australian Research Council College of Experts (2019–2021) and the Council of the Australian Mathematical Society (2021–2023). Dr. Elder has led multiple funded research projects, including grants on geodetic groups, computational complexity in algebra, and symmetries in relational structures. His work explores foundational problems at the intersection of algebra and computer science, emphasizing algorithmic and geometric approaches to group theory. His research outputs highlight advancements in understanding group structures through computational and combinatorial lenses, with recent contributions focusing on EDT0L languages, geodesic properties of Cayley graphs, and isomorphism problems in plain groups. He actively contributes to academic leadership and editorial roles, shaping the direction of theoretical computer science and mathematics. Dr. Elder supervises postgraduate research in areas aligning with his expertise, fostering innovation in geometric and algorithmic group theory. His interdisciplinary approach bridges pure mathematics and theoretical computer science, addressing challenges in both fields through collaborative and innovative methodologies.

• Geometric Group Theory
• Complexity Theory
• Automata and Formal Language Theory
• +2 more

Dr. Michael Norrish is an Associate Professor at The Australian National University , affiliated with the School of Computing and the Mathematical Sciences Institute . He specializes in formal methods, interactive theorem proving (particularly with the HOL4 system), and formal semantics for complex systems. His work emphasizes rigorous software verification and foundational computer science research. Dr. Norrish holds a PhD in Computer Science from the University of Cambridge (1999) , along with a BA and BSc(Hons) from Victoria University of Wellington. His research has led to significant contributions in verified compilers (e.g., CakeML), formalized algorithms (e.g., AKS primality test), and reproducibility challenges in scientific software. Research Interests include: - Formal verification of theorem provers - Verified systems programming - Machine learning integration in automated reasoning - Reproducibility in computational research His recent articles focus on advancing theorem proving tools (e.g., HOL4), reproducibility debt in scientific software, and verified compiler frameworks like PureCake and Pancake. He co-organized the 15th International Conference on Interactive Theorem Proving (ITP 2024) and leads projects on AI trustworthiness in Health, Safety & Environment (Tech4HSE). Current projects include: - Tech4HSE: AI Trust & Trustworthiness (ANU, 2024–2029) - Formalization of mathematical algorithms in HOL4

• Formal Methods
• Interactive Theorem Proving
• Formal Semantics
• +3 more

Dr Johannes Aman Pohjola is an education-focused academic affiliated with the University of New South Wales, School of Computer Science and Engineering. He holds a PhD and MSc in Computer Science from Uppsala University, Sweden. Education: MSc (2010), PhD (2016), Uppsala University Affiliation: University of New South Wales, School of Computer Science and Engineering His research spans interactive theorem proving, program verification, and concurrency theory. Recent work includes verified systems programming (Pancake), compiler verification (PureCake), and formal semantics for HOL with ad-hoc overloading. Publications emphasize mechanized proofs and functional programming languages like CakeML. Scientific awards include the Best Paper Award at FORTE/DisCoTeC 2019. Collaborations with researchers in formal verification and systems programming highlight his interdisciplinary contributions.

• Interactive Theorem Proving
• Program Verification
• Concurrency Theory
• +3 more

Matthew Daggitt is a Lecturer in the Department of Computer Science and Software Engineering at the University of Western Australia (UWA), within the School of Physics, Maths and Computing. He holds a PhD in Computer Science from the University of Cambridge (2019), focusing on algebraic routing theory. Previously, he worked at Curtin University and Heriot-Watt University. His research emphasizes formal verification of software correctness, particularly in neural-symbolic systems and distributed algorithms. He leads the development of Vehicle , a tool for end-to-end verification of hybrid neural-symbolic programs. He also maintains the Agda theorem prover’s standard library and explores computational geology, such as zircon analysis for geological dating. Education: PhD in Computer Science (University of Cambridge, 2019). Research Interests: Formal verification, neural networks, automated reasoning, neuro-symbolic systems, distributed algorithms, and routing protocols. His work bridges theoretical foundations with practical tools like Vehicle, enabling rigorous verification of machine learning and classical software integration. Research Trends: Recent publications focus on neural network verification challenges, geological applications of zircon analysis, and advances in formal methods for AI safety. Collaborations span computer science and geology, reflecting his interdisciplinary approach. Advising & Projects: Accepts PhD students in formal verification and neural-symbolic systems. Active in open-source projects and tool development.

• Formal Verification
• Neural Networks
• Automated Reasoning
• +4 more

Associate Professor Mark Utting is affiliated with the University of Queensland (UQ), specifically within the School of Electrical Engineering and Computer Science. He holds the rank of Associate Professor and focuses on software verification, model-based testing, and programming language design. His academic journey includes roles at multiple Queensland universities, Waikato University (NZ), and the University of Franche-Comte (France). He earned his PhD from UNSW on object-oriented language semantics. Utting has authored over 80 publications and the book 'Practical Model-Based Testing: A Tools Approach.' His current research emphasizes verifying compilers, blockchain smart contracts, ARM64 binaries, and AI-generated code. Key projects include the Algorand Centre for Sustainability Informatics and the BASIL project on secure information-flow logics. His research spans formal methods, theorem proving, and software engineering. Utting leads supervision in areas like compiler verification and smart contract analysis, with active involvement in grants such as the 'Directed and Incremental Analysis for DevSecOps' project. Utting collaborates on interdisciplinary projects, including energy grid simulations and cybersecurity strategies. His work bridges academia and industry, with past experience in genomics and manufacturing software development.

• Software Verification
• Model-Based Testing
• Formal Methods
• +5 more

Dr. Jo Lane is affiliated with the Australian National University as a member of the John Curtin School of Medical Research . She collaborates with the Maddess Group , focusing on diagnostics for eye diseases, though her research spans multidisciplinary areas including mathematical logic, artificial intelligence, and automated reasoning. Academic Rank : Researcher Research Themes : Logic, theorem proving, constraint modelling, and AI Her recent work explores paraconsistent mathematics, relevant arithmetic, conflict-resolution algorithms for SAT solvers, and optimization techniques. She contributes to tools like Scavenger and Logic for Fun, bridging logic with problem-solving frameworks. Key article trends include advancements in automated reasoning (e.g., conflict-driven clause learning), applications of logic to AI planning (non-Markovian rewards), and interdisciplinary efforts connecting mathematical theory to computational methods. Dr. Lane’s collaborations and publications highlight expertise in logic, computational complexity, and medical diagnostics, though no explicit awards or student advising details are provided in the text.

• Mathematical Logic
• Artificial Intelligence
• Automated Reasoning
• +2 more