Find Academic Supervisors

Manish SinghView profile

Assistant Professor

• Power Systems
• Optimization
• Control Systems
• +4 more

Manish Singh is an Assistant Professor in the Department of Electrical & Computer Engineering at the University of Wisconsin-Madison. His work focuses on advancing power systems and energy networks through the integration of optimization, control theory, and machine learning. He holds a PhD from Virginia Tech (2021), MS from Virginia Tech (2018), and BS from IIT Varanasi (2013), with prior industry experience in the power sector (2013–2016). Research Interests: Modeling, optimization, and control of power systems; data-driven methods for energy networks; and interdisciplinary approaches for natural gas and water systems. Notable contributions include physics-informed machine learning for voltage stability, grid-forming inverter dynamics, and topology-aware control strategies for distributed energy resources. Education: PhD in Electrical Engineering, Virginia Tech (2021) MS in Electrical Engineering, Virginia Tech (2018) BS in Electrical Engineering, Indian Institute of Technology, Varanasi (2013) Recent work emphasizes smart grid resilience, low-frequency oscillation mitigation, and self-supervised learning algorithms for system modeling. His research has been recognized with awards such as the ABB Research Award (Top 5 Finalist, 2022) and the Blackwell Graduate Research Award (Second Prize, 2022). Notable Awards: 2022 ABB Research Award Finalist 2022 Blackwell Graduate Research Award 2019 INFORMS ‘Frame that Problem’ Winner 2007 KVPY Fellowship (Government of India) Teaching Activities: Courses include Signals and Systems (E C E 330), Electric Power Systems (E C E 427), and Advanced Independent Study (E C E 699). His academic contributions extend to collaborative projects on grid-forming inverters and energy network interoperability through the UNIFI Consortium.

• Automated Theorem Proving
• Computer Algebra
• Symbolic Computation
• +3 more

Wolfgang Windsteiger is an Associate Professor at the Research Institute for Symbolic Computation (RISC) of Johannes Kepler University (JKU), Linz, Austria. His primary research focuses on automated theorem proving, computer algebra systems, and symbolic computation, particularly within the Theorema project. He leads the redesign and implementation of Theorema 2.0, an open-source system for mathematical theory exploration. Windsteiger is also active in integrating computational tools into mathematics education, co-authoring textbooks on algorithmic methods for university students. His work spans formal methods, mathematical software development, and educational technology. Positions: Associate Professor at RISC/JKU, Trustee of Calculemus, Conference Chair of multiple events including Calculemus'2007 and MKM'2007. Contributions: Developer of Theorema 2.0, co-author of Springer's 'Algorithmische Methoden' series, and creator of educational software tools for mathematics. Research Interests: Theorema system development, automated reasoning, formal methods in economics, and computational pedagogy. He actively promotes the use of theorem provers in university and school-level mathematics education.

Fan LongView profile

Assistant Professor

• Programming Languages
• Software Engineering
• Systems Security
• +3 more

Fan Long is an Assistant Professor in the Department of Computer Science at the University of Toronto, affiliated with the Bahen Centre for Information Technology. His research focuses on programming languages, software engineering, systems security, and blockchain technology, with particular emphasis on smart contract security and automatic patch generation. He leads the Conflux project, a high-throughput blockchain platform, and has contributed to systems like Shrec (bandwidth-efficient transaction relay), Gosig (scalable Byzantine consensus), and CodePhage (cross-application code transfer). Education background includes a PhD in Computer Science from MIT (as evidenced by his former MIT homepage). His work spans foundational blockchain scalability improvements, runtime validation for smart contracts (Solythesis), and input sanitization techniques (SIFT/SOAP). Notable awards include a Distinguished Paper at ICSE 2024 and Best Paper at IEEE ICBC 2022. Research highlights include developing Prophet (machine learning-driven patch generation), RCV (crash recovery tool), and LVMT (authenticated storage for blockchains). His lab collaborates with industry partners to address challenges in decentralized systems, including transaction finality, oracle security, and gas optimization in DeFi applications. Grants and collaborations include projects funded by NSERC, MIT-IBM Watson AI Lab, and industry partnerships with blockchain firms. Active in open-source communities, maintaining repositories for Conflux, Prophet, and CodePhage. Recent work explores atomic state sharding (Möbius), flash loan attack synthesis (Flashsyn), and robust front-running methodologies.

Dave NaumannView profile

Professor

• Formal Methods
• Software Security
• Relational Verification
• +7 more

Dave Naumann is a Professor and Chair of the Department of Computer Science at Stevens Institute of Technology, located within the Charles V. Schaefer, Jr. School of Engineering and Science. He holds a PhD (1992) and BA (1982) in Computer Science from the University of Texas at Austin. His research focuses on formal methods and software security, including relational and hyperproperty verification, fine-grained confidentiality/integrity policies, program analysis, and correctness-by-construction methodologies. Naumann leads the Cypress research group and has served in significant academic roles, including editorial board memberships for ACM Transactions on Programming Languages and Systems and Formal Aspects of Computing . His awards include the Davis Memorial Award for Research Excellence (2006) and invitations as a keynote speaker at major conferences like ETAPS and IBM Programming Languages Day. He has advised numerous PhD students and postdoctoral researchers, contributing to advancements in secure software verification. His grants include NSF awards for projects like hyperproperty abstraction and relational verification for privacy. Naumann’s work bridges theoretical foundations with practical tools, exemplified by the WhyRel prototype for modular relational verification. Professional service includes co-chairing the IEEE Computer Security Foundations Symposium and serving on program committees for POPL, CCS, and ECOOP. His consulting work with Microsoft Research, Vulcan Inc., and Galois Inc. underscores industry-academia collaboration in formal methods.

• Programming Languages
• Functional Programming
• Type Systems
• +5 more

Ningning Xie is an Assistant Professor in the Department of Computer Science at the University of Toronto. She holds a part-time Research Scientist position at Google DeepMind and is a Faculty Affiliate at the Schwartz Reisman Institute. Previously, she was a Research Associate at the University of Cambridge and earned her Ph.D. from the University of Hong Kong and B.S. from Zhejiang University. Her research focuses on foundational aspects of programming languages, including functional programming, type systems, logics, and their applications in broader domains. Key areas include algebraic effect handlers, staged compilation, type inference, and parallel computing. She has contributed to systems like MacoCaml and Perceus, and her work has been recognized with ACM SIGPLAN Distinguished Paper Awards and the Cambridge Hall of Fame Award. Dr. Xie co-chairs the Haskell Symposium 2025 and serves on committees for major programming language conferences (PLDI, ICFP, etc.). She actively organizes workshops and tutorials, including invited keynotes at Lambda Days and ZuriHac 2024. Her service roles include moderating the Types Forum and steering committees for Haskell and PLMW. Her academic contributions span over 25 peer-reviewed publications, with a focus on practical implementations and formal proofs. She advises students through her research group and emphasizes generative programming techniques in her teaching.

• Formal Verification
• Programming Languages
• Computer Security
• +3 more

Arthur Azevedo de Amorim is an Assistant Professor in the Department of Computer Science at the Golisano College of Computing and Information Sciences, Rochester Institute of Technology (RIT). He holds a Ph.D. from the University of Pennsylvania, advised by Benjamin Pierce and Cătălin Hrițcu, with postdoctoral work at Boston University and Carnegie Mellon University. His undergraduate studies were at the University of Campinas (Unicamp) and École Polytechnique (Polytechnique). His research focuses on improving software security through formal verification, programming languages, and type systems. Key areas include cryptographic protocols, compartmentalization techniques for secure compilation, and formal semantics. Notable projects include Cryptis (separation logic for cryptographic protocols) and SECOMP (formally verified compartmentalizing compiler). Arthur teaches courses such as Programming Language Concepts and Programming Language Theory at RIT. He actively contributes to open-source projects like the Coq proof assistant and maintains the Deriving library for generic instance generation in Coq. His recent work emphasizes formal methods for secure systems, with publications in top venues like POPL, CCS, and ICALP. He advises several graduate and undergraduate students on topics ranging from formal verification to programming language design.

Patrick MassotView profile

Professor

• Contact Geometry
• Symplectic Geometry
• Formalized Mathematics
• +4 more

Patrick Massot is a Professor in the Department of Mathematics at the University of Paris-Saclay, affiliated with the Orsay Mathematics Laboratory. His research focuses on contact geometry, symplectic geometry, and formalized mathematics using the Lean proof assistant. Notably, he co-formalized the definition of perfectoid spaces and contributed to the Liquid Tensor Experiment. He has taught courses on differential topology, groups and geometry, and computer-assisted logic at both undergraduate and graduate levels. His work bridges traditional mathematics with computational tools, emphasizing formal verification through projects like the formalization of sphere eversion and the h-principle. He actively engages in expository efforts, including talks for non-specialists and contributions to popular science platforms like Images des Mathématiques . His research also encompasses topics such as holonomic approximation, contactomorphism groups, and the interplay between contact structures and geometric topology. Massot’s teaching philosophy integrates practical programming and proof assistants to enhance mathematical rigor. He developed educational materials for Lean, including a course on logic and formal proofs (MDD 154), and maintains resources for LaTeX, Git, and computational geometry tools. His contributions to both research and pedagogy highlight a commitment to advancing mathematical practice through formal methods and accessible education.

Gidon ErnstView profile

Assistant Professor

• Formal Methods
• Software Verification
• Software Testing
• +5 more

Gidon Ernst is a Junior Professor (Assistant Professor) for Software Verification at the Department of Computer Science, LMU Munich, where he leads research in the Software and Computational Systems Lab. His work focuses on formal methods for software engineering, with particular emphasis on verification, testing, and security analysis of complex systems. His research interests span formal methods for software engineering, software testing, interactive and automated proofs, hybrid systems, and falsification. Ernst's work addresses challenges in relational proofs for substitution principle, software testing with Legion (a tool combining concolic execution and fuzzing), concurrent information flow security with SecCSL and SecC, and falsification of temporal logic requirements for hybrid systems. His approach often combines theoretical foundations with practical tool development. Ernst's publication record shows a strong focus on verification of security properties, particularly information flow security in concurrent systems, and falsification of hybrid systems. His recent work has advanced techniques for adaptive probabilistic search in falsification, compositional vulnerability detection, and contract-based software specification. He actively contributes to the verification community through competitions like VerifyThis and ARCH. Best Master Lecture 2022 in Computer Science (awarded by Gruppe Aktiver Fachschaftika) Ernst has supervised PhD student Dongge Liu on software fuzzing with machine learning (2018-2022), co-supervised with Toby Murray and Ben Rubinstein from the University of Melbourne. His teaching includes courses on formal specification and verification, methods in software engineering, and various seminars on software quality assurance and deductive verification. He has also served on numerous program committees and organized major verification events including SPIN 2025 and the VerifyThis challenge series. Ernst maintains active collaborations with researchers worldwide, particularly in the areas of hybrid systems verification (with Ichiro Hasuo, Sean Sedwards, and Zhenya Zhang) and information flow security (with Toby Murray). His work bridges theoretical computer science with practical software engineering challenges, developing tools that have seen adoption in both academic and industrial settings.

Patrick KoopmannView profile

Assistant Professor

• Artificial Intelligence
• Knowledge Representation
• Description Logics
• +3 more

Patrick Koopmann is an Assistant Professor in the Faculty of Science, Department of Artificial Intelligence at Vrije Universiteit Amsterdam. He is also affiliated with the Network Institute. His research focuses on formal methods in knowledge representation, including description logics, ontologies, and automated reasoning. Koopmann's work emphasizes theoretical foundations and practical applications, such as ontology-based planning, query answering, and explainable AI systems. He has contributed to tools like Evonne for visualizing reasoning processes and debugging ontologies. His research interests span a range of topics including formal logic, ontology engineering, and computational complexity analysis. He frequently collaborates on projects involving temporal logics, constraint satisfaction, and probabilistic reasoning. Koopmann teaches courses on formal logic in AI and knowledge representation, reflecting his expertise in bridging theoretical computer science with practical AI solutions. Notable contributions include advancements in reasoning algorithms for description logics, optimal repairs for inconsistent ontologies, and explanations for ontology-mediated queries. His work often intersects with interdisciplinary applications, such as ontology-driven decision support systems in agriculture. Despite his prolific output, no formal awards or grants are explicitly mentioned in the provided texts.

• Homotopy Type Theory
• Type Theory
• Formal Verification
• +3 more

Dr. Kristina Sojakova is an Assistant Professor at the Faculty of Science (Computer Science Department) and the Network Institute at Vrije Universiteit Amsterdam. Her research focuses on Homotopy Type Theory, Cryptographic Protocols, and Blockchain Standards. She teaches courses in Logical Verification and Logic and Modelling (2024-2025). Research Interests: Homotopy Type Theory: Explores foundational aspects of type systems with homotopical interpretations Cryptography: Develops formal methods for protocol verification using equational reasoning Formal Methods: Applies type-theoretic frameworks to blockchain systems and ledger standards Publications highlight contributions to: Formal verification of cryptographic protocols (2023) Coherence structures in homotopy theory (2022) Blockchain ledger formalization (2021) Homotopy-theoretic colimit constructions (2020) Relational parametricity frameworks (2018) No scientific awards explicitly mentioned. No current advising or grant information available. Active in international collaborations across computer science and mathematics disciplines.

Jessica ManView profile

Lecturer

• Zero-Knowledge Proofs
• Carbon Accounting
• Digital Identities
• +4 more

Jessica Man is a Lecturer in Computer Science at the University of Cambridge's Department of Computer Science and Technology (University of Cambridge). She holds roles as Teaching Assistant for Advanced Operating Systems (MPhil/Part III/Part II) and Supervisor for courses including Operating Systems (Part IA), Concepts in Programming Languages (Part IB), and Object-Oriented Programming (Part IA). Her research focuses on Zero-Knowledge Proofs, Carbon Accounting, Cybersecurity, and Decentralized Systems, with a particular emphasis on trustworthiness in digital systems and cybercrime analysis. Professionally, she serves as Chair of Women@CL (2023/24) and Co-chair of the Oxbridge Computer Science Conference (2022/23). Her recent work includes a Best Student Paper Award at the Symposium on Electronic Crime 2023 for research on privacy-preserving carbon emissions claims. She has published on topics ranging from cybersecurity in fitness data to autism discourse in cybercrime forums. Education: Ph.D. in Computer Science (implied by position) Affiliations: Member of the Department of Computer Science and Technology, Cambridge Her grants and advising activities are not explicitly detailed, but her leadership roles in academic initiatives suggest active involvement in collaborative projects. She is affiliated with the Cambridge Centre for Carbon Credits (4C) through her research interests in carbon accounting.

Manuel TorrilhonView profile

Professor

• Continuum Physics
• Kinetic Theory
• Rarefied Gas Dynamics
• +4 more

Manuel Torrilhon serves as Professor and head of the Research Lab for Applied and Computational Mathematics (ACoM) at RWTH Aachen University, where he has held a full professorship since 2010. He currently leads the Department of Mathematics as its elected Speaker for the 2024-2026 term, overseeing academic strategy and research initiatives within the Faculty of Mathematics, Computer Science and Natural Sciences. His academic foundation includes: Diplom-Ingenieur in Engineering Physics from TU Berlin (1994-1999) PhD in Applied Mathematics from ETH Zurich (2004) Postdoctoral research at HKUST (2004/05) and Princeton University (2005/06) Research Assistant Professor at ETH Zurich (2007-2010) Professor Torrilhon's research pioneers mathematical modeling in continuum physics and kinetic gas theory , with seminal contributions to the Boltzmann equation, rarefied gas dynamics, and magnetohydrodynamics. His work develops advanced numerical methods for nonlinear hyperbolic systems , particularly entropy-stable high-order schemes and multi-scale time integrators. The ACoM lab under his direction bridges theoretical mathematics with engineering applications through computational frameworks like fenicsR13 for moment equation solvers. His methodologies enable high-fidelity simulations of micro-flows, plasma instabilities, and electron transport phenomena critical to aerospace and materials science. Analysis of his 2025-2024 publications reveals dominant trends in entropy-conservative numerical schemes for kinetic equations, multirate time integration for stiff systems, and moment-method extensions to polytropic gases and shallow flows. These works consistently address computational challenges in rarefaction effects, non-equilibrium thermodynamics, and high-enthalpy regimes, demonstrating cross-cutting applications from microfluidics to plasma physics. Scientific recognition includes: EURYI Award (Pre-ERC) from European Science Foundation (2006) As director of ACoM, Professor Torrilhon secures research funding for computational mathematics projects and mentors graduate students in numerical analysis and kinetic theory. His lab maintains strong collaborations with engineering departments for applied validation of mathematical models, particularly in micro-flow devices and plasma containment systems. Current grants focus on adaptive solvers for multi-scale kinetic problems and inverse methods for electron probe microanalysis. The Research Lab for Applied and Computational Mathematics (ACoM) operates as an interdisciplinary hub developing open-source computational tools like fenicsR13. The team specializes in tensor-based numerical methods for moment equations, with ongoing projects in X-ray emission modeling, Richtmyer-Meshkov instability simulations, and thermodynamically consistent electrolyte solvers. ACoM maintains strategic partnerships with aerospace research institutes for hypersonic flow validation and with materials science centers for nanoscale transport studies.

Michael NorrishView profile

Associate Professor

• Formal Methods
• Interactive Theorem Proving
• Formal Semantics
• +3 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

Joseph AlfanoView profile

Assistant Professor

• Algebraic Combinatorics
• Enumerative Combinatorics
• Abstract Algebra
• +3 more

Joseph Alfano is an Assistant Professor of Mathematics at Assumption University, part of the D’Amour College of Liberal Arts and Sciences. He holds a B.S. in Mathematics from MIT (1988), an M.A. (1989), and a Ph.D. (1994) in Mathematics from the University of California at San Diego, with a thesis titled The Module Of Diagonal Harmonic Polynomials . His research focuses on Algebraic and Enumerative Combinatorics, particularly diagonal harmonics of symmetric groups. Alfano teaches courses such as Modern Algebra, Discrete Structures, and Probability Theory. He advises students in the 3-2 Engineering Program with institutions like the University of Notre Dame and Washington University in St. Louis. His outreach includes organizing Camp AIM, a math day-camp for high school students. Alfano has mentored several students in research, including Emily Armstrong (Ph.D. candidate at Pitt) and Mike Weselcouch (Assistant Professor at Roanoke College). His work bridges advanced combinatorics with educational outreach, as seen in his teaching mini-videos on probability and Pascal’s Triangle. Despite no explicit awards listed, his contributions to undergraduate research and pedagogy are notable. He maintains an active website with advising resources and research materials.

David Zureick-BrownView profile

Assistant Professor

• Number Theory
• Arithmetic Geometry
• Algebraic Geometry
• +3 more

David Zureick-Brown is an Assistant Professor at the University of Wisconsin-Madison, affiliated with the Department of Mathematics. His research focuses on number theory, arithmetic geometry, and algebraic geometry, with interests in stacks, Galois representations, and arithmetic statistics. He holds a Ph.D. from the University of California, Berkeley (2010) and a B.S. from the University of Arizona (2003). Education: Ph.D., University of California, Berkeley (2010) B.S., The University of Arizona (2003) Research Interests: Zureick-Brown explores modern tools to address classical problems in mathematics, such as the arithmetic of varieties, modular curves, and Galois representations. His work bridges number theory and algebraic geometry, emphasizing connections between disciplines. Recent projects include studies on angle ranks of abelian varieties and uniform bounds for rational points on curves. Awards: NSF Career Grant (2016-2022) NSA Young Investigator Grant (2011-2013) Teaching & Grants: He emphasizes problem-solving and intuition in teaching, particularly in foundational proof-writing courses. His grants include NSF and NSA support for research in arithmetic geometry and number theory.