Find Academic Supervisors

Étienne AndréView profile

Professor

• Formal Methods
• Model Checking
• Verification of Concurrent Systems
• +12 more

Étienne André is a Full Professor at Université Sorbonne Paris Nord , affiliated with the Institut Galilée and the Laboratoire d’Informatique de Paris Nord (LIPN) . He leads the SAFER research team and has previously held professorial positions at Université de Lorraine . His work bridges formal verification and real-world applications in cyber-physical and distributed systems. PhD from ENS Cachan (2010) Postdoc at National University of Singapore (2010–2011) Associate Professor at Université Sorbonne Paris Nord (2011–2019) Full Professor at Université de Lorraine (2019–2022) Full Professor at Université Sorbonne Paris Nord (2022–present) His research centers on formal verification of concurrent and real-time systems, with a focus on parametric timed model-checking . He investigates how systems behave under timing uncertainty and develops methods to synthesize safe timing parameters. His work extends to monitoring cyber-physical systems and detecting side-channel attacks using quantitative formal methods. He is a strong advocate for sustainable research , minimizing carbon footprint through reduced air travel. The recent publications reflect a consistent trajectory in parametric verification , real-time systems , and model checking , with increasing emphasis on distributed and probabilistic approaches. His tools like IMITATOR and InSPEQTor enable practical application in industrial and academic settings. PhD Award, Académie Lorraine des Sciences (2024) Étienne André has supervised several PhD students and postdoctoral researchers. He leads major research projects such as ProMiS , MoCcA , and PACS , funded by ANR, PHC, and other international agencies. His collaborative work spans France, Singapore, Poland, and Japan. He is deeply involved in the formal methods community, serving on steering committees for SynCoP and Petri Nets , and organizing conferences such as ETAPS and ICFEM . He has participated in over 30 program committees, including FORTE , TACAS , and HSCC .

Jan Friso GrooteView profile

Professor

• Formal Methods
• Verification Technology
• Software Engineering
• +12 more

Jan Friso Groote is a Full Professor and Chair of the Formal System Analysis group in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e). He also holds professorial roles in the EAISI Foundational and EAISI High Tech Systems institutes. Since 2016, he has been working part-time at ASML, contributing his expertise in formal verification to industrial applications. Education: Born in 1965, studied Computer Science at Twente University of Technology (now University of Twente), 1983–1988. PhD in 1991 from the University of Amsterdam with thesis 'Process algebra and structured operational semantics', based on research at CWI (Centrum Wiskunde en Informatica). Jan Friso Groote is a leading researcher in formal methods and software verification. His work focuses on enabling the development of flawless software through rigorous formal analysis. Key research areas include structural operational semantics, model checking, branching bisimulation, protocol verification, and the development of the mCRL2 toolset. His current goal is to integrate formal techniques into complete software system design, improving both development speed and quality. His research has demonstrated that formal methods can reduce development time by a factor of three and increase quality tenfold, with potential for zero-defect software. His recent publications demonstrate sustained contributions in formal verification, including work on mutual exclusion algorithms, industrial control system modeling, probabilistic systems, and efficient bisimulation algorithms. The articles span topics such as tunnel control systems, simulation lower bounds, and formal methods for critical systems, reflecting both theoretical depth and practical application. Scientific Awards: Best Paper Award FACS 2018 FMICS-AVoCS Best Paper Award (2017) Jan Friso Groote has held significant leadership roles in education, including Director of Education for Computer Science (2000–2010) and for multiple bachelor’s and master’s programs. He has advised numerous researchers and supervised a large body of research output (over 320 publications). He leads the Formal System Analysis group and has been involved in projects such as 'Composable Embedded Systems for Healthcare'. His work bridges academia and industry, particularly through collaborations with ASML and Rijkswaterstaat, and he has been a visiting researcher at institutions across Europe and China. He is a key contributor to the mCRL2 toolset, which supports modeling and verification of software behavior with data, time, and probabilities. His research fingerprints highlight strong expertise in model checking, transition systems, software design, and process algebra. He teaches courses such as System Validation, Embedded Software, and Capita Selecta in Formal System Analysis.

• Formal Methods
• Probabilistic Systems
• Model Checking
• +3 more

Joost-Pieter Katoen is a Full Professor at the Digital Society Institute and Formal Methods and Tools department. His research focuses on formal methods, probabilistic systems, and model checking, with applications in automated verification and Markov models. He has been actively involved in international conferences like FM 2023 and has collaborated globally on safety-critical systems analysis. Research Interests: Katoen’s work bridges theoretical foundations with practical tools, including parameter synthesis in probabilistic systems, fault tree analysis, and Bayesian network optimization. His contributions span algorithm design for model checking and probabilistic program verification. Awards: Received the Beste paper award in 2018 for contributions to uncertainty management in probabilistic programming. Advising & Grants: Supervised 10 academic works and contributed datasets for tools like Prophesy and SAFEST. Active in organizing events such as the 2017 Symposium on Model-Ed, Test-Ed, and Trust-Ed.

Pascale Le GallView profile

Researcher

• Computer Science
• Formal Methods
• Conformance Testing
• +6 more

Pascale Le Gall is an active researcher specializing in formal methods and computer science, with primary research conducted through the Mathematics and Computer Science for Complexity and Systems laboratory. Their work spans theoretical computer science, software engineering, and interdisciplinary applications in biological systems modeling. Le Gall's research focuses on formal verification techniques, particularly in conformance testing, symbolic execution, and graph transformations. Their work bridges theoretical computer science with practical applications in distributed systems verification, geometric modeling, and biological network analysis. Key research themes include developing frameworks for stochastic process discovery, feature interaction resolution, and topological operations in geometric modeling, demonstrating both theoretical depth and practical implementation value across multiple domains. Analysis of their recent publications reveals a strong trend toward interdisciplinary applications of formal methods, particularly in biological systems. Their work increasingly integrates statistical approaches with traditional formal verification techniques, as seen in Bayesian inference for process discovery and statistical model checking of biological pathways. The research shows consistent development of symbolic execution techniques applied to increasingly complex systems, from abstract data types to distributed biological networks. Pascale Le Gall maintains active collaborations with researchers including Christophe Gaston, Marc Aiguier, and Paolo Ballarini across multiple projects. Their publication record shows consistent output with significant contributions to model-based testing frameworks, geometric modeling using graph transformations, and formal analysis of biological systems. The researcher has contributed to both theoretical foundations and practical implementations of verification techniques, with numerous conference papers and journal articles spanning over 15 years of active research.

Jeremy AvigadView profile

Professor

• Formal Methods
• Automated Reasoning
• Mathematical Logic
• +7 more

Jeremy Avigad is a Professor in the Department of Philosophy and the Department of Mathematical Sciences at Carnegie Mellon University, where he serves as Director of the Hoskinson Center for Formal Mathematics and holds a Dean's Chair in Logic and Philosophy of Mathematics. His primary research interests include Formal Methods and AI for mathematics, mathematical logic, and the history and philosophy of mathematics. His work bridges deep theoretical inquiry with practical applications, particularly in formal verification and automated reasoning. His recent publications reflect a strong focus on the formalization of mathematics, automated reasoning, and the integration of AI techniques into theorem proving. Key themes include the development and application of the Lean theorem prover, premise selection, proof optimization, and the formal verification of computational claims, especially in the context of blockchain technology. CADE-25 Skolem Award Avigad advises PhD students, such as Chase Norman, and is involved in significant research grants and collaborations, including work with StarkWare. He is an active organizer of major academic events like Big Proof and the Formalization of Mathematics workshops. He leads the Hoskinson Center for Formal Mathematics, a research hub dedicated to advancing the field of formal mathematics.

• Modal Logic
• Coalgebra
• Automated Reasoning
• +3 more

Prof Dirk Pattinson is a Professor in the School of Computing at Australian National University (ANU). His research focuses on modal logic, coalgebraic systems, automated reasoning, and formal methods. He holds a PhD in Computer Science and has supervised numerous research students. Research interests include coalgebraic logic, non-classical modal logics, automated theorem proving, and applications in computational social choice. His work bridges theoretical foundations with practical tools like the COOL reasoner for modal fixpoint logics. Notable contributions span over 70 peer-reviewed publications since 2008, with recent work on non-iterative modal resolution calculi (2024), Hennessy-Milner properties via topological methods (2022), and formal verification of voting systems (2021). His research often integrates algebraic, categorical, and coalgebraic perspectives.

• Synthesis and Verification
• Probabilistic Model Checking
• Performance Modelling
• +2 more

Dr. Alexandros Evangelidis is a Research Associate at the Department of Computer Science, University of York. He holds a PhD in Computer Science from the University of Birmingham (2020) and is a Fellow of the Higher Education Academy (FHEA). His research focuses on synthesis and verification techniques, probabilistic model checking, performance modeling, state estimation, and the application of machine learning in verification. Prior to his current role, he served as a Postdoctoral Researcher at the Technical University of Munich (2020–2023) and a Teaching Fellow at the University of Birmingham (2018–2020). His work emphasizes interdisciplinary approaches, blending formal methods with practical applications in areas like cloud computing and robotics. Notable contributions include advancements in MDP controller synthesis (MULTIGAIN 2.0), hybrid task planning for human-robot collaboration, and quantitative verification of Kalman filters. His publications reflect a strong focus on algorithmic innovation and rigorous validation of complex systems. No specific scientific awards or grants are explicitly mentioned, but his active research roles indicate sustained engagement in cutting-edge projects. He is affiliated with the Automated Software Engineering research group at York, contributing to topics such as model-driven engineering and distributed systems scalability.

Ioannis StefanakosView profile

Academic

• Formal Verification
• Robotics Safety
• Autonomous Systems
• +3 more

Ioannis Stefanakos is a Research Associate at the Department of Computer Science, University of York, affiliated with the High Integrity Systems research group. His work focuses on formal verification of autonomous systems, safety-critical robotics, and software performance analysis. Current projects include assurance frameworks for drones, adaptive reinforcement learning in healthcare robotics, and probabilistic modeling of software performance. Recent research emphasizes interdisciplinary applications in UAV systems, medical decision support systems, and collaborative manufacturing robots. No academic awards are listed, though his work has been published in top-tier conferences. Advising and grants details are not explicitly stated, but his involvement in doctoral forum papers suggests potential supervision roles in software systems research.

Mark SantolucitoView profile

Assistant Professor

• Program Synthesis
• Computer Music
• DevOps
• +4 more

Mark Santolucito is an Assistant Professor of Computer Science at Barnard College, Columbia University. He holds a PhD in Computer Science from Yale University, where his research focused on program synthesis and computer music. His current work explores program synthesis techniques to enhance programmer productivity, particularly in lowering barriers to entry for underrepresented groups and optimizing workflows for advanced developers. He leads the Barnard PL (Programming Languages) Labs, which develops tools like TSL (Temporal Stream Logic) for synthesizing reactive systems and analyzing infrastructure-as-code (IaC). His research intersects formal methods with creative applications in music and live coding, emphasizing accessibility and usability. Education: PhD in Computer Science (Yale University), focusing on program synthesis and computer music. Research interests include program synthesis, temporal logic specifications, infrastructure configuration analysis, and music technology. He emphasizes human-centered design in his work, aiming to make programming more accessible through tools like TSL and interactive synthesis environments. Projects include TSL Move Cube, Block-based Editor for Temporal Logic, and Spiral Analysis for medical software migration. Notable contributions include developing TSL synthesis pipelines, optimizing Arduino configurations, and exploring static analysis for cost prediction in cloud deployments. His work bridges theoretical foundations with practical applications in both software engineering and creative computing. Labs/Teams: Leads Barnard PL Labs, collaborating on projects like TSL Synthesis Engine and Static Analysis for IaC. Active in workshops such as SEConfig and FMCAD.

Abhijit MazumdarView profile

Research Fellow

• Markov Decision Processes
• Safety Verification
• Reinforcement Learning
• +5 more

Abhijit Mazumdar serves as a Research Fellow in the Department of Electronic Systems within Aalborg University's Faculty of IT and Design. He is actively affiliated with the Automation & Control Learning and Decisions Lab, focusing on theoretical and applied aspects of safety-critical decision systems. His research centers on Markov Decision Processes , safety verification , and reinforcement learning with critical applications in control systems. Key interests include stochastic safety analysis of hybrid systems, constrained optimization under uncertainty, and model-free safety verification techniques that prevent safety violations during learning. His work bridges theoretical computer science with practical engineering implementations in autonomous systems. Recent publications demonstrate a strong trend toward formal safety guarantees in learning-based control, with 75% of his 2023-2024 output addressing safety verification for Markovian systems. His fingerprint analysis shows dominant specialization in Computer Science (100%) and Engineering (100%) , particularly in safety-critical domains where theoretical rigor meets real-world implementation constraints. Dr. Mazumdar collaborates extensively within Aalborg University's technical ecosystem, particularly with researchers in control theory and formal methods. His laboratory work in the Automation & Control Learning and Decisions Lab focuses on developing mathematically rigorous frameworks for safe decision-making in uncertain environments.

Pablo Francisco CastroView profile

Professor

• Logic in Computer Science
• Fault-Tolerance
• Computational Complexity
• +4 more

Pablo Francisco Castro is a Professor and current Chair of the Department of Computer Science at Argentina's National University of Rio Cuarto (UNRC), while simultaneously serving as a Researcher at the Argentinean National Research Council (CONICET). His dual-role positions demonstrate significant academic leadership in both institutional administration and national research infrastructure. His educational foundation includes: Licenciatura in Computer Science from UNRC PhD in Computer Science from McMaster University, Canada Castro's research program centers on the theoretical and practical applications of logic to computing systems, with deep specialization in fault-tolerance mechanisms, computational complexity theory, and functional programming paradigms using Haskell and Python. His work bridges abstract logical frameworks with concrete implementation challenges, particularly in concurrent systems verification and probabilistic reasoning models. His 2023 JELIA conference publication on satisfiability bounds for adaptive knowing-how logic exemplifies his research trajectory toward formalizing complex cognitive processes within computational models, revealing consistent focus on the intersection of epistemic logic, AI reasoning, and computational tractability. While no specific awards are documented in the provided materials, his extensive service as program committee member for premier conferences (FM, CONCUR, CLEI) and reviewer for top-tier journals (Artificial Intelligence, IEEE Transactions) indicates substantial peer recognition within the formal methods community. No information regarding student advisement or research grants appears in the source texts. Similarly, no dedicated laboratory structures or formal research teams are explicitly described, though his GitHub repositories suggest independent tool development aligned with his publication topics.

César SánchezView profile

Professor

• Formal Methods
• Computer Science
• Logic
• +6 more

César Sánchez is a Full Professor at the IMDEA Software Institute , where he has been since 2007. He earned his Ph.D. in Computer Science (2007) and M.S. in Computer Science (2001) from Stanford University , and a M.Eng in Telecommunication Engineering from Universidad Politécnica de Madrid (1998). His academic career includes promotions to Associate Professor in 2012 and Full Professor in 2023. Research Interests Formal Methods Temporal Logics for Hyperproperties Reactive Synthesis Modulo Theories Blockchain and Smart Contract Reasoning Runtime Verification of Real-Time Systems Neurosymbolic Formal Methods His publications span 15 recent works (2023-2025) focusing on formal verification of systems using temporal logics , reactive synthesis , and blockchain applications . Key trends include asynchronous hyperproperty analysis , anticipatory monitoring , and shield synthesis for DRL and blockchain systems. Service & Collaboration Program Committee Member: CAV'25, ATVA'24, TACAS'24, DAPPS'23 Collaborations with institutions like Stanford, IMDEA, and Nature César actively recruits researchers (interns, PhD students, postdocs) for his group at IMDEA, focusing on hyperproperties, reactive synthesis, and blockchain verification.

Rohit ChadhaView profile

Associate Professor

• Computer Security
• Formal Methods
• Program Analysis
• +5 more

Rohit Chadha is an Associate Professor in the Department of Electrical Engineering and Computer Science at the University of Missouri and serves as the Director of the Mizzou Cybersecurity Center . His research focuses on formal methods and their application to cybersecurity , particularly in verifying differential privacy mechanisms and randomized security protocols . Education : PhD from the University of Pennsylvania, BTech from the Indian Institute of Technology, Delhi Previous Positions : INRIA Saclay (France), University of Illinois at Urbana-Champaign, Instituto Superior Tecnico (Portugal), University of Sussex (UK) Research Interests include automated verification of security hyperproperties , probabilistic automata , and quantitative information flow . His work addresses privacy risks in aggregate data and AI-driven battlefield communication systems. Publication Trends show a focus on differential privacy verification , zero-trust architectures , and model checking of probabilistic systems. He has contributed to security frameworks for military applications and educational initiatives using collegiate competitions. Scientific Awards : NSF CAREER Award (2016) NSF SHF: Medium Grant (2019) NSF TWC: Medium Grant (2013) Rohit leads the Mizzou Cybersecurity Center , collaborating with industry partners through its Industrial Advisory Board . His research integrates formal verification with practical cyber defense applications.

• Modeling and Verification of Reactive Systems
• Quantitative Analysis of Stochastic Systems
• Probabilistic Model Checking
• +8 more

Christel Baier is a full Professor and head of the Chair for Algebraic and Logic Foundations of Computer Science at the Faculty of Computer Science, Technische Universität Dresden, a position she has held since 2006. She previously served as an associate professor for Theoretical Computer Science at the University of Bonn from 1999 to 2006. She is currently the dean of the Faculty of Computer Science at TU Dresden (2025–2027), having been vice-dean from 2019 to 2024. She holds a Diploma in Mathematics (1990), a Ph.D. in Computer Science (1994), and a Habilitation (1999), all from the University of Mannheim. In 2022, she was awarded an honorary doctorate from RWTH Aachen. Her research centers on formal methods in computer science, with a strong emphasis on modeling, specification, and verification of reactive and stochastic systems. She is a leading expert in probabilistic model checking, temporal and modal logics, automata over infinite structures, game theory, and the verification of infinite-state systems. Her work bridges theoretical foundations with practical applications in system reliability and correctness. The recent publications and edited volumes reflect a consistent focus on formal verification, logic in computer science, and tools for system analysis. Her editorial leadership in major venues such as LICS, TACAS, and FoSSaCS underscores her influence in shaping the research agenda in theoretical computer science and formal methods. Jean-Claude Laprie Award in Dependable Computing (2023) Honorary doctorate from RWTH Aachen (2022) Member of Academia Europaea (since 2011) Editor-in-Chief of Acta Informatica (2015–2022) Steering Committee Member of LICS, FoSSaCS, FORTE, and FSEN Extensive service on program committees of top-tier conferences including CAV, CONCUR, and ICALP Christel Baier has advised numerous PhD and master’s students (though not explicitly listed), and has led major research projects funded by DFG, EU, and DAAD. She has organized pivotal events such as CONCUR'06, TACAS'15, and LICS'22. She is actively involved in academic governance, serving on the senate of TU Dresden (2015–2020), as ombudsperson for the Department of Computer Science, and on the Scientific Advisory Board of Schloss Dagstuhl. Her leadership in the German Excellence Initiative and DFG Research Training Groups highlights her role in shaping national research agendas.

• Verification
• Probabilistic Models
• Infinite-State Systems
• +2 more

Mahsa Shirmohammadi is a CNRS researcher at Institut de Recherche en Informatique Fondamentale (IRIF) , Université de Paris. Her research focuses on verification, probabilistic models, infinite-state systems, automata theory, and numerical computation. Education : PhD from LSV, ENS de Cachan (France) and ULB (Belgium). Previous Affiliation : Postdoctoral researcher at University of Oxford (UK). Her work addresses stochastic games , timed automata , matrix groups , and algebraic computation . Recent publications analyze strategy complexity, synchronization in decision processes, and parametric algebraic problems. Key collaborators include Stefan Kiefer, Richard Mayr, James Worrell, and Patrick Totzke. Her research has been published in venues like ACM SIGLOG News, ICALP, LICS, and ISSAC. Contact: mahsa@irif.fr , +33 (0)1 57 27 92 29, Office 4017 (Sophie Germain building, Paris).