Find Academic Supervisors

• Artificial Intelligence
• Strategic Reasoning in Multi-Agent Systems
• Formal Verification
• +6 more

Aniello Murano is a Professor of Computer Science at the Department of Electrical Engineering and Information Technologies , University of Naples Federico II. He serves as Scientific Director of the ASTREA (Automated Strategic Reasoning) Laboratory and leads cutting-edge research in Artificial Intelligence, Strategic Reasoning, Multi-Agent Systems , and Formal Verification . Research Interests : Strategic reasoning under perfect/imperfect information, specification/verification/synthesis of reactive systems, temporal/modal logics, automata theory, parity games, game theory, mechanism design, and formal languages. Notable Projects : PNRR Research Unit Coordinator (2023-2025) on Resilient AI, PRIN 2020 Unit Coordinator (RIPER: Resilient AI-Based Self-Programming and Strategic Reasoning), H2020-MSCA SEAL (Principal Coordinator). Awards & Honors : JPMorgan Faculty Research Award (2022), Royal Society Award (2016), Best Paper PRIMA (2015), INDAM Project Leader (2023), Italian Scientific Habilitation (2017-2018). Students & Postdocs : Supervised 6 PhD students (e.g., Silvia Stranieri, Vadim Malvone) and mentored postdocs such as Munyque Mittelmann and Bastien Maubert. Laboratory : Leads ASTREA Lab, focusing on automated strategic reasoning and resilient AI systems.

Matthew HagueView profile

Professor

• Infinite-State Verification
• Higher-Order Recursion
• Counter Systems
• +9 more

Matthew Hague is a Professor at the Department of Computer Science, Royal Holloway University of London. His research focuses on theoretical and practical aspects of infinite-state verification, with a particular emphasis on higher-order recursion and counter systems. Education: MEng in Computing, Imperial College London DPhil (PhD) in Computer Science, University of Oxford Research Interests: Matthew's work spans infinite-state systems verification , higher-order program analysis , string constraint solving , and pushdown automata . He develops practical tools like Ostrich (for string constraints), C-SHORe (for HORS analysis), TreePed (for CSS optimization), and PDSolver (for pushdown parity games). Scientific Contributions: His recent work includes symbolic Parikh's theorem applications (2024), regex-dependent string constraint solving (2022), collapsible pushdown parity games (2021), and path feasibility analysis with integer data types (2020). These span formal methods, automata theory, and programming language design. Awards & Grants: EPSRC Early Career Fellowship (2013-2018) EPSRC Grant for String Constraint Solving (PI, 2019-2022) Academic Leadership: Matthew has supervised numerous PhD students including Emma Lieu and Jonathan Hoyland, and organized key conferences like BCTCS 2018 and ICALP 2026. He maintains active involvement in program committees for POPL, LICS, and MFCS. Laboratory Tools: He leads development of Ostrich (string constraint solver), PDSolver (pushdown system analysis), and C-SHORe (higher-order verification) tools.

• Theoretical Computer Science
• Automata Theory
• Formal Languages
• +4 more

Arnaud Carayol is a Professor of Computer Science at Gustave Eiffel University, where he has been working since September 2020. He is a member of the Models and Algorithms team at the Laboratoire d'informatique Gaspard Monge (LIGM). Prior to his current position, he was a full-time researcher at CNRS. His research focuses on theoretical aspects of computer science, with particular emphasis on: Automata Theory Formal Languages Logic in Computer Science Model Checking Pushdown Systems Games on Infinite Structures Professor Carayol's recent publications demonstrate a consistent focus on automata theory, particularly on infinite trees and pushdown systems, with applications to verification and game theory. His work often explores the connections between formal languages, logic, and computational models, with a particular emphasis on decidability and complexity questions. The trend shows increasing sophistication in handling higher-order systems and probabilistic elements in computational models. He has served on program committees for numerous prestigious conferences including LICS, STACS, ICALP, and FOSSACS. Notably, he was PC Co-Chair and organizer for CIAA 2017 and PC Chair and organizer for FICS 2013. Professor Carayol has led significant research projects: Head of project AMIS (2011-2014) financed by ANR Head of project VAPF (2011-2012) financed by Digiteo Member of project LiFoundations (2018-2022) His research continues to advance our understanding of theoretical models in computer science, with implications for program verification, formal methods, and computational theory.

Olivier SerreView profile

Professor

• theoretical computer science
• automata theory
• formal languages
• +7 more

Olivier Serre is a CNRS Research Director working at the Institute for Research in Fundamental Computer Science (IRIF), a joint research unit of CNRS and University of Paris. Since September 2021, he serves as Deputy Scientific Director at the Institute for Information Sciences and Technologies (INS2I) at CNRS. His research focuses on theoretical computer science with particular emphasis on automata theory and formal verification frameworks. Dr. Serre completed his education at ENS Cachan (1999-2003) and earned his PhD in Computer Science from Paris-Diderot University (now University of Paris) in 2004. Following a postdoctoral position at RWTH Aachen, he joined LIAFA (now IRIF) as a research fellow in 2005 and became a CNRS Research Director in 2016. His academic journey reflects deep engagement with foundational theoretical problems and their practical verification applications. His research centers on automata theory and formal languages, with particular expertise in games and logic, infinite structures, and verification of higher-order functional programs. Dr. Serre has made significant contributions to collapsible pushdown systems, recursion schemes, and parity games, bridging theoretical foundations with practical applications in program verification. His work demonstrates exceptional depth in developing decision procedures for complex verification problems previously considered intractable. Dr. Serre's extensive publication record in premier theoretical venues shows consistent contribution to advancing the state of the art. His research trajectory reveals a clear evolution from foundational automata theory toward increasingly sophisticated systems involving higher-order computation and imperfect information, with notable breakthroughs in establishing decidability results for complex verification problems.