Find Academic Supervisors

• Computational Modeling
• Mathematics
• Education Systems
• +2 more

Patricia Engrácia is an Assistant Professor in the Department of Social and Business Sciences at Iscte - University Institute of Lisbon, where she also serves as Deputy Director of the School of Applied Digital Technologies. She holds a PhD in Mathematics from the University of Lisbon (2005-2009) and additional qualifications in Applied Mathematics. Engrácia is an Associate Researcher at ISTAR-Iscte - Research Center in Information Sciences, Technologies and Architecture, specializing in Computational Modeling of Systems. Her research spans computational modeling, mathematical logic, and education systems analysis. Engrácia's work includes foundational studies in proof theory and functional interpretation, as well as extensive research on educational outcomes, equity metrics, and student progression in Portuguese education systems. Engrácia's publications demonstrate two primary research trajectories: (1) theoretical work in mathematical logic and proof theory, focusing on bounded functional interpretations and their applications; and (2) applied education research analyzing student pathways, academic success indicators, and equity metrics in basic, secondary, and higher education systems. Her recent work emphasizes longitudinal studies of student outcomes and educational equity assessments. As an active researcher, she contributes to multiple institutional reports on education metrics while maintaining her foundational work in computational logic. Her affiliations with both technical (Applied Digital Technologies) and social science (Social and Business Sciences) departments reflect her interdisciplinary approach to computational modeling applications.

Amal AhmedView profile

Professor

• correct and secure compilation
• linking types for multi-language software
• typed compilation of dependent types
• +5 more

Amal Ahmed is a Professor in the Department of Computer Science at Northeastern University's College of Computer and Information Science. She is an active researcher and academic leader in programming languages, with significant contributions to type systems, compiler verification, and language interoperability. Her work bridges theoretical foundations with practical systems applications, particularly in the areas of gradual typing and secure compilation. Dr. Ahmed's research focuses on correct and secure compilation , linking types for multi-language software , typed compilation of dependent types , semantics and logical relations , gradual typing , and safe language interoperability . Her work explores how to formally verify compilers and ensure type safety across language boundaries, with applications to modern systems like WebAssembly. She has developed novel semantic approaches to application binary interfaces and language interoperability that provide strong security guarantees. Her recent publications show a consistent focus on formal methods for language design, with increasing attention to probabilistic programming and separation logic. She has made significant contributions to understanding how gradual typing systems can maintain parametricity and how borrowing concepts from Rust can be formally modeled. Her work on RichWasm demonstrates practical applications of her theoretical research to web technologies. Dr. Ahmed actively serves the programming languages community through leadership roles in major conferences. She has chaired program committees, organized workshops, and mentored students through the Programming Languages Mentoring Workshop (PLMW). Her involvement spans POPL, ICFP, PLDI, SPLASH, and related conferences, where she regularly presents research and participates in steering committees. As an educator and mentor, she has presented numerous talks on managing research, working with advisors, and navigating academic careers, particularly through the PLMW series. She has chaired doctoral symposia and served on review committees, demonstrating her commitment to developing the next generation of programming languages researchers.

Federico OlmedoView profile

Assistant Professor

• Program Verification
• Probabilistic Programming
• Language-Based Security
• +5 more

Federico Olmedo is an Assistant Professor at the Computer Science Department of the University of Chile, where he teaches courses like Program Analysis and Verification ( CC4101 ) and Discrete Mathematics for Computer Science ( CC3101 ). His research focuses on the semantics and verification of probabilistic programs , with applications in language-based security , differential privacy , and formal verification of cryptographic systems . Previously, he was a postdoctoral researcher at RWTH Aachen University and earned his PhD from the Technical University of Madrid in 2014. Research Interests : Program Verification Probabilistic Programming Language-Based Security Theorem Provers Quantum Computing Cryptographic Proofs Publications span formal methods for probabilistic programs, including weakest precondition calculi , runtime analysis of quantum programs , and machine-checked proofs for cryptographic protocols . Notable works include the Best Theory Paper Award at ECOOP 2016 and foundational research on conditioning in probabilistic programming . He co-developed the CertiCrypt and CertiPriv frameworks for verifying cryptographic proofs and differential privacy in Coq. Scientific Awards : ECOOP 2016 Best Theory Paper Award

• Formal Methods
• Graph Databases
• Property Graph Schema
• +5 more

Ştefania-Gabriela Dumbravă is an Associate Professor at Institut Polytechnique de Paris (ENSIIE/Samovar Laboratory). Her research focuses on formal methods for graph database algorithms , including schema design, query processing, and verification. She contributes to international standards through co-chairing VLDB 2026 Demonstration Track and organizing workshops like VLDB Summer School 2025 . Dumbravă serves on editorial boards (e.g., ACM Transactions on Database Systems ) and program committees for top-tier conferences ( SIGMOD , ICDE ). Research Interests include formal verification of graph databases , property graph schema constraints , certified inference engines , and distributed graph systems . She integrates proof assistants (Coq, Isabelle) with practical database development, emphasizing reliability and mechanical correctness . Her work spans theoretical foundations (e.g., category theory , type theory ) and real-world applications (e.g., transit accessibility analysis , SDN controllers ). Selected Scientific Awards : EASST Best Software Science Paper Award (ICGT 2025) SIGMOD Best Paper Award (2023) VLDB Best Regular Paper Runner-Up (2022) D4Gen Hackathon 3rd Prize Teaching includes Graph Databases , Functional Programming , and Formal Languages at ENSIIE, with additional roles at Université Paris-Saclay, ENS Lyon, and Université Rennes 1. She supervises research internships and participates in gender parity initiatives (e.g., Paris-Saclay Women & Science Mentorship Program).

Felipe Werndl TrevizanView profile

Senior Lecturer

• Artificial Intelligence
• Automated Planning and Scheduling
• Reasoning under Uncertainty
• +9 more

Felipe Werndl Trevizan is a Senior Lecturer in the School of Computing at the Australian National University (ANU), where he conducts research at the intersection of Artificial Intelligence, Operations Research, and Machine Learning. His work focuses on automated planning and scheduling, reasoning under uncertainty, heuristic search, and machine learning for planning. He is actively involved in research projects related to uncertainty-centric pilot assistance systems and probabilistic planning. His research interests include: Automated Planning and Scheduling Probabilistic and Multi-Objective Planning Heuristic Search and Admissible Heuristics Deep Learning for Generalized Planning Constraint-Based and Risk-Aware Planning Learning Heuristics from Data His recent publications demonstrate a strong trend toward integrating machine learning with classical planning techniques, particularly in learning reliable, domain-independent heuristics using both deep and classical machine learning methods. He has developed novel algorithms for constrained and stochastic shortest path problems, multi-objective probabilistic planning, and generalized planning using neural networks. His scientific awards include: Best Paper Award at ICAPS 2016 Best Paper Award at ICAPS 2017 2016 Kikuchi-Karlaftis Best Paper Award from the Transport Research Board Felipe Werndl Trevizan is registered to supervise research students and has advised several successful projects in AI planning. He has secured research grants for projects such as 'Integrated Planning for Uncertainty-Centric Pilot Assistance Systems' and 'Chance-Constrained POMDP for Pilot Assistance Systems' at ANU. He is also organizing key community events including the 'Reliability In Planning and Learning (RIPL)' workshop and a tutorial on 'Learning for Planning' at ICAPS 2025. He is affiliated with the School of Computing at ANU and previously worked as a Senior Research Scientist at NICTA and Data61/CSIRO. His research is supported by active collaborations with leading researchers such as Sylvie Thiébaux, Hanna Kurniawati, and others.

Ian StarkView profile

Senior Lecturer

• Programming Languages
• Theoretical Computer Science
• Concurrency Theory
• +15 more

Ian Stark is a Senior Lecturer in Computer Science at the School of Informatics , The University of Edinburgh , and a key member of the Laboratory for Foundations of Computer Science (LFCS) . His research centers on mathematical models of programming languages and concurrent systems, with a focus on reasoning about name generation and secure mobile code. Research Interests: Ian Stark's work lies at the intersection of theoretical computer science and programming language semantics. He investigates foundational models such as the π-calculus and nu-calculus, applying them to problems in security, resource management, and systems biology. His research in denotational and operational semantics provides rigorous frameworks for understanding program behavior, particularly in systems with dynamic name creation and local state. He has made significant contributions to proof-carrying code and resource guarantees for mobile and embedded systems, ensuring safety and security through formal methods. The trends in his publications over the last 15 years show a consistent focus on foundational models for concurrency and security. Early work established semantic models for the π-calculus, while later research applied these to practical domains like mobile code security and systems biology. His articles frequently appear in top venues like LICS, FOSSACS, and TCS, reflecting a strong theoretical grounding with applications in verification and language design. Scientific Recognition: Advising and Funding: Stark has supervised several PhD students, including Marek Kwiatkowski, Chris Banks, Uli Schöpp, Sam Lindley, and Tom Chothia. He has been involved in major collaborative research projects such as REMS (Rigorous Engineering for Mainstream Systems), App Guarden (Resilient Application Stores), CerCo (Certified Complexity), and Mobius (Proof-Carrying Code), funded by the EPSRC and the European Union. He actively recruits PhD students, particularly through the Centre for Doctoral Training in Pervasive Parallelism. Labs and Teams: He is a core member of the Laboratory for Foundations of Computer Science (LFCS) , a world-renowned research group at the University of Edinburgh focused on the mathematical foundations of computing. His work often involves collaboration with researchers across Europe in the areas of programming languages, semantics, and formal verification.

• Formal Verification
• Theorem Proving
• Hybrid Systems
• +12 more

Paul Jackson is a Senior Lecturer in the School of Informatics at the University of Edinburgh and serves as Director of the Artificial Intelligence and its Applications Institute (AIAI). He is also affiliated with the Laboratory for Foundations of Computer Science (LFCS) and is an associate member of the Institute for Computing Systems Architecture (ICSA). His work bridges theoretical and applied aspects of formal methods in computer science. Education PhD and MS in Computer Science, Cornell University (1988–1995) MS in Physics, Cornell University (1986–1988) Undergraduate in Engineering, University of Cambridge (1981–1984) Paul Jackson's research focuses on formal verification, particularly the development and application of tools for verifying software, hardware, and hybrid systems. His primary interests include interactive theorem proving (using Lean, Isabelle, and KeYmaera), formal verification of hybrid and cyber-physical systems, non-linear arithmetic, and the integration of symbolic computation with deduction. He has worked extensively with the Nuprl theorem prover and contributed to tools like Victor for SPARK/Ada verification. His recent publications emphasize compositional verification, validated integration using Taylor models, invariant generation for polynomial systems, and dynamic proof presentation. He has been involved in multiple EPSRC and UKRI-funded projects, including work on trustworthy autonomous systems and cache coherence protocols. Scientific Awards and Recognition No specific awards are listed in the provided text. Paul Jackson has advised several PhD students, including Ramon Fernández Mir, Kristjan Liiva, Andrew Sogokon, and Grant Olney Passmore, many of whom have gone on to influential roles in academia and industry. He has held significant administrative roles, including Senior Tutor and Senior Director of Studies, and has contributed to major conferences such as CAV, CICM, and CADE as program committee member or chair. His teaching includes courses on formal verification, automated reasoning, and software engineering.

• Program Analysis
• Formal Methods
• Software Verification
• +5 more

Maria Christakis is a Full Professor at the Faculty of Informatics, Vienna University of Technology, where she leads the Software Engineering Research Unit and the Rigorous Software Engineering Group at the Information Systems Engineering Institute. Her work bridges theoretical foundations with practical tools for reliable software development. Her research focuses on Program Analysis, Formal Methods, Software Verification, and Test Generation . She develops techniques for automatic test generation, program analysis, and software verification to enhance software robustness while improving developer experience. Key innovations include metamorphic testing frameworks, soundness testing for program analyzers, and verification tools for smart contracts and machine learning systems. Christakis' recent publications reveal strong trends in zero-knowledge circuit testing, smart contract security, machine learning verification, and action-policy testing . Her work combines formal methods with practical engineering solutions, particularly for blockchain systems, neural networks, and program analyzers. She emphasizes sustainability in testing through projects like GreenBench. Amazon Research Award (2023) for Testing Dafny for Unsoundness and Brittleness Bugs Facebook Faculty Research Award for Program Analysis Google Research Scholar Award for Metamorphic Specification and Testing Best Presentation Award at ESEC/FSE'20 Distinguished Paper Award at ICSE'16 She actively mentors PhD and Master's students through projects like Circuzz, Sherlock, and Nomos. Her group receives substantial funding from the Austrian Science Fund (FWF), European Commission, Amazon Research Awards, and Google Research Scholar program. Current major projects include the Structured Doctoral Program on Automated Reasoning (FWF-funded) and the Amazon Research Award project on Dafny testing. Christakis leads the AGI Labs team building AI agents and contributes to Amazon Nova foundation models. Her group maintains strong industry collaborations with Amazon (through Amazon Research Awards and Amazon Scholars program), MPI-SWS, and Microsoft Research.

• Formal Verification
• Virtualization
• Systems Security
• +2 more

Jean Pichon-Pharabod serves as Tenure Track Assistant Professor in the Department of Computer Science at Aarhus University, Denmark. His research bridges formal methods and systems security with practical applications in cloud infrastructure and virtualization technologies. His primary research domains include Formal Verification , Virtualization Security , and Programming Language Semantics . He develops mechanized verification frameworks using Iris separation logic to prove critical safety properties in WebAssembly runtimes and virtual machine monitors, focusing on memory isolation and security invariants. Analysis of his 2023-2025 publications reveals strong thematic consistency in applying formal verification to cloud-native systems. Key trends include memory safety enforcement in WebAssembly (Iris-MSWasm), hypervisor security verification (VMSL), and cross-layer isolation guarantees - all addressing critical vulnerabilities in modern cloud infrastructure through machine-checked proofs. Scientific recognition includes: 2023 Amazon Research Award for “Validating Isolation of Virtual Machines in the Cloud” His research is supported by competitive industry grants including the Amazon Research Award, facilitating collaborations between Aarhus University and Amazon researchers. Current work focuses on extending formal verification techniques to emerging cloud-native execution environments while maintaining modular verification approaches.

Jose IovinoView profile

Professor

• Mathematical Logic
• Model Theory
• Functional Analysis
• +7 more

Jose Iovino is a Professor in the Department of Mathematics at the University of Texas at San Antonio (UTSA), part of the College of Sciences. He serves as the Graduate Advisor of Record for the Master of Science in Mathematics and is a key member of the UTSA Quantum Mathematics group. He is also a co-coordinator of the Mathematics of Data and Computing program at UTSA. Education: Ph.D. in Mathematics, University of Illinois at Urbana-Champaign, 1994 B.S. in Mathematics, Universidad de los Andes, Bogotá Research Interests: Dr. Iovino specializes in mathematical logic , particularly model theory , the meta-mathematical study of truth. His research explores the interaction between logic and functional analysis, with current projects involving model-theoretic and topological methods in analog and quantum computability. He investigates the logical foundations of quantum theory and the intersection of logic with information, learnability, and combinatorics. His work often applies stability theory and definability to Banach spaces and metric structures. Publication Trends: His recent publications, spanning from 2013 to 2023, show a consistent focus on the interplay between model theory and analysis. A dominant theme is metastability —a logical form of convergence—used to analyze sequences in functional analysis and ergodic theory. He frequently collaborates with colleagues like Eduardo Dueñez and Xavier Caicedo, and his work appears in leading logic journals and book volumes, particularly in the area of continuous and metric model theory with applications to Banach spaces and computability. Scientific Recognition: No specific awards or fellowships are mentioned in the provided text. Advising and Grants: While no formal list of advisees is provided, Dr. Iovino actively encourages graduate students in mathematics, computer science, or physics with strong backgrounds in algebra, analysis, and topology to contact him for research opportunities. He mentors students through his role as Graduate Advisor. The text mentions no specific grants, but his involvement in coordinated programs and ongoing research suggests active research funding and institutional support. Labs and Research Groups: Dr. Iovino is a member of the UTSA Quantum Mathematics group and co-leads the Mathematics of Data and Computing program, indicating leadership in interdisciplinary research teams focused on the mathematical foundations of modern computing and data science.

Mauro JaskelioffView profile

Adjunct Professor

• Functional Programming
• Algebraic Effects
• Monad Transformers
• +4 more

Mauro Jaskelioff is an Adjunct Professor at the College of Exact Sciences, Engineering and Surveying of the National University of Rosario (Argentina), where he heads the Computer Science Department . He is also an adjunct researcher at CIFASIS-CONICET. His research focuses on functional programming, monad transformers, algebraic effects, and program calculation. Education : PhD in Computer Science (University of Nottingham, 2009), Licenciateship in Computer Science (National University of Rosario, 2004), and prior studies in Electronic Engineering. Research Highlights : Developed the Monatron extensible monad transformer library, formalized modular operational semantics, and advanced algebraic effect handling. His work bridges category theory and practical Haskell implementations. Teaching : Courses in Data Structures & Algorithms, Programming with Categories, and Programming Languages. Students : Supervised PhD/MS students including Martín Ceresa, Guido Martínez, Exequiel Rivas, and Pablo Buiras. Publications : Key contributions in monad transformers, applicative traversals, and effect systems. Collaborations with Tom Schrijvers, Nicolas Wu, and Graham Hutton.

Damien PousView profile

Researcher

• Kleene algebra
• Automata theory
• Logic in computer science
• +12 more

Damien Pous is a CNRS researcher at ENS Lyon, affiliated with the Laboratoire de l'Informatique du Parallélisme (LIP), where he leads the Plume team. His work lies at the intersection of theoretical computer science, formal methods, and mechanized reasoning. Research Interests: His primary research areas include Kleene algebra, coinduction, bisimulation, automata theory, logic, and the formalization of mathematics and programming languages using the Coq proof assistant. He develops algebraic and coalgebraic techniques for verification and certification, especially through up-to techniques and cyclic proofs. The most recent publications reflect a strong trend in algebraic methods for program verification , coinductive reasoning , and formalization in Coq . Key themes include completeness theorems for Kleene algebras, graph theory formalization, cyclic proof systems, and algorithmic verification of automata. His work combines deep theoretical insights with practical implementation in proof assistants. Teaching and Supervision: He has taught advanced Master’s level courses at ENS Lyon on topics such as coinduction, relation algebra, and certified approximation. He has advised or collaborated closely with several researchers and students, including Amina Doumane, Laureline Pinault, and Paul Brunet. Projects: He leads the CoVeCe project, funded by the European Research Council (ERC), which aims to develop coinduction-based techniques for verification and certification.

Ulf NorellView profile

Researcher

• Interactive Theorem Proving
• Dependently Typed Programming
• Type Theory
• +3 more

Ulf Norell is a Researcher at the Computing Science department of Chalmers University of Technology. He is an active member of both the Programming Logic and Functional Programming research groups, focusing on the intersection of theoretical type systems and practical programming language implementation. Dr. Norell completed his PhD at Chalmers University of Technology in 2007 with the dissertation "Towards a practical programming language based on dependent type theory," following a Licentiate thesis from Chalmers and Göteborg University in 2004 and a Master's degree from Chalmers in 2002. His educational background demonstrates a consistent focus on the theoretical foundations of programming languages. His research centers on making formal verification accessible through practical implementations of dependent type theory. Dr. Norell has made significant contributions to the Agda proof assistant, developing both the core system and the experimental AgdaLight platform. His work bridges advanced type theory with real-world programming challenges, particularly in the areas of parser implementation, mixfix operator handling, and generic programming techniques. The evolution of his publications shows a clear trajectory from foundational theoretical work toward increasingly practical applications of dependent types in programming. At Chalmers, Dr. Norell has taught Advanced Functional Programming (2008-2009) and Types for Programs and Proofs (2009), courses that directly reflect his research expertise. His teaching emphasizes the practical application of advanced type systems and formal methods. He maintains an active presence in the programming languages research community through conference presentations at venues including ICFP, TPHOLs, and MPC, where he demonstrates how dependent types can be used for interactive programming and formal verification in real-world contexts.

Marko DokoView profile

Assistant Professor

• Computer Science
• Software Systems
• Concurrency
• +3 more

Marko Doko is an Assistant Professor in the Computer Science Department at the School of Mathematical and Computer Sciences, Heriot-Watt University. He completed his PhD at the Max Planck Institute for Software Systems (MPI-SWS) in Germany under Viktor Vafeiadis' supervision. His research focuses on formal verification of concurrent systems, weak memory models, and program logic. Key Research Trends: His work bridges theoretical computer science and formal methods, particularly in concurrency and memory consistency. Recent publications address challenges in weak memory concurrency, series summation in Banach spaces, and separation logic for memory models. Advising: No student advising details available. Labs/Teams: No affiliations with labs or teams mentioned.

Thibaut BalabonskiView profile

Assistant Professor

• Programming Languages
• Operational Semantics
• Type Systems
• +6 more

Thibaut Balabonski is an Assistant Professor of computer science at Paris-Saclay University, affiliated with the Formal Methods Lab. His research focuses on programming languages, operational semantics, type systems, lambda calculus, and concurrency, with notable work on formal verification of mobile robot swarms and functional programming optimizations. Published key works on strong call-by-need calculus (LMCS, 2023), weak optimality in lambda calculus (ICFP'13), and separation logic for permission-based languages (TOPLAS, 2016). Co-authored educational books for high school and preparatory classes, including Digital and Computer Science series. Teaching includes object-oriented programming , compilation , and lambda calculus courses at L2, M1, and M2 levels. Labs & Teams : Formal Methods Lab (LMF), CNRS, with collaborations in Coq formalization (Pactole framework) and concurrency theory.