جستجوی استاد راهنمای دانشگاهی

Nadia Polikarpovaمشاهده پروفایل

دانشیار

• Program Synthesis
• Program Verification
• Type Systems
• +۵ مورد دیگر

Nadia Polikarpova is an Associate Professor in the Department of Computer Science and Engineering at the University of California, San Diego . She earned her PhD from ETH Zurich in 2014 under Bertrand Meyer , followed by postdoctoral research at MIT CSAIL with Armando Solar-Lezama . Her academic contributions have been recognized with prestigious awards including the 2020 Sloan Fellowship , 2020 Intel Rising Stars Award , and 2020 NSF CAREER Award . Polikarpova's research focuses on program synthesis , program verification , and type systems . She leads the Programming Systems group at UCSD and contributes to the IFIP Working Group 2.8 on Functional Programming since 2022. Her work spans foundational research and practical tools, including projects like Synquid , SuSLik , and Laurel that combine formal methods with machine learning for code generation. Her recent publications in venues like OOPSLA , NeurIPS , and ICFP reveal trends in AI-assisted programming , live programming environments , and formal verification . She has advised numerous PhD and Master’s students including Shraddha Barke , Zheng Guo , and Tristan Knoth , many of whom have moved to prominent academic and industry positions. Notable artifacts from her lab include tools like ColDeco for spreadsheet inspection and Superfusion for eliminating intermediate data structures. 2020 : Sloan Fellow 2020 : Intel Rising Stars Award 2020 : NSF CAREER Award 2021 : Distinguished Paper at POPL 2023 : Distinguished Artifact at PLDI 2023 : Distinguished Paper at OOPSLA Polikarpova actively contributes to academic service, serving on program committees for PLDI , POPL , and OOPSLA , and co-chairing the OOPSLA Review Committee in 2023. She has delivered keynotes at APLAS'20 and PLDI'24 , emphasizing the integration of large language models with formal methods.

Assia Mahboubiمشاهده پروفایل

پژوهشگر

• Type Theory
• Formal Verification
• Computer-Aided Mathematics
• +۳ مورد دیگر

Assia Mahboubi is a tenured researcher ( directrice de recherche ) at INRIA in the Gallinette team, Nantes, France, and an endowed professor in the Algebra and Number Theory section of the Vrije Universiteit Amsterdam, Netherlands. Her work bridges theoretical computer science and formal mathematics, with significant contributions to proof assistants and formal verification. Her research focuses on the foundations and formalization of mathematics in type theory, particularly on the automated verification of mathematical proofs. She explores the interplay between computer algebra and formal proofs, and is a key contributor to the Rocq prover (formerly Coq) and the Mathematical Components libraries. Her work often examines how familiar mathematical objects can be optimally represented for computer-aided proof checking. Recent publications show a strong trend toward categorical reasoning, diagram chasing, and continuity properties in constructive type theory, with increasing focus on practical applications of formal methods in computational mathematics. Her work demonstrates the maturation of formal verification techniques from theoretical foundations to practical tools for mathematical research. ERC Consolidator grant for the FRESCO (Fast and Reliable Symbolic Computation) project Mahboubi actively supervises doctoral students including Vojtěch Štěpančík, Tomás Vallejos Parada, and Alain Chavarri Villarello. She has received significant research funding through her ERC Consolidator grant for the FRESCO project, which aims to develop fast and reliable symbolic computation techniques. She is deeply involved in the international research community, serving on program committees for major conferences including POPL, CPP, and ICFP. She leads research in the Gallinette team at INRIA, which focuses on the intersection of proof assistants, programming languages, and formal mathematics. Her work has helped establish formal verification as a practical tool for mathematical research, moving beyond theoretical foundations to real applications in computational mathematics.

Sanjit A. Seshiaمشاهده پروفایل

استاد

• Formal Methods
• Cyber-Physical Systems
• Computer Security
• +۱۰ مورد دیگر

Sanjit A. Seshia is the Cadence Founders Chair Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley . He is affiliated with the Group in Logic and the Methodology of Science and participates in centers like the Industrial Cyber-Physical Systems Center , Berkeley AI Research , and the Simons Institute for the Theory of Computing . Research interests include formal methods for automated verification and synthesis of dependable systems, with applications to cyber-physical systems , AI-based autonomy , and computer security . His work spans SMT solving, model counting, syntax-guided synthesis, and algorithmic improvisation, with tools like UCLID5 , VerifAI , and Scenic for verifying autonomous systems and educational platforms like CPSGrader . Students and collaborators include notable researchers such as Dorsa Sadigh (Stanford), Daniel Fremont (UC Santa Cruz), and Hazem Torfah (Chalmers). He has co-founded startups like Decyphir and 20ⁿ Labs based on his research.

Sean Welleckمشاهده پروفایل

استادیار

• Machine Learning for Mathematics
• Machine Learning for Code
• AI Reasoning and Agents
• +۶ مورد دیگر

Sean Welleck is an Assistant Professor at Carnegie Mellon University's School of Computer Science, Language Technologies Institute, leading the L3 Lab. His research focuses on bridging informal and formal reasoning with AI, spanning machine learning for mathematics and code, inference algorithms, and AI agents. PhD in Computer Science from New York University (advised by Kyunghyun Cho) Postdoctoral work at University of Washington (advised by Yejin Choi) His work explores AI-driven formal methods for mathematics and code generation, test-time compute scaling, and algorithms enabling AI improvement over time. Recent publications analyze reasoning evaluation, premise selection, and automated proof optimization in systems like Lean. Key article trends include neural theorem proving, code generation, and inference-time compute optimization. Awards: NVIDIA AI Labs Pioneering Research Awards (2017, 2018), NAACL 2025 Best Paper. Current advisees include PhD students Pranjal Aggarwal, Weihua Du (co-advised with Yiming Yang), Andre He (co-advised with Daniel Fried), and Seungone Kim (co-advised with Graham Neubig). He co-organizes workshops like Autoformalization for the Working Mathematician (ICERM 2025) and VerifAI: AI Verification in the Wild (ICLR 2025), and teaches Advanced NLP at CMU.

Josef Urbanمشاهده پروفایل

پژوهشگر

• Automated Reasoning
• Machine Learning
• Theorem Proving
• +۵ مورد دیگر

Josef Urban is a leading researcher at the Czech Institute of Informatics, Robotics and Cybernetics (CIIRC) , Czech Technical University in Prague, heading the ERC Consolidator project AI4REASON . Previously, he held positions as a postdoc at Radboud University Nijmegen and assistant professor at Charles University in Prague, where he co-founded the Prague Automated Reasoning Group. Education Ph.D. in Computer Science (2004), Charles University, Prague M.S. in Mathematics (1998), Charles University, Prague B.S. in Economics (1995), Charles University, Prague Research Interests Urban specializes in automated reasoning over large formalized knowledge bases, combining deductive theorem proving and inductive machine learning . His work aims to realize "strong AI" through formalized mathematics, particularly using systems like Mizar and the AI/TP Challenges . He advocates for computer-verifiable mathematics as a foundation for AI progress. Article Trends Urban's publications focus on integrating machine learning with automated theorem proving in systems like ENIGMA and BliStr . Key trends include semantic guidance for ATPs, premise selection in formal libraries, and automated proof compression via concept invention. Scientific Contributions Head of ERC Consolidator project AI4REASON Marie-Curie Fellow at University of Miami Co-founder of Prague Automated Reasoning Group Editor for Formalized Mathematics Advising and Grants Urban has advised numerous PhD and MSc students including Daniel Kuehlwein, Krystof Hoder, and Yutaka Nagashima. He has secured grants like the ERC Consolidator Grant and Marie-Curie Fellowship . Labs and Collaborations Urban leads the AI4REASON team at CIIRC and collaborates with the Foundations Group at Radboud University. He contributes to projects like Mizar TWiki and XML-based API for Mizar , aiming to create a semantic AI ecosystem for formal knowledge.

Daniel Grierمشاهده پروفایل

استادیار

• Quantum Complexity Theory
• Quantum Computing
• Computational Complexity
• +۳ مورد دیگر

Daniel Grier is an Assistant Professor jointly appointed in the Computer Science and Engineering and Mathematics departments at the University of California, San Diego (UCSD). His research focuses on quantum complexity theory , particularly exploring near-term quantum computing paradigms and proving quantum advantage over classical systems. He holds a Ph.D. from MIT and was previously a postdoctoral fellow at the University of Waterloo’s Institute for Quantum Computing. Education: Ph.D. in Computer Science, MIT B.S. in Computer Science and Mathematics, University of South Carolina Research Interests: Grier’s work bridges theoretical computer science and quantum computing, emphasizing algorithm design, complexity class separations, and foundational questions about quantum supremacy. He studies how low-depth quantum circuits, boson sampling, and other near-term technologies can achieve computational tasks classically deemed intractable. Recent Article Trends: His publications explore efficient quantum state learning (e.g., classical shadows), hardness results for quantum sampling problems (e.g., bipartite Gaussian boson sampling), and circuit lower bounds (e.g., depth-2 QAC circuits). These contributions highlight his focus on rigorously defining quantum computational advantages. Awards: None explicitly listed in the text. Advising & Grants: Advises at least one student, Jackson Morris. His research is supported by grants exploring quantum complexity and algorithm design. Teaches advanced courses on quantum complexity theory, computability, discrete mathematics, and quantum computing fundamentals. Labs/Teams: Maintains an active lab focused on quantum complexity theory, collaborating with colleagues on topics like interactive protocols and shallow quantum circuits.

Tianyi Zhangمشاهده پروفایل

استادیار

• Artificial Intelligence
• Machine Learning
• Natural Language Processing
• +۴ مورد دیگر

Tianyi Zhang is a Tenure-Track Assistant Professor in the Department of Computer Science at Purdue University, part of the College of Science. He leads the Human-Centered Software Systems Lab, focusing on AI-driven systems that synergize human expertise with machine intelligence to enhance programming productivity and software reliability. Prior to Purdue, he was a Postdoctoral Fellow at Harvard University under Dr. Elena Glassman and earned his Ph.D. from UCLA (2019) and B.Sc. from Huazhong University of Science and Technology (2013). Education: Ph.D. in Computer Science, University of California, Los Angeles (2019) Bachelor's in Computer Science, Huazhong University of Science and Technology (2013) Research Interests: His work spans Software Engineering, Human-Computer Interaction, and AI. Key areas include program synthesis, interactive debugging tools, autonomous driving system testing, and mitigating biases in AI models. He develops systems like Interpretable Program Synthesis and SQLucid to bridge human and machine intelligence. Recent Trends in Publications: Recent work emphasizes human-in-the-loop AI, including mixed-initiative systems for data wrangling (Dango), interactive program repair, and bias analysis in text representations (STILE). He also explores challenges in autonomous driving testing and LLM-based code generation errors. Awards & Grants: NSF Career Award (2024) Amazon Research Award Showalter Trust Research Award for pre-diabetes research $1.5M NSF grant for software supply chain security Best Paper Honorable Mentions at CHI and VAHC Advising & Teams: Supervises 12+ PhD/Master's students and 30+ research interns. Notable advisees include Bonan Kou (API misuse studies) and Yuan Tian (text-to-SQL systems). Collaborates with Harvard Medical School on healthcare data analysis. Labs & Initiatives: Directs Purdue's Human-Centered Software Systems Lab. Co-founded the Societal Impact Fellows program. Active in open-source projects like Examplore for API usage visualization and JShrink for Java debloating.

Cezary Kaliszykمشاهده پروفایل

استاد

• Automated Reasoning
• Formal Methods
• Formalized Mathematics
• +۷ مورد دیگر

Cezary Kaliszyk is a Professor in Theoretical Computer Science at the University of Melbourne, previously affiliated with the University of Innsbruck. He is actively involved in research and leadership in formal methods, automated reasoning, and machine learning for theorem proving. Research Interests: Automated Reasoning and Interactive Theorem Proving Formalized Mathematics and Proof Automation Machine Learning for Logic and Theorem Proving Integration of AI with Proof Assistants (Coq, Isabelle) Dependent Type Theory and Higher-Order Logic His recent publications (2023–2025) span topics in dependently-typed logic, learning for proof guidance, formalization of surreal numbers, and blockchain-based formal methods. The works consistently bridge formal logic with machine learning, emphasizing automation, explainability, and cross-system integration. Scientific Leadership and Projects: Principal Investigator, ERC project FormalWeb3 Lead Developer, CoqHammer , Tactician , ProofWeb WG5 Leader, COST Action EuroProofNet (until 2024) Contributor to HOL(y)Hammer , Isabelle Enigma He supervises multiple PhD students and has mentored several graduates in formal methods and AI. He teaches courses in theoretical computer science, logic, and machine learning. There are no listed awards in the provided data, but his extensive publication record and project leadership indicate significant recognition in the field. Labs and Research Groups: He leads a research group focused on formal methods and learning-based reasoning, collaborating internationally on projects involving proof automation, formal libraries, and semantic technologies.

• Formalized Mathematics
• Proof Assistants
• Homotopy Type Theory
• +۳ مورد دیگر

Floris van Doorn is a Professor at the Mathematical Institute of the University of Bonn where he leads the Formalized Mathematics group. His research focuses on making it viable to formalize research mathematics in proof assistants that can check the correctness of such proofs. He primarily works with the Lean Theorem Prover and is a maintainer of its mathematical library (mathlib). University of Bonn: Professor (2023-present) University of Paris-Saclay: Postdoc with Patrick Massot (2021-2023) University of Pittsburgh: Postdoc with Tom Hales (2018-2021) Carnegie Mellon University: PhD under Jeremy Avigad and Steve Awodey (2013-2018) Van Doorn's research interests center on formalized mathematics, tools and automation for formalization, and homotopy type theory. He has made significant contributions to several major formalization projects including the Carleson project (proving Carleson's theorem), the sphere eversion project (formalizing Gromov's h-principle), the Flypitch project (formalizing the independence of the continuum hypothesis), and the Spectral sequences project. His work demonstrates that proof assistants can handle complex areas of mathematics beyond algebra, including differential topology and analysis. His recent publications show a consistent focus on advancing formalized mathematics, with his most recent work formalizing the Gagliardo-Nirenberg-Sobolev inequality and continuing the Carleson project. His publications span theoretical foundations of type theory, practical applications of formalization, and educational resources for learning proof assistants. Skolem award (2025) for the paper 'The Lean Theorem Prover (System Description)' Van Doorn actively mentors students and collaborators, with Maria, Michael, and Arend recently joining his formalization group in Bonn. He has taught various courses on formalized mathematics and proof assistants at the University of Bonn, University of Pittsburgh, and Carnegie Mellon University. His educational efforts include developing learning resources such as the Natural Number Game and the online book 'Mathematics in Lean.' He also maintains an active presence in the Lean community through the Formalized Mathematics group and collaborative projects like the Carleson project, which invites participation from those familiar with Lean.

Rosemary Monahanمشاهده پروفایل

استاد

• Software Verification
• Dependable Software Systems
• Formal Methods
• +۳ مورد دیگر

Rosemary Monahan is a Professor in the Department of Computer Science at Maynooth University and an affiliate of the Hamilton Institute. She holds BSc and MSc degrees from University College Dublin and a PhD from Dublin City University. As Maynooth University's institutional lead for ADAPT (SFI Research Centre for AI-Driven Digital Content Technology), she focuses on advancing software dependability through formal methods and AI integration. Her research interests include safety-critical systems, dependable software, formal verification, and computational thinking education. She co-founded the VerifyThis competition series and leads projects such as MAIVV (Modular AI Verification and Visualisation) funded by SFI, and VALU3S (Verification and Validation of Automated Systems) funded by Horizon 2020. She has secured over €2.5M in EU funding for the Erasmus Mundus programs in dependable software systems. Monahan’s educational contributions include pioneering computational thinking resources (CoCoA and InSPECT projects) and teaching modules on software verification and rigorous software processes. She supervises PhD students in data science and advanced networks and collaborates with institutions like INRIA, Microsoft Research, and Amazon Web Services. Her professional roles include editorships in journals like Science of Computer Programming and leadership in conferences like iFM and FMICS. She actively promotes gender equality in computing through initiatives like INGENIC and TechMate toolkits.

Todd Millsteinمشاهده پروفایل

استاد

• Software Reliability
• Network Verification
• Programming Languages
• +۵ مورد دیگر

Todd Millstein is a Professor in the Computer Science Department at the University of California, Los Angeles (UCLA), and served as Department Chair from 2022–2025. He is also an Amazon Scholar and a co-founder and former Chief Scientist of Intentionet (now at AWS). His research focuses on making software systems more reliable, particularly through network verification and programming language techniques. He pioneered the Batfish network configuration analyzer, which is used by AWS, Oracle Cloud, and dozens of companies, and received the ACM SIGCOMM Networking Systems Award (2025) for this work. His recent publications span probabilistic programming, network reliability, and interactive program verification, including papers at PLDI 2024 (on bit blasting probabilistic programs), NSDI 2024 (on behavioral testing of BGP), and HotNets 2024 (on network layering). Todd has received prestigious awards such as an NSF CAREER Award , a Microsoft Research Outstanding Collaborator Award , and multiple best paper awards at PLDI, OOPSLA, and SIGCOMM. He has advised Ph.D. students like Ana Brendel and Poorva Garg , and teaches courses such as CS30 (Principles of Computing), CS231 (Types and Programming Languages), and CS239 (Current Topics in PL and Systems). His professional roles include Program Chair for OOPSLA 2014 and ECOOP 2018, and committee member for numerous conferences including PLDI , SPLASH , and LAFI .

• Formal Verification
• Software Testing
• Programming Languages
• +۱۲ مورد دیگر

Alastair F. Donaldson is a Professor and Director of Research in the Department of Computing at Imperial College London, where he leads the FastPL research group. His work bridges formal methods, software testing, and programming languages, with a focus on enhancing the reliability of high-performance and parallel software systems. He has held key roles including Director of Research (since 2023) and previously served as Lecturer (2011–2014), Senior Lecturer (2014–2017), and Reader (2017–2020) before being promoted to Professor in 2020. His research interests include formal verification, compiler testing, GPU programming, concurrency, and fuzzing. He has made significant contributions to the verification of GPU kernels, metamorphic testing of graphics drivers, and the development of tools like GPUVerify and GraphicsFuzz. His work combines theoretical rigor with practical impact, demonstrated by the acquisition of his startup GraphicsFuzz by Google in 2018 and his subsequent roles as Senior Software Engineer and Visiting Researcher at Google. His recent publications reflect a sustained focus on compiler and system reliability, with trends in fuzzing, formal specification, and automated testing of complex systems such as WebGPU, CXL cache coherence, and large language models for code generation. His work increasingly integrates empirical validation with formal techniques to uncover subtle bugs in real-world systems. Scientific awards and recognitions include: 2017 BCS Roger Needham Award EPSRC Early Career Fellowship Fellow of the British Computer Society Best Paper awards at EuroSys 2024, MET 2021, IISWC 2019, IWOCL 2019, and ICST 2016 Best Industry Paper at ICST 2024 ACM SIGSOFT Distinguished Paper at ISSTA 2023 ACM SIGPLAN Most Influential OOPSLA Paper Award (2012 paper), awarded in 2022 Best Student Paper at PPoPP 2014 He has advised numerous PhD students and leads a vibrant research group. He has secured significant research funding and collaborates extensively with industry and academia. His service includes leadership roles such as General Chair of PLDI 2020, PC Chair of ECOOP 2019, and Steering Committee Chair of PLDI (2022–2025). He also serves on the advisory board of PACM-PL and on program committees for top venues including POPL, OOPSLA, PLDI, ICSE, and ISSTA. He leads the FastPL research group, which focuses on the design and implementation of programming tools and techniques for reliable software. The group conducts cutting-edge research in compiler testing, formal methods, and high-performance systems, fostering collaboration across academia and industry.

Gheorghe Craciunمشاهده پروفایل

استاد

• Mathematical Biology
• Dynamical Systems
• Chemical Reaction Networks
• +۳ مورد دیگر

Gheorghe Craciun is a Professor in the Department of Mathematics and the Department of Biomolecular Chemistry at the University of Wisconsin-Madison. His research focuses on mathematical and computational models in biology and medicine, particularly dynamical systems models of biological interaction networks. He has been a visiting researcher at the Max Planck Institute for Mathematics in the Sciences during the 2019-2020 academic year and has organized the Madison Workshops on Mathematics of Reaction Networks. Craciun's primary research interests include Mathematical Biology, Dynamical Systems, Chemical Reaction Networks, Computational Biology, Systems Biology, and Algebraic Geometry. He investigates systems of differential equations with polynomial right-hand sides, which are common in biochemical reaction networks, ecological interactions, and epidemiological models. His work often involves proving global stability, analyzing multistability, and characterizing steady states using tools from algebraic geometry and combinatorics. Recent publications demonstrate his focus on toric differential inclusions, endotactic networks, and the global attractor conjecture, extending to applications in biochemical networks and discrete Boltzmann equations. His extensive publication record reveals a strong trend toward algebraic and geometric methods for analyzing complex biological networks, with significant contributions to reaction network theory, stability analysis, and parameter characterization. Craciun's work bridges abstract mathematical concepts with practical applications in biochemistry, ecology, and medicine, including modeling vitellogenin production in trout and peptide mass distributions. He has collaborated extensively with international researchers including Alicia Dickenstein, Anne Shiu, Bernd Sturmfels, Casian Pantea, and Miruna-Stefana Sorea. In education, Craciun teaches graduate courses such as Math 703 and mentors students through the Madison Math Circle and Putnam Club, while organizing specialized workshops that foster collaboration in reaction network theory.

Forest Agostinelliمشاهده پروفایل

استادیار

• Deep Learning
• Reinforcement Learning
• Search Algorithms
• +۷ مورد دیگر

Forest Agostinelli is an Assistant Professor in the Department of Computer Science and Engineering at the Molinaroli College of Engineering and Computing, University of South Carolina, where he is also affiliated with the AI Institute. His research focuses on designing AI algorithms for pathfinding problems, integrating deep learning, reinforcement learning, heuristic search, and formal logic. He holds a Ph.D. in Computer Science from the University of California, Irvine, an M.S. from the University of Michigan, and a B.S. in Electrical and Computer Engineering from The Ohio State University. Research Overview : Agostinelli’s work emphasizes solving pathfinding problems in domains like robotics, theorem proving, and molecular optimization. His group develops explainable AI methods to enable collaboration between humans and machines. Key projects include DeepCubeA (solving the Rubik’s Cube via deep reinforcement learning) and neural activation function research. Funding & Awards : He has secured grants from NSF, NASA EPSCoR, and South Carolina’s ASPIRE and MADE programs. Notable awards include the NSF Graduate Research Fellowship and the Graduate Education for Minority Students Fellowship. Teaching : He teaches courses in Artificial Intelligence (CSCE 580) and Deep Reinforcement Learning and Search (CSCE 790), mentoring over 15 students at undergraduate and graduate levels. Labs & Collaborations : Active in AI-driven education and interdisciplinary projects, his lab contributes to tools like ALLURE for children’s learning and Bioinformatics platforms like CircadiOmics.

Jürgen Richter-Gebertمشاهده پروفایل

استاد

• Geometry
• Visualization
• Computer Science
• +۷ مورد دیگر

Professor Jürgen Richter-Gebert is a full professor of Geometry and Visualization at the Technical University of Munich (TUM), working within the TUM School of Computation, Information and Technology. Born in 1963, he has been at TUM since 2001, following positions at ETH Zurich (1997-2001) and TU Berlin (1994-1997). His educational background includes studies at TU Darmstadt (1983-1988) and dual PhDs from TU Darmstadt and KTH Stockholm (1991-1992). Richter-Gebert's research spans combinatorial and computer-oriented geometry, with particular expertise in polytope theory and mathematical visualization software. He develops processes for the automatic generation of geometric problem solutions and is actively involved in raising the public profile of mathematics. Richter-Gebert's publications and research focus on the intersection of mathematics and computer science, with particular emphasis on projective geometry, dynamic geometry, polytope theory, and combinatorial geometry. His work demonstrates how mathematical structures can be made accessible through computerized interactive visualizations. His most notable publications include "Perspectives on Projective Geometry" (2011) and "Geometriekalküle" (2009), along with numerous papers on dynamic geometry systems. Ars Legendi Prize for excellent university teaching (2011) Karl Max von Bauernfeind Medal of the TUM (2010) MedidaPrix - media didactic university prize (2008) EASA - European Academic Software Award (2000) Communicator Preis for science communication (2021) As founder and director of the ix-quadrat mathematics exhibition at the Garching Campus, Richter-Gebert has made significant contributions to mathematics education and outreach. He has developed influential mathematical visualization tools including Cinderella, CindyJS, and iOrnament, which have received multiple awards for educational software excellence. His research group focuses on mathematical foundations, authoring systems, and mathematical visualizations with applications in education and public scenarios.