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

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.

• 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.

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 .

Shuvendu K. Lahiriمشاهده پروفایل

پژوهشگر

• Formal Verification
• Smart Contracts
• Program Synthesis
• +۵ مورد دیگر

Shuvendu K. Lahiri is a researcher at Microsoft Research, focusing on formal verification, program synthesis, and software testing. His work bridges artificial intelligence with formal methods, particularly in blockchain security and automated code generation. 2025 : Published LLM-Vectorizer (verified loop vectorizer) and neural synthesis for SMT-assisted proof-oriented programming 2024 : Explored LLM-based test-driven code generation and natural precondition inference 2023 : Developed resource management specifications and contributed to test generation with pre-trained models 2022 : Advanced Solidity type systems and merge conflict resolution using language models His research combines large language models with formal verification tools to improve software correctness. He actively contributes to conferences like ICSE, PLDI, and ISSTA as author and committee member.

Farzaneh Derakhshanمشاهده پروفایل

استادیار

• Type Theory
• Proof Theory
• Programming Languages
• +۷ مورد دیگر

Dr. Farzaneh Derakhshan is an Assistant Professor in the Computer Science Department at Illinois Institute of Technology (Illinois Tech), where she explores logical foundations of concurrency and develops formal methods for program verification. She earned her Ph.D. in Pure and Applied Logic from Carnegie Mellon University in 2021 under Frank Pfenning, followed by a postdoctoral fellowship at CMU with Limin Jia and Stephanie Balzer. Current affiliation: Illinois Tech (since ~2021) Previous affiliation: Carnegie Mellon University (Ph.D. and postdoc) Research focus: Type theory, logical verification, and security for concurrent systems Teaching: Courses on programming languages, type systems, and security Her research addresses fundamental challenges in concurrent programming, including: Developing modal logic frameworks for system verification Designing type systems for intermittent computing Creating behavioral type systems for security guarantees Applying relational logic to GPU security and secure compilation Investigating logical foundations of session-typed processes Formal verification of cyclic process networks Current research trends include: Hybrid dynamic verification for parallel systems Logical approaches to side-channel security Formal methods for cyber-physical systems Crash-resilient computing models Security verification in decentralized applications Noninterference proofs in session-typed concurrency Scientific recognition: NSF SaTC CORE Collaborative Award #2350217 Organizing committee member at Dagstuhl Seminar 26071 Professional leadership: Program committee co-chair for PLACES 2025 Committee roles at LICS 2026, ESOP 2026, ICFP 2025, and ECOOP 2025 Regular reviewer for ACM Transactions journals Laboratory involvement: Co-director of behavioral types research at Illinois Tech Collaboration with Carnegie Mellon's formal verification group Key participant in the FACCT workshop

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

استاد

• Programming Languages
• Type Theory
• Logic
• +۷ مورد دیگر

Steve Zdancewic is the Schlein Family President's Distinguished Professor and Associate Chair in the Department of Computer and Information Science at the University of Pennsylvania's School of Engineering and Applied Science. He is a leading researcher in programming languages, formal methods, and computer security with over two decades of impactful contributions to the field. His research interests span programming languages, type theory, logic, computer security, quantum programming, and formal verification. Zdancewic has made significant contributions to information-flow security, memory safety, program synthesis, and the verification of low-level systems. His work often bridges theoretical foundations with practical applications, particularly through the development of verified systems using Coq and other proof assistants. Analysis of his recent publications reveals a strong focus on formal verification techniques, particularly using Interaction Trees and the Coq proof assistant. His research trajectory shows consistent evolution from foundational work on information-flow security toward increasingly sophisticated verification of complex systems including LLVM, quantum computing, and distributed systems. His work demonstrates a commitment to building practically useful verification tools while maintaining rigorous theoretical foundations. Distinguished Paper Award for Semantics for Noninterference with Interaction Trees (ECOOP 2023) Schlein Family President's Distinguished Professor (2021) Distinguished Paper Award for Interaction Trees (POPL 2020) Christian R. and Mary F. Lindback Foundation Award for Distinguished Teaching (2018) IEEE MICRO top picks (2013) Alfred P. Sloan Fellow (2009-2010) NSF CAREER award (2004) Zdancewic has advised numerous PhD students who have gone on to successful careers in academia and industry. His research has been supported by significant grants from NSF, including the NSF Expedition on the Science of Deep Specification. He is actively involved in multiple major research projects including Vellvm (verified LLVM), DeepSpec, and quantum programming verification. Zdancewic also co-organizes Penn's PL Club programming languages research group with Benjamin Pierce and Stephanie Weirich.

Christoph Benzmüllerمشاهده پروفایل

استاد

• Automated Theorem Proving
• Computational Metaphysics
• Artificial Intelligence
• +۵ مورد دیگر

Prof. Christoph Benzmüller is a Full Professor at the University of Bamberg (Chair for AI Systems Engineering) and an adjunct professor at Freie Universität Berlin's Department of Mathematics and Computer Science. He is a leading researcher in automated reasoning, computational metaphysics, and formal logic systems. His work focuses on integrating higher-order logic into AI to achieve transparent and ethically grounded systems. Research Interests: His research spans automated theorem proving, formal ontologies, and normative reasoning in AI. Notably, he has formalized Gödel's ontological argument using computational methods and developed the Leo theorem provers for higher-order logic. He emphasizes the use of symbolic reasoning for ethical and legal AI frameworks. Grants & Projects: He leads projects like PetraKIP (AI portfolios for teacher education) and NFDIxCS (National Research Data Infrastructure). His work is funded by DFG, EPSRC, and the Volkswagen Foundation. He also collaborates with institutions globally, including Stanford and Cambridge. Awards: Recipient of the Central Teaching Award (FU Berlin) for his Computational Metaphysics course and a DFG Heisenberg Fellowship. His research on Gödel's argument gained international media attention. Education: Studied at Saarland University, where he earned his PhD (1999) and habilitation (2006).曾是专业长跑运动员，后转向学术研究。

Tej Chajedمشاهده پروفایل

استادیار

• Formal verification of systems software
• Concurrent systems verification
• Crash-safe file systems
• +۵ مورد دیگر

Tej Chajed is an Assistant Professor in the Department of Computer Science at the University of Wisconsin-Madison, where he conducts research in formal verification of systems software. His work focuses on building and proving the correctness of critical systems, particularly file systems and concurrent software. Dr. Chajed earned his PhD from MIT in the PDOS group, followed by a one-year postdoc at VMware Research before joining UW-Madison. His academic journey reflects a strong commitment to bridging theoretical formal methods with practical systems implementation. Chajed's research centers on formal verification techniques for systems software, with particular emphasis on concurrent and crash-safe systems . His work aims to eliminate bugs in critical software through mathematical proofs of correctness. Key contributions include DaisyNFS (a verified concurrent file system), the Perennial framework for reasoning about crash safety, and Goose for connecting proofs to Go code. His research spans the intersection of programming languages, operating systems, and formal methods, developing practical tools that bring verification to real-world systems. His recent publications demonstrate a consistent trajectory toward more practical and scalable verification techniques for increasingly complex systems. The research shows progression from foundational verification frameworks to applied work on specific systems like file systems, journaling, and distributed protocols. A notable trend is the focus on making verification more accessible and practical for systems developers, bridging the gap between theoretical formal methods and real-world software engineering. Dr. Chajed serves on numerous program committees including OSDI 2025 PC, PLDI 2024 PC, SySDW 2023 PC, ECOOP 2023 ERC, CPP 2023 PC, POPL 2023 PC, PLDI 2022 PC, POPL 2022 AEC, EuroDW 2021 PC, POPL 2021 AEC, PLDI 2020 AEC, POPL 2020 AEC, and SOSP 2019 AEC, reflecting his standing in the systems and programming languages research community. In teaching, Chajed has developed and instructed courses on systems verification, operating systems, and protocol verification. He previously helped create MIT's 6.826 (Principles of Computer Systems) during his PhD. His passion for technical communication was cultivated during his time as a Communication Fellow in the EECS Communication Lab at MIT, where he continues to offer guidance to students on writing and presentation skills. His research group at UW-Madison focuses on advancing the state of the art in systems verification, with current projects centered around practical verification frameworks for concurrent and crash-safe systems.

Tobias Nipkowمشاهده پروفایل

استاد

• Formal Methods
• Interactive Theorem Proving
• Program Verification
• +۹ مورد دیگر

Professor Tobias Nipkow is a leading researcher in formal methods and interactive theorem proving at the Technical University of Munich (TUM), affiliated with the School of Computation, Information and Technology and the Department of Computer Science. He is a core developer of the Isabelle proof assistant and leads the Theorem Proving Group. His work has profoundly influenced program verification, semantics, and formalized mathematics. University: Technical University of Munich School: School of Computation, Information and Technology Department: Department of Computer Science Research Group: Theorem Proving Group Key Projects: Isabelle, Archive of Formal Proofs, Concrete Semantics His research focuses on formal verification, higher-order logic, semantics of programming languages, and verified algorithms. He has pioneered the formalization of textbook algorithms, data structures like B+-trees and quadtrees, and logical systems. His work bridges theoretical foundations with practical tools for software correctness. The most recent publications show a strong trend in verifying classical algorithms (e.g., Gale-Shapley, Earley parser), data structures (B+-trees, deques), and decision procedures, primarily using Isabelle/HOL. His contributions span foundational logic, program analysis, and educational approaches to formal methods. Best Paper Award at CADE 28 (2021) Tobias Nipkow has made extensive contributions to advising and collaborative research, co-authoring with numerous researchers and students. He has secured support for large-scale formalization efforts and contributed to major projects like the Flyspeck proof of the Kepler conjecture. His work is supported by ongoing development of the Isabelle framework and the Archive of Formal Proofs. He leads the Theorem Proving Group at TUM, which is central to the development and application of Isabelle. The group fosters international collaboration, contributes to the Archive of Formal Proofs, and advances research in automated reasoning, semantics, and verified systems.

• 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.

Jürgen Gieslمشاهده پروفایل

استاد

• Program Verification
• Automated Deduction
• Termination Analysis
• +۱۲ مورد دیگر

Jürgen Giesl is a Professor at the Teaching and Research Area Computer Science 2 within the Department of Computer Science at RWTH Aachen University , Germany. He leads research in programming languages, formal verification, automated deduction, and term rewriting systems. Research Interests: Automated Termination and Complexity Analysis of Programs Dependency Pairs and Term Rewriting Systems Verification of Probabilistic and Integer Programs Static Analysis and Symbolic Execution Model Checking and Constrained Horn Clauses Development of Automated Tools (AProVE, LoAT) His recent research, reflected in the latest publications, focuses on termination and complexity analysis for probabilistic programs, polynomial loops, and integer programs, using advanced techniques such as dependency pairs, loop acceleration, and semiring semantics. He also contributes to SMT solving and transitive relation learning for infinite-state model checking. Scientific Awards: Best Tool Paper Award at iFM 2017 Silver Medal (Second Best Paper) at SEFM '16 Best Paper Honourable Mention at IJCAR 2024 Best Student Paper Honourable Mention at IJCAR 2024 Advising and Grants: Giesl has supervised numerous PhD and Master’s students, including prominent researchers such as Fabian Frohn, Jens Hensel, Nils Lommen, and Marcel Hark. He leads a large research group focused on automated verification and has contributed extensively to international verification competitions. His work is supported by ongoing research grants and collaborations with leading institutions in formal methods. Labs and Teams: He leads the Programming Languages and Verification research group at RWTH Aachen, which develops and maintains the AProVE and LoAT tools. These tools are central to automated termination and complexity analysis and are regularly submitted to international competitions such as TERMCOMP and VBS.

Giles Regerمشاهده پروفایل

مدرس ارشد

• Automated Theorem Proving
• Runtime Verification
• Program Verification
• +۷ مورد دیگر

Giles Reger is a Senior Lecturer in the Formal Methods Group of the School of Computer Science at the University of Manchester. He completed his BA in Computer Science at the University of Cambridge in 2009, followed by an MSc in Advanced Computer Science at the University of Manchester in 2010 (awarded Highest Achiever of the Year), and earned his PhD from the University of Manchester in 2014 with a thesis titled "Automata based monitoring and mining of execution traces". His research spans several key areas within computer science: Automated Theorem Proving (first-order) Saturation-based techniques Reasoning with theories and quantifiers Finite Model finding Collaborative and Concurrent proof attempts Runtime Monitoring/Verification Temporal specification languages Specification Mining/Inference Dr. Reger leads multiple EPSRC-funded research projects including SCorCH (Secure Code for Capability Hardware), CAPS (Collaborative Architectures for Proof Search), and QuTie (reasoning with Quantifiers and Theories). His work on the Vampire theorem prover and MarQ monitoring tool demonstrates his bridge between theoretical computer science and practical applications. Recent publications show strong focus on runtime verification, theorem proving, and program analysis with applications to security and performance monitoring. Notable awards: Highest Achiever of the Year Award for MSc studies Dr. Reger collaborates extensively with institutions including the University of Oxford, Arm, Amazon Web Services, and CERN (CMS Experiment). As Manchester lead on the SCorCH project, he develops formal analysis tools for security-aware hardware chips. His work on the VyPR framework enables developers to analyze Python program performance through temporal specification languages and monitoring algorithms.

• Software Engineering
• Intelligent Systems
• Model-Based Systems Engineering
• +۳ مورد دیگر

Rüdiger Lunde is a Professor at Technische Hochschule Ulm , currently serving as Dean of Studies for Information Systems since September 2019. He previously chaired the Examination Board for programs including INF, CTS, TI, ICS, DSM, MD, and IS from 2014 to 2019. His primary research areas include Software Engineering , Intelligent Systems , and Model-Based Systems Engineering , with a focus on automated safety analysis and technical system simulation. Current Role: Dean of Studies for Information Systems Prior Role: Chair of Examination Board (2014–2019) His research leverages the smartIflow framework for safety tasks such as Failure Mode and Effects Analysis (FMEA) and Fault Tree Analysis (FTA). He has contributed to formal verification methods using Computation Tree Logic (CTL) and explored temporal reasoning across varying time scales. Recent trends in his work include: Automated safety analysis in technical systems Integration of SysML for artifact generation Model decomposition techniques for complex systems Scientific awards: Best Paper Award at International Workshop on Applications in Information Technology (IWAIT-2015) Contact: Ruediger.Lunde@thu.de | Room: A306a | Consultation hours: By appointment via email.

Brigitte Pientkaمشاهده پروفایل

استاد

• Programming Languages
• Verification
• Type Theory
• +۶ مورد دیگر

Brigitte Pientka is a Professor at McGill University's School of Computer Science , where she leads the Computation and Logic group . She earned her PhD from Carnegie Mellon University in 2003 and previously studied at the University of Edinburgh and Technical University of Darmstadt. Education PhD in Computer Science, Carnegie Mellon University (2003) University of Edinburgh Technical University of Darmstadt Research Interests Her work focuses on the theoretical and practical foundations for building reliable software systems, combining logic, type theory, and verification with system-building. Key areas include: Type Theory and Dependent Types Logical Frameworks and Mechanized Metatheory Session-Typed Concurrency and Linear Logic Metaprogramming and Contextual Type Systems Theorem Proving and Formal Verification Functional Programming and Language-Based Security Professional Roles She has served as: PC Chair for ICFP'24 and CPP'24 General Chair for POPL'20 Executive Editor of Logical Methods in Computer Science Steering Committee Member for LICS, POPL, and ESOP Scientific Awards Dr. Pientka has received: Test of Time Award at PPDP'18 Humboldt Fellowship for research at MPI-SWS, Germany Labs & Teams She actively develops the Beluga programming language , a tool for mechanizing meta-theory proofs and type-driven program manipulation.