جست‌وجوی استاد و پژوهشگر

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.

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.

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.

Thomas Peyrinمشاهده پروفایل

استاد

• Symmetric Cryptography
• Cryptanalysis
• Lightweight Cryptography
• +۵ مورد دیگر

Thomas Peyrin is a Full Professor at Nanyang Technological University (NTU) in Singapore, leading the Symmetric Key and Lightweight Cryptography Lab (SyLLab) since 2012. He co-founded TT-logic.ai, focusing on cryptographic innovations. His academic journey includes a Ph.D. in Cryptology from Orange Labs and University of Versailles (2008), a Master in Computer Science from MPRI (2005), and engineering training at CPE Lyon (2004). Education : Ph.D. (2008), MPRI Master (2005), EPFL Exchange (2003-2004), CPE Lyon (1999-2004) Career : Full Professor at NTU (2022-present), Associate Professor (2017-2022), Nanyang Assistant Professor and NRF Fellow (2012-2017), Research Fellow at NTU (2010-2012), Cryptography Expert at Ingenico (2008-2010) Thomas specializes in symmetric cryptography, cryptanalysis of hash functions and block ciphers, and machine learning applications to security. His work includes groundbreaking research on SHA-1 collisions, lightweight cryptographic primitives (e.g., GIFT, PHOTON), and automated cryptanalysis frameworks. Recent projects explore integrating AI with cryptographic verification and fault attack resistance. His publications span top conferences like CRYPTO, EUROCRYPT, and CHES, with awards including the FSE Test of Time Award (2025), FSE Best Paper (2023), and NRF Investigatorship (2022). He has advised numerous students in cryptographic research and co-founded SyLLab, a leading lab for symmetric cryptography innovation. Scientific Awards : Test of Time Award at FSE 2025 Best Paper Award at FSE 2023/ToSC NRF Investigatorship (2022) Lee Kuan Yew Postdoctoral Fellowship Best Paper Awards at FSE 2012 and ASIACRYPT 2007

• Artificial Intelligence
• Computational Social Choice
• Computational Complexity
• +۵ مورد دیگر

Edith Hemaspaandra is a Professor in the Department of Computer Science at the Rochester Institute of Technology (RIT), located in the Golisano College of Computing and Information Sciences. She holds a BS, MS, and Ph.D. in Computer Science from the University of Amsterdam (the Netherlands). Her research focuses on computational social choice, computational complexity theory, logic complexity, and formal methods. She teaches courses such as CSCI-262/263 (Introduction to Computer Science Theory) and CSCI-664 (Computational Complexity). Her work explores the algorithmic aspects of voting systems, including election manipulation, control, and bribery, with a focus on their computational complexity. She has also contributed to formal methods for automata theory, educational tools like JFLAP extensions, and the study of complexity classes such as LWPP and WPP. Her research bridges theoretical computer science with practical applications in social choice theory and algorithm design. Her grants include an NSF-funded project on computationally protecting elections from manipulation (2011). She actively publishes in top venues like STACS and ISAAC, addressing topics ranging from graph reconstruction to hybrid election models. Though no awards are explicitly listed, her extensive publication record highlights her contributions to theoretical computer science. Her advising and grant activities include collaborative research projects and educational tool development. She is affiliated with RIT’s Department of Computer Science and maintains a personal website and ORCID profile.

Albert Atseriasمشاهده پروفایل

استاد

• Computational Complexity
• Logic in Computer Science
• Finite Model Theory
• +۷ مورد دیگر

Albert Atserias is a Professor in the Department of Computer Science at the Universitat Politècnica de Catalunya (UPC), affiliated with the Faculty of Informatics of Barcelona (FIB) and the ALBCOM research group (Algorithms, Bioinformatics, Complexity, and Formal Methods). He is also associated with the Institut de Matemàtiques de la UPC-BarcelonaTech. His research is central to theoretical computer science, with a strong emphasis on logic and complexity. Atserias's research interests span Computational Complexity, Logic in Computer Science, Finite Model Theory, Proof Complexity, and Constraint Satisfaction Problems . His work explores the fundamental limits of computation, the expressive power of logical languages over finite structures, and the complexity of proving mathematical statements. He investigates the algebraic and combinatorial properties of proof systems, the limits of efficient algorithms for constraint solving, and the theoretical foundations of databases. His research often bridges logic, algebra, and combinatorics to provide deep insights into computational phenomena. The trends in his recent publications show a sustained focus on the logical and algebraic underpinnings of computational problems. Key themes include the consistency and complexity of database queries , the power and limitations of proof systems (like resolution and sum-of-squares), and the expressive power of homomorphism counts in graph theory. His work on the hardness of automating resolution and the development of circular proof systems are particularly significant contributions to proof complexity. The 2024 PODS Best Paper Award for work on relational consistency underscores the impact and timeliness of his research. Among his notable scientific awards are the prestigious ICREA Acadèmia , the PODS 2024 Best Paper Award , the Premi Extraordinari de Doctorat (Extraordinary Doctoral Prize), and the Kleene Award for Best Student Paper . These accolades reflect both the excellence of his early work and his continued leadership in the field. Atserias has been a principal investigator on numerous competitive research projects, including funding from the European Research Council (ERC) and the Spanish Ministry of Science. He has advised doctoral students, such as Toni Hakoniemi, whose thesis on proof complexity he supervised. His extensive collaborative network includes leading researchers like Phokion Kolaitis, Anuj Dawar, and Victor Dalmau. He has also served on the scientific committees of major conferences, contributing to the academic community. He is a core member of the ALBCOM research group , a leading team at UPC focused on theoretical aspects of computer science, which provides a vibrant environment for research in algorithms, complexity, and formal methods. His work is also connected to the broader Institut de Matemàtiques de la UPC, fostering interdisciplinary collaboration between computer science and mathematics.

Talia Ringerمشاهده پروفایل

استادیار

• Formal Verification
• Proof Engineering
• Theorem Proving
• +۴ مورد دیگر

Talia Ringer is an Assistant Professor in the Department of Computer Science at the University of Illinois, where she is a member of the PL/FM/SE (Programming Languages/Formal Methods/Software Engineering) research group. She leads the Illinois Theorem Provers (ITP) lab, which focuses on advancing proof engineering technologies to make formal verification accessible to programmers of all skill levels across all domains. Research Interests Dr. Ringer's research spans multiple aspects of proof engineering with a strong focus on integrating techniques from dependent type theory, program transformations, and neural proof synthesis to solve real-world verification challenges. Her work addresses how to build systems that allow programmers to prove the absence of costly or dangerous bugs in software. She is particularly interested in proof repair, machine learning for proofs, and developing new methodologies that can drive the creation of large, secure, and robust verified software and hardware systems. Research Trends Dr. Ringer's recent publications demonstrate a strong shift toward integrating machine learning with formal verification, particularly in proof repair and synthesis. Her work explores how large language models can assist with theorem proving, how reinforcement learning can automate verification processes, and how to make proof engineering more practical for real humans. Many publications involve collaborations with students and researchers from multiple institutions, reflecting her commitment to interdisciplinary research. Awards and Recognition Distinguished Paper Award at ESEC/FSE 2023 for "Baldur: Whole-Proof Generation and Repair with Large Language Models" ACM SIGPLAN Distinguished Service Award in 2023 Mentoring and Service Dr. Ringer is a dedicated mentor who has advised numerous undergraduate and graduate students. She is the founder and president of the Computing Connections Fellowship, which provides transitional funding for computer science PhD students needing to escape unhealthy environments. She is also the founder and previous chair of the SIGPLAN Long-Term Mentoring Committee (SIGPLAN-M), which connects more than 200 mentors and 300 mentees across more than 44 countries. Her service work was formally recognized with the 2023 ACM SIGPLAN Distinguished Service Award. Laboratory and Collaborations Dr. Ringer leads the Illinois Theorem Provers (ITP) lab with current members including postdocs, PhD students, masters students, and undergraduates. She collaborates extensively with researchers at the University of Washington, UMass Amherst, Google Research, Galois, and other institutions on various proof engineering projects.

Steve Awodeyمشاهده پروفایل

استاد

• Category Theory
• Homotopy Type Theory
• Algebraic Set Theory
• +۹ مورد دیگر

Steve Awodey is a Professor of Philosophy and Mathematics at Carnegie Mellon University, affiliated with the Dietrich College of Humanities and Social Sciences and the Department of Philosophy. His research bridges Category Theory, Homotopy Type Theory, and Algebraic Set Theory, with significant contributions to constructive mathematics and the philosophy of type theory. PhD in Mathematics, University of Chicago (1997), dissertation: Logic in Topoi: Functorial Semantics for Higher-Order Logic Awodey's work focuses on the intersection of categorical logic, homotopy theory, and constructive mathematics. He co-founded the Univalent Foundations Program at the Institute for Advanced Study and leads the Hoskinson Center for Formal Mathematics at CMU. His recent publications explore algebraic models of type theory, cubical set models, and higher categorical structures. His research output spans formal verification, proof-theoretic semantics, and topos-theoretic interpretations of modal logic. The 15 most recent articles emphasize Homotopy Type Theory (HoTT), polynomial functors, and applications of algebraic geometry to intuitionistic logic. Trends include univalent foundations, higher inductive types, and model category-theoretic approaches. Scientific Awards: The Dean's Chair in Logic, Carnegie Mellon University Participant Support Grant for Homotopy Type Theory Conferences NSF Grant for Homotopy Type Theory Research Advising and Grants: Awodey has advised numerous PhD students across philosophy, mathematics, and computer science on topics like Martin-Löf complexes, polynomial pseudomonads, and synthetic homotopy theory. He has secured multiple NSF grants for HoTT research and conference support, with affiliations to the Institute for Advanced Study and nLab collaborative projects. Labs and Teams: He leads the Hoskinson Center for Formal Mathematics and collaborates with the Laboratory for Symbolic and Educational Computing at CMU. His work engages international research groups in categorical logic and higher category theory.

Martin Müllerمشاهده پروفایل

استاد

• Artificial Intelligence
• Game Theory
• Monte Carlo Tree Search
• +۷ مورد دیگر

Martin Müller is a Professor in the Department of Computing Science at the University of Alberta, where he conducts research in artificial intelligence, game theory, and heuristic search. He holds the Canada CIFAR AI Chair at Amii and is an Amii Fellow, underscoring his leadership in AI. His research group focuses on Monte Carlo tree search, reinforcement learning, combinatorial game theory, and automated planning, with applications in games such as Go, Hex, and NoGo. His research interests span Monte Carlo and exact methods in game-tree search , exploration in heuristic search and machine learning , and algorithms in combinatorial game theory . He has developed open-source software like MCGS (Minimax-based Combinatorial Game Solver) and contributes to game-playing systems such as Fuego for Go. His work bridges theoretical foundations with practical implementations in AI-driven game solvers. Recent publications show a strong trend in reinforcement learning , particularly in deep Q-learning, policy gradient methods, and anomaly detection in deep RL. His team also explores combinatorial game solving , sparse reward environments , and imperfect information games . The research integrates machine learning with classical AI techniques, emphasizing empirical validation and algorithmic innovation. Canada CIFAR AI Chair Amii Fellow Best student paper award at IEEE Conference on Games 2024 Best paper award at IEEE COG 2021 Outstanding paper award at AAAI-18 Faculty of Science Dissertation Award (2016) Dissertation Award from the Canadian Artificial Intelligence Association (2013) Müller has supervised numerous PhD and MSc students, including Hongming Zhang, Henry Du, and Timo Bertram, many of whose theses focus on game AI, reinforcement learning, and combinatorial optimization. He is funded by NSERC, Mitacs, and Compute Canada. His group collaborates on projects involving neural networks for game playing, SAT solving, and planning algorithms. He is currently on sabbatical but remains academically active, teaching a graduate course on combinatorial games in 2025 and hosting visiting researchers. His lab is involved in the development of MCGS, a solver for sum games, and contributes to open-source AI software. The team publishes regularly in top venues such as NeurIPS, ICML, AAAI, and IEEE Transactions on Games. Future work includes advancing combinatorial game solvers, improving deep RL robustness, and exploring generalization in game representations.

Vedran Dunjkoمشاهده پروفایل

استاد

• Quantum Computing
• Quantum Machine Learning
• Quantum Artificial Intelligence
• +۷ مورد دیگر

Professor Vedran Dunjko is a faculty member at the Leiden Institute of Advanced Computer Science (LIACS), Leiden University, with affiliations to the Leiden Institute of Physics (LION). He leads the Applied Quantum Algorithms group and co-founded the Quantum@LIACS initiative, focusing on the intersection of quantum computing, machine learning, and artificial intelligence. His research interests include quantum machine learning, quantum-enhanced reinforcement learning, quantum heuristics, and the application of AI to quantum computing challenges. Dunjko's work bridges theoretical foundations with experimental implementations on near-term quantum devices, exploring both quantum advantages in learning and the use of classical AI for quantum system design. The recent publications show a strong trend toward proving quantum advantages in learning tasks, optimization, and topological data analysis, with publications in Nature , Nature Communications , and NeurIPS . Key themes include quantum policy gradients, quantum TDA, and reinforcement learning for quantum circuit optimization. ERC Consolidator Grant (2024) PNAS Cozzarelli Prize (2018) Editor’s Suggestion in Physical Review Letters (2014, 2018) Featured in Physics (American Physical Society) (2014, 2018) Dunjko advises several PhD candidates and postdocs, including Rahul Bandyopadhyay, Sofiene Jerbi, and Lea Trenkwalder. He has received competitive grants, most notably the ERC Consolidator Grant in 2024. His group fosters international collaborations with institutions across Europe and industry partners. The Applied Quantum Algorithms group and the Quantum@LIACS team combine theoretical investigations with practical implementations on quantum hardware, focusing on scalable quantum algorithms and AI-driven quantum discovery.

Loris D'Antoniمشاهده پروفایل

دانشیار

• Programming Languages
• Software Verification
• Program Synthesis
• +۴ مورد دیگر

Loris D'Antoni is an Associate Professor in the Department of Computer Science and Engineering at the University of California at San Diego (UCSD) . He is also a Visiting Academic at Amazon Web Services (AWS) . His research focuses on helping people write trustworthy software through techniques in program synthesis, formal verification, and machine learning robustness. Bachelor and Master in Computer Science from University of Torino (2008, 2010) PhD in Computer Science from University of Pennsylvania (2015) His research integrates programming languages , automata theory , and formal methods to ensure software reliability. Recent work explores semantics-guided synthesis and specification-aligned LLMs , with applications in network security, machine learning fairness, and automated code repair. Key trends in his publications include program synthesis , formal verification , and trustworthy AI systems . He has contributed to tools like AutomataTutor and SemGuS , a framework for customizable synthesis problems using constrained Horn clauses. Phillip R. Certain-Gary D. Sandefur Distinguished Faculty Award NSF CAREER Award Microsoft Research Faculty Fellowship Google and Facebook Faculty Awards Best Paper Award at ICDCN 2023 Distinguished Paper Award at SBES 2021 D'Antoni actively contributes to academic community service as a committee member in PLDI , OOPSLA , POPL , and CAV . He leads the Programming Systems Group at UCSD and collaborates with SemGuS research team on synthesis frameworks.

John Wawrzynekمشاهده پروفایل

استاد

• Computer Architecture
• Reconfigurable Computing
• Wireless Systems
• +۳ مورد دیگر

John Wawrzynek is a Professor of Electrical Engineering and Computer Sciences at the University of California, Berkeley. He is affiliated with the Department of Electrical Engineering and Computer Sciences in the College of Engineering and serves as Co-Director of the Berkeley Wireless Research Center and Co-PI of the CONIX Research Center, one of the six centers in the Joint University Microelectronics Program sponsored by DARPA. Dr. Wawrzynek received his B.S. in Electrical Engineering from SUNY, Buffalo (1977), M.S. in EE from the University of Illinois, Urbana/Champaign (1979), and Ph.D. in Computer Science from Caltech (1987). Before joining the Berkeley faculty in 1988, he worked as a consultant at Schlumberger Palo Alto Research. His research focuses on Computer Architecture, Reconfigurable Computing, Wireless Systems, and Integrated Circuit and System Design . His work spans both theoretical foundations and practical implementations, with particular emphasis on FPGA-based computing systems, reconfigurable architectures, and wireless communication systems. His research group has made significant contributions to the field of reconfigurable computing, including the development of the Garp architecture and various tools for reconfigurable computing systems. Analysis of his recent publications (2022-2025) reveals continued focus on reconfigurable computing, FPGA design, wireless networking, and formal methods for hardware verification. His work shows an evolution from traditional computer architecture towards specialized hardware acceleration, machine learning for EDA, and wireless systems research, with particular emphasis on SAT sampling, differentiable computing, and efficient FPGA implementation of neural networks. DAC's Most Influential Paper Award (2025) NSF Presidential Young Investigator (PYI) (1989) Charles Lee Powell Fellowship (1985) NASA Certificate of Recognition (1983) Rensselaer Engineering and Science Medal (1975) Professor Wawrzynek has advised numerous graduate students throughout his career, many of whom have gone on to prominent positions in both industry and academia including Google, Xilinx, and MIT Lincoln Laboratory. His research has been supported by various grants from NSF, DARPA, and industry partners. He leads the Berkeley Wireless Research Center, which focuses on next-generation wireless communication systems and technologies, and is actively involved in the CONIX Research Center which explores connected intelligence at the network's edge.

David A. Plaistedمشاهده پروفایل

استاد پژوهشی

• Mechanical theorem proving
• Term rewriting systems
• Logic programming
• +۳ مورد دیگر

David A. Plaisted is a Research Professor in the Department of Computer Science at the University of North Carolina at Chapel Hill. He joined UNC-Chapel Hill as a full professor after serving on the faculty of the Computer Science Department at the University of Illinois at Urbana-Champaign until 1984. His academic career spans several decades with significant contributions to automated reasoning and computational logic. Bachelor's degree in Mathematics from the University of Chicago (1970) Ph.D. in Computer Science from Stanford University (1976) Professor Plaisted's research focuses on mechanical theorem proving, term rewriting systems, logic programming, and algorithms. His work in term-rewriting systems investigates methods of combining them with first-order theorem provers, including techniques for applying efficient permutation group algorithms to equational theorem proving. In mechanical theorem proving, he has developed a sequence of methods including clause linking with semantics and ordered semantic hyper-linking. His research in logic programming includes developing tests to eliminate the occurrence check in Prolog while maintaining semantics. His work spans theoretical foundations to practical applications in program verification and generation. His recent publications demonstrate continued innovation in automated reasoning, particularly in semantic guidance for theorem proving. His work shows a consistent focus on improving the efficiency and effectiveness of automated deduction systems, with recent contributions to SGGS (Semantically-Guided Goal-Sensitive) theorem proving and analysis of the relationship between semantics and unification in proof systems. Professor Plaisted has served on numerous program committees and editorial boards including the Journal of Symbolic Computation, Information Processing Letters, Mathematical Systems Theory, and Fundamenta Informaticae. He is currently on the editorial board of ACM Transactions on Computational Logic and the electronic Journal of Functional and Logic Programming. He has organized significant conferences including serving as co-chair of the Second International Conference on Rewriting Techniques and Applications in 1987. He has spent several sabbaticals at prestigious institutions including SRI in Menlo Park (1982-1983), the Max-Planck Institute and University of Kaiserslautern in Germany (1993-1994), and research visits to groups in Grenoble and Nancy, France (1998).

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

استادیار

• Large Language Models
• Mathematical Reasoning
• Code Generation
• +۴ مورد دیگر

Sean Welleck is an Assistant Professor at Carnegie Mellon University's School of Computer Science, specifically within the Language Technologies Institute (LTI). He leads the L3 Lab and serves as an advisor for the AI for Math Fund. His academic journey includes a PhD from New York University under Kyunghyun Cho and postdoctoral positions at the Allen Institute for Artificial Intelligence and the University of Washington with Yejin Choi. Dr. Welleck's educational background shows a strong foundation in computer science. He earned his PhD in Computer Science from New York University, where he worked under the mentorship of Kyunghyun Cho and Zheng Zhang. Prior to this, he completed his MSE and BSE in Computer Science from the University of Pennsylvania, demonstrating a long-standing commitment to the field. Dr. Welleck's research focuses on bridging informal and formal reasoning with AI, with particular emphasis on developing learning, inference, and evaluation algorithms for large language models. His work spans multiple cutting-edge areas including mathematical reasoning , code generation , inference algorithms , and AI reasoning agents . A significant portion of his recent work involves combining AI with formal methods for mathematics, where he has developed frameworks like Llemma (an open-source language model for mathematical reasoning) and meta-generation (for inference-time algorithms). His research is characterized by a strong theoretical foundation coupled with practical applications that push the boundaries of what AI systems can achieve in formal reasoning domains. Analysis of Dr. Welleck's recent publications reveals a clear research trajectory focused on enhancing language models' capabilities in formal reasoning and mathematical problem-solving. His work demonstrates an evolution from foundational research in neural text generation to increasingly sophisticated approaches that integrate formal methods with deep learning. Key trends include the development of inference-time algorithms that improve model performance without additional training, frameworks for mathematical reasoning that connect informal and formal proofs, and novel evaluation methodologies for language models. His publications consistently appear in top-tier conferences including NeurIPS, ICLR, ICML, and ACL, reflecting the high impact of his contributions to the field. Dr. Welleck's scientific achievements have been recognized with several prestigious awards: NAACL 2025 Best Paper Award ICLR 2025 Oral Presentation (Top 2%) ICLR 2025 Spotlight Presentation (Top 5%) NeurIPS 2021 Outstanding Paper Award (Top 0.1%) for MAUVE NVIDIA AI Labs Pioneering Research Award (2017 and 2018) As an educator and mentor, Dr. Welleck actively guides the next generation of AI researchers. He currently advises multiple PhD students including Pranjal Aggarwal, Weihua Du, Andre He, and Seungone Kim (some co-advised with other faculty), along with MS students Riyaz Ahuja, Jiewen Hu, Qinyue Tan, and Thomas Zhu, and undergraduate Tate Rowney. At CMU, he teaches advanced courses such as Neural Code Generation and Advanced NLP, and has previously taught at New York University and the University of Washington. His commitment to education extends to creating resources like the Thesis Review Podcast and developing tutorials on neural theorem proving that have been presented at major conferences. Dr. Welleck leads the L3 Lab at CMU, which focuses on the intersection of language, learning, and logic. The lab brings together students and researchers to tackle challenging problems in AI reasoning, with particular emphasis on mathematical reasoning and code generation. Recent initiatives include the development of Llemma, an open-source language model specialized for mathematical reasoning, and work on inference-time algorithms that enable language models to improve their performance through additional computation during inference rather than through additional training.