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

Théo Winterhalterمشاهده پروفایل

پژوهشگر

• Type Theory
• Proof Assistants
• Formal Verification
• +۳ مورد دیگر

Théo Winterhalter is a researcher at INRIA Saclay and a member of the Laboratory of Mathematics and Computer Science (LMF) at ENS Paris-Saclay . He previously held a postdoctoral position at the Max Planck Institute for Security and Privacy (MPI-SP) and completed his PhD at the Gallinette research team in Nantes, supervised by Nicolas Tabareau and Matthieu Sozeau. Education PhD in Computer Science, 2017–2020, University of Nantes (Gallinette/Inria) MSc in Computer Science, École Normale Supérieure de Rennes Research interests include type theory , proof assistants , formal verification , and dependent types . He actively works on improving the safety and usability of proof assistants like Rocq (formerly Coq), focusing on rewrite rules, erasure, and cryptographic verification. His work often involves formalizing results within proof assistants and developing tools for verified programming. Contributions span conferences like POPL, ICFP, CPP, and TYPES. Recent projects include foundational verification of high-speed cryptography ( The Last Yard ), type-preserving rewrite rules ( The Rewster ), and modular cryptographic proofs ( SSProve ). His publications emphasize formal methods and computational assumptions in type theory. Teaching includes the Proof Assistants course at MPRI , a joint master’s program. He co-supervises PhD students like Yann Leray and has mentored interns on topics such as erased data implementation and Autosubst tooling. Labs and Teams : Deducteam (INRIA Saclay) – Developing deduction tools and formal verification LMF (ENS Paris-Saclay) – Laboratory for Mathematics and Computer Science Gallinette (former) – Team at INRIA Nantes MetaCoq Project – Collaborative effort on Coq verification

• Theorem Proving
• Automated Reasoning
• Formal Methods
• +۱۴ مورد دیگر

Jasmin Blanchette is a Professor of Theoretical Computer Science and Theorem Proving at the Institute for Informatics, Ludwig-Maximilians-Universität München (LMU), where he also serves as Dean of Studies for Computer Science since January 2024. He is additionally affiliated as a guest researcher with the VeriDis group at Loria in Nancy, France. His research lies at the intersection of automated and interactive theorem proving, with a focus on higher-order logic and proof automation. Key projects include the development of tools like Sledgehammer, Nitpick, and Zipperposition, and foundational work on (co)datatypes and higher-order superposition. His recent publications reflect a strong trend in formalizing and verifying automated reasoning techniques, especially in higher-order logic, with applications in proof automation, SMT solving, and logical verification. Articles frequently appear in top venues such as CADE, ITP, and the Journal of Automated Reasoning. CADE 2023 Best Paper Award for 'Verified given clause procedures' FroCoS 2023 Best Paper Award (with Visa Nummelin and Sander Dahmen) IPA Dissertation Award (awarded to his student Petar Vukmirović) Dutch 'cum laude' distinction (awarded to his student Anne Baanen) Dutch Prize for ICT Research 2022 Blanchette has advised numerous PhD and postdoctoral researchers, many of whom are now active contributors to the formal methods community. He has received significant research grants through projects like Matryoshka and Nekoka. He is also the editor-in-chief of the Journal of Automated Reasoning and plays a central role in organizing key conferences such as ITP, CADE, and CPP. He leads an active research group at LMU, consisting of postdocs and PhD students working on topics such as higher-order superposition, formalization of voting systems, categorical logic, and proof search heuristics. The team collaborates closely with international groups, including those at Inria and TU Wien.

Frédéric Tran Minhمشاهده پروفایل

مدرس

• Proof Assistants
• Theorem Proving
• Undergraduate Mathematics Education
• +۵ مورد دیگر

Frédéric Tran Minh is a Lecturer at Esisar – Grenoble INP-UGA and a PhD student affiliated with the CTSYS team at LCIS laboratory. His career spans academic teaching, software development, and research in formal verification for education. PhD in progress on proof assistants for teaching mathematics Former software engineer in computer-assisted surgery (8 years) Member of the APPAM ANR project Develops the Yalep proof assistant environment Research focus: Integration of Lean theorem prover and mechanized proofs into undergraduate mathematics pedagogy, emphasizing interactive learning and web-based accessibility. Teaching areas: Algebra, Analysis, C Programming, and automata theory, with innovative use of proof assistants in curricula.

Emily Firstمشاهده پروفایل

استادیار

• Artificial Intelligence
• Theorem Proving
• Machine Learning
• +۳ مورد دیگر

Emily First is an incoming Assistant Professor in Computer Science at Rutgers University New Brunswick starting Fall 2025. She previously served as a postdoctoral researcher at UC San Diego under Sorin Lerner and earned her PhD in Computer Science at UMass Amherst under Yuriy Brun in the Laboratory for Software Engineering Research (LASER). Her research focuses on leveraging AI for theorem proving, working at the intersection of machine learning, software engineering, and programming languages. She specializes in creating tools for automated proof generation in proof assistants like Coq, Isabelle/HOL, and Lean. Her work explores how AI can enhance human reasoning across domains, with applications in software verification and formal logic systems. Recent publications show trends in neuro-symbolic AI, software verification, and LLM integration for formal methods. Her team's research has been recognized with ACM SIGSOFT Distinguished Paper Awards at ICSE, ACL, and ESEC/FSE conferences, along with workshop presentations at AI and Theorem Proving conferences. ACM SIGSOFT Distinguished Paper Award (ICSE 2025) ACM SIGSOFT Distinguished Paper Award (ACL Main 2024) ACM SIGSOFT Distinguished Paper Award (ESEC/FSE 2023) ACM SIGSOFT Distinguished Paper Award (ICSE 2022) Contact: emfirst@ucsd.edu (new email coming soon).

Kevin Buzzardمشاهده پروفایل

استاد

• Pure Mathematics
• Computation Theory and Mathematics
• Formal Proof Verification
• +۳ مورد دیگر

Kevin Buzzard is a Professor of Pure Mathematics at the Department of Mathematics, Faculty of Natural Sciences, Imperial College London. His work focuses on formal proof verification and the integration of computers into mathematical research. He leads projects formalizing mathematical theorems using Lean, including a 21st-century proof of Fermat’s Last Theorem. Notable talks include the 2024 Stanford MRC Public Lecture on AI in mathematics and the 2022 International Congress of Mathematicians plenary lecture on formalism trends. His research spans Pure Mathematics and Computation Theory, emphasizing collaboration between mathematicians and computer scientists. He co-maintains Mathlib, a formalized mathematical library, and teaches Lean to undergraduates. Awards include the Whitehead Prize (2023) and Senior Berwick Prize (2023) from the London Mathematical Society. Buzzard’s career includes research positions at the University of Cambridge, Harvard, and the Institute for Advanced Study. He explores how AI and theorem provers will transform mathematical practice, advocating for formalization as a foundational tool for future mathematics.

Hamed Nematiمشاهده پروفایل

استادیار

• Security of systems software
• Formal methods and program logics
• Interactive theorem proving
• +۲ مورد دیگر

Hamed Nemati is an Assistant Professor at the Division of Network and Systems Engineering under the School of Electrical Engineering and Computer Science at KTH Royal Institute of Technology in Stockholm, Sweden. He was previously a Visiting Assistant Professor at Stanford University and a Research Group Leader at the Helmholtz Center for Information Security (CISPA) , where he also worked as a PostDoc and Research Fellow. Education : PhD in Computer Science from KTH Royal Institute of Technology Research Interests : Security of systems software, formal methods and program logics, interactive theorem proving, machine code analysis, applied machine learning Current Projects : Systematic verification of multi-language security protocols, hardware-software co-design for Spectre mitigation, capability-based access control models Scientific Awards : WASP (Wallenberg AI, Autonomous Systems and Software Program) faculty member Teaching Activities : Formal Methods in Security (Fall 2020-2023) at CISPA/Saarland University Digital Forensics and Incident Response (EP2780) (Fall 2024) at KTH

Robert Y. Lewisمشاهده پروفایل

مدرس

• Formal Methods
• Logic
• Theoretical Computer Science
• +۳ مورد دیگر

Robert Y. Lewis is a Lecturer in the Department of Computer Science at Brown University, specializing in formal methods, logic, and interactive theorem proving. His work bridges computer science and mathematics, focusing on the verification of mathematical proofs and program correctness. Education: PhD in Pure and Applied Logic (2018), Carnegie Mellon University MS in Pure and Applied Logic (2015), Carnegie Mellon University BA in Mathematics (2010), Rice University Research Interests: Lewis’s research spans formal verification, logic, type theory, and automated reasoning. He explores the application of logical tools like the Lean proof assistant in mathematics education and software verification. Teaching: At Brown, he teaches courses such as Introduction to Discrete Structures and Probability and Formal Proof and Verification . Prior to Brown, he taught Logic and Modeling at Vrije Universiteit Amsterdam and served as a teaching assistant at Carnegie Mellon University. Publications: His recent work includes advancements in formalizing mathematical structures (e.g., Witt vectors, Cap Set Problem), integrating proof assistants with computational tools (Lean-Mathematica interface), and developing educational resources for logic and formal methods. Contact: Email: robert_lewis@brown.edu Office: Center for Information Technology 203, Brown University

• Programming Languages
• Formal Verification
• Compilers
• +۵ مورد دیگر

Clément Pit-Claudel is an Assistant Professor at École Polytechnique Fédérale de Lausanne (EPFL), leading the SYSTEMF lab focused on programming languages, formal methods, and systems engineering. His work bridges mathematical formalisms with practical system development to achieve full assurance in critical software and hardware. PhD in Computer Science from MIT (2016) William A. Martin Memorial Thesis Award recipient Former Senior Applied Scientist at Amazon AWS Teaching accolades including the Frederick C. Hennie III Teaching Award Research spans three axes: extensible proof-producing compilers for performance-critical systems, verified hardware compilation with cycle-accurate semantics, and interactive theorem prover tooling for democratizing verification technology. Key projects include Kôika for hardware verification, Alectryon for Coq proof visualization, and Fiat for correct-by-construction program synthesis. Recent publications address JavaScript regex verification (ICFP 2024), cryptographic server integration (PLDI 2024), and hardware simulation optimization (ASPLOS 2021). Articles demonstrate expertise in functional-to-imperative translation, domain-specific compiler extensions, and hardware-software co-verification. Scientific contributions recognized through: Distinguished artifact award (SLE 2020) MIT William A. Martin Thesis Award Frederick C. Hennie III Teaching Award Teaching philosophy emphasizes hands-on lab instruction , oral assessment , and automated tooling . Courses taught include Software Construction (undergraduate) and Interactive Theorem Proving (graduate) at EPFL. Research service includes program committee roles at Dafny, POPL, and SPLASH conferences.

Heather Macbethمشاهده پروفایل

مدرس ارشد

• Kähler Geometry
• Geometric Analysis
• Formal Verification
• +۳ مورد دیگر

Dr. Heather Macbeth is a Senior Lecturer in Pure Mathematics at Imperial College London, specializing in Kähler geometry, geometric analysis, and the formalization of mathematics. Her research develops geometric analysis techniques for complex manifolds while advancing proof verification through the Lean theorem prover. She leads the development of Lean's Mathlib library, creating formalizations for differential geometry, functional analysis, and representation theory. Her textbook The Mechanics of Proof introduces proof writing through Lean, integrating computer verification with mathematical pedagogy. Funded by a Microsoft Research Lean Award, Dr. Macbeth organizes workshops on formal mathematics and serves on the AMS Committee on Publications. Her geometric research examines Ricci solitons, Yamabe invariants, and Kähler-Einstein metrics, while her formalization work includes Sobolev inequalities and semilinear functional analysis. Research Contributions: Geometric analysis of Ricci solitons and Kähler metrics Formal verification of functional analysis theorems Proof assistant pedagogy and textbook development Contributions to Lean's mathematical library

Asta Halkjær Fromمشاهده پروفایل

پژوهشگر

• Formal Logic
• Automated Reasoning
• Theorem Proving
• +۱۳ مورد دیگر

Asta Halkjær From is a postdoctoral researcher in the Department of Computer Science at the University of Copenhagen, affiliated with the Software, Data, People & Society (SDPS) section under Dmitriy Traytel. She previously completed her PhD at DTU Compute from 2020 to 2023, focusing on formalized deduction methods in computational logic. She holds a Master’s and Bachelor’s degree from DTU in Computer Science and Software Technology, respectively, with a specialization in Artificial Intelligence and Algorithms. Her research lies at the intersection of formal logic and computer science, particularly in automated reasoning, proof assistants (Isabelle/HOL and Lean), and mechanized metatheory. She has contributed extensively to synthetic completeness proofs, tableau systems, and verified theorem provers. Her work emphasizes formal verification of logical systems, including epistemic logic, hybrid logic, and first-order logic, with a focus on soundness and completeness. The recent publications highlight a consistent trend: the mechanization of logical foundations in proof assistants. Her work bridges theoretical logic with practical verification tools, enabling reliable automation in theorem proving. She has developed and verified provers, explored axiomatic systems, and advanced the methodology of synthetic completeness, often leveraging Isabelle/HOL’s framework. Distinguished Paper Award, CPP 2023 DTU Young Researcher Award DTU Travel Grant (Executive Board Recognition) Otto Mønsted Fonden Travel Grant She has supervised BSc and MSc theses, special courses, and research projects at DTU, and currently teaches Software Development for Digital Health . She has served on program committees for CPP, ITP, and Dalí workshops and has reviewed for journals including Journal of Automated Reasoning and Journal of Logic and Computation . She has also participated in international research visits, including at VU Amsterdam. She is actively involved in building tools for formal reasoning and maintains a personal website with resources, including an Isabelle snippets generator and bibliography tools. Her work continues to advance the foundations of formal logic through mechanized proofs and practical automation.

Alexander Steenمشاهده پروفایل

استادیار

• Computational Logic
• Automated Reasoning
• Theoretical Computer Science
• +۷ مورد دیگر

Alexander Steen is an Assistant Professor (Juniorprofessor) at the University of Greifswald within the Institute of Mathematics and Computer Science. His research focuses on computational logic, automated reasoning, and theoretical computer science, with significant contributions to higher-order logic (HOL) and non-classical reasoning systems. He leads the development of the Leo-III automated theorem prover, a versatile system supporting classical HOL with choice, polymorphic logics, and higher-order modal/deontic logics. Steen's academic journey includes a Dr. rer. nat. (summa cum laude) from Freie Universität Berlin (2018), followed by post-doctoral work at the University of Luxembourg (2018-2021) as a principal investigator for the AuReLeE project on legal reasoning automation. He holds a 2024 nomination for the University of Greifswald Teaching Award and was elected Fellow of the Academy of Sciences and Humanities in Hamburg (2022). Key Research Areas: Higher-Order Logic, Automated Reasoning, Non-Classical Logics, Legal Tech, Formal Methods in AI, Computational Ethics. Major Projects: Leo-III (DFG-funded automated prover), AuReLeE (FNR-funded legal reasoning), MET (modal logic embedding tool). His recent publications (2025-2022) explore diverse applications of HOL in non-classical reasoning, legal formalization, argumentation frameworks, and TPTP infrastructure extensions. Steen actively contributes to AI governance as co-speaker of the GI AI section and deputy member of Greifswald's Senate. He also engages in science communication through works like the 2024 science comic book Was wissen wir schon (What Do We Know?), featuring his automated reasoning research. Scientific Honors: CLAR 2023 Best Paper Award, IRIS 2020 LexisNexis Best Paper Award, CASC-27 LTB Division Winner, Woody Bledsoe Travel Awards (CADE 2018, 2016), GI Junior Fellowship (2018). Advising: Supervises ongoing PhD/MSc/BSc theses in logic-based AI, modal reasoning, and legal tech at University of Greifswald and Freie Universität Berlin.

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

استادیار

• Verification
• Proof Engineering
• Dependent Type Theory
• +۳ مورد دیگر

Talia Ringer is an Assistant Professor at the University of Illinois at Urbana-Champaign , focusing on making program verification using interactive theorem provers more accessible through improved proof engineering tools and practices. Her research addresses challenges in maintaining proofs as programs evolve and advancing formal verification. Ph.D., University of Washington (2021), NSF GRFP and P.E.O. Fellow B.S., Mathematics and Computer Science, University of Maryland Former software engineer at Amazon Her research interests include: Program Verification Proof Engineering Dependent Type Theory Interactive Theorem Provers (Coq) Key trends in her publications include: Automated proof generation and repair using large language models Tool development for Coq and other proof assistants Formal verification of software and data structures Integration of identifiers and type equivalences in verification Test input generation for software reliability Scientific awards and honors: NSF Graduate Research Fellowship Program (GRFP) P.E.O. Scholar Award She has advised numerous researchers through her work and founded the SIGPLAN-M Mentoring Program and Computing Connections Fellowship . No specific student names are listed in the scraped text.

Carlo Angiuliمشاهده پروفایل

استادیار

• Type Theory
• Programming Language Foundations
• Homotopy Type Theory
• +۳ مورد دیگر

Carlo Angiuli is an Assistant Professor of Computer Science at the Luddy School of Indiana University . He is a leading researcher in type theory , with a focus on its applications to programming language design and logic . His work bridges theoretical foundations and practical implementations, particularly through dependent types , proof assistants , and homotopy type theory . His research interests include: Type Theory (foundational systems for programs and proofs) Programming Language Foundations (formal semantics and reasoning) Homotopy Type Theory (higher-dimensional structures) Dependent Types (expressive type systems) Proof Assistants (formal verification tools) Computational Logic (algorithmic reasoning) Angiuli actively contributes to the programming languages community as a POPL Program Committee member and co-author of a forthcoming textbook on dependent type theory. His students include Johnson He, Huang Xu, Kelton OBrien, and Ian Ray , who joined in Fall 2025. He has received significant recognition, including the Best Paper Award at FSCD 2019 and the School of Computer Science Distinguished Dissertation Award from Carnegie Mellon University. His current work explores advanced type-theoretic frameworks and their implementation in proof assistants like the red* family of tools. Scientific awards: Best Paper Award, FSCD 2019 (Junior Researchers category) School of Computer Science Distinguished Dissertation Award, Carnegie Mellon University He teaches courses such as Modern Dependent Types (CSCI-B619), Programming Language Foundations (CSCI-B522), and Introduction to Computer Science (CSCI-C211).

• Theoretical Computer Science
• Theorem Proving
• Automated Reasoning
• +۲۶ مورد دیگر

Jasmin Blanchette is a Professor of Theoretical Computer Science and Theorem Proving at Ludwig-Maximilians-Universität München (LMU), where he also serves as the Dean of Studies for Computer Science since January 22, 2024. He is affiliated with the Institute for Informatics and leads the Theoretische Informatik und Theorembeweisen research unit. Additionally, he is a guest researcher in the VeriDis group at Loria, Nancy. Research Interests: His research centers on strengthening proof automation for general-purpose logics and enhancing the usability of proof assistants. He combines automatic and interactive methods, bridging human and artificial intelligence in formal verification. His work spans higher-order logic, automated and interactive theorem proving, formalization of mathematical results, and foundational mechanisms for (co)datatypes and (co)recursive functions. Key projects include Sledgehammer, Nitpick, Matryoshka, Nekoka, IsaFoL, and Lean Forward. Publication Trends: His recent publications (2023–2025) show a strong focus on higher-order automated reasoning, superposition calculus, proof automation in Isabelle/HOL, and formalization of logical and mathematical concepts. There is a consistent emphasis on verification, efficiency, and integration of SAT/SMT techniques into higher-order provers. Scientific Awards: FroCoS 2023 Best Paper Award (with Visa Nummelin and Sander Dahmen) CADE 2023 Best Paper Award for 'Verified given clause procedures' (with Qi Qiu and Sophie Tourret) IPA Dissertation Award (awarded to student Petar Vukmirović) Dutch Prize for ICT Research 2022 Advising and Grants: He supervises a large team of postdocs and PhD students at LMU and co-supervises students at other institutions. His leadership in major collaborative projects like Matryoshka indicates significant grant funding and collaborative research efforts. He is editor-in-chief of the Journal of Automated Reasoning and serves on numerous steering and program committees, reflecting strong academic leadership and visibility. Labs and Teams: He leads a research group at LMU’s Institute for Informatics, focusing on theorem proving and formal methods. He is also associated with the VeriDis group at Loria, Nancy, and collaborates widely across Europe in the automated reasoning community.

Claudia Schonمشاهده پروفایل

پژوهشگر

• Automated Reasoning
• Artificial Intelligence
• Knowledge Representation
• +۳ مورد دیگر

Claudia Schon is a Researcher at the Institute of Computer Science, Department 4, University of Koblenz-Landau. Her work focuses on automated reasoning, cognitive systems, and knowledge representation. She has contributed to projects like the Corg Project, exploring cognitive reasoning mechanisms and integrating commonsense knowledge into automated theorem provers. Her research bridges logic-based AI with human reasoning models, addressing challenges in uncertainty management, associative reasoning, and deontic logic. Key areas of research include commonsense reasoning, deductive systems, and the application of large language models to knowledge selection. She has published extensively on topics such as negation in cognitive reasoning, concept contraction in description logics, and intentional forgetting in AI systems. Her work often emphasizes interdisciplinary approaches, combining formal logic with cognitive science and philosophy. Her publications from 2019 to 2024 reflect a steady focus on advancing automated reasoning methodologies, integrating human-like cognitive processes into AI systems. Recent work explores the next generation of deduction systems and the use of word embeddings for axiom selection. She has also contributed to workshops on linguistic and cognitive approaches to dialog agents, highlighting her interest in human-AI collaboration. Despite no listed scientific awards, her contributions are recognized through active publication in top-tier conferences and journals. She is affiliated with the E-KRHyper project, developing reasoning tools for description logics. Her advising roles and grants are not explicitly documented in the provided text.