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

Deian Stefan is an Associate Professor at the University of California San Diego (UCSD) in the Department of Computer Science and Engineering . His research spans security , programming languages , and systems , with a focus on building principled and practical secure systems. He has served as a co-founder and Chief Scientist at Intrinsic (acquired by VMWare) and contributed to standards bodies like the W3C WebAppSec and Node.js Security Working Groups . His research interests include: Secure Systems : Web frameworks, browser designs, sandboxing, runtime systems Language-Based Security : Constant-time programming, memory safety, information flow control Verification : Security verification, static/symbolic analysis tools WebAssembly and JavaScript JITs security Deian Stefan has received multiple scientific awards , including several Distinguished Paper Awards at venues like POPL, ICFP, and USENIX Security, as well as the IEEE Cybersecurity Award for Practice (2022) and CSAW 2020 First Place for Applied Research. He has taught courses on Computer Security (CSE 127, CSE 227) and advanced topics in Building Secure Systems (CSE 291) using Rust, WebAssembly, and blockchain security. His work has been supported by collaborations with industry and academia, including projects like RLBox and COWL .

• security
• programming languages
• systems
• +۷ مورد دیگر

Tom Schrijvers is a Professor at the Department of Computer Science in the Faculty of Engineering Science at KU Leuven, Belgium. He leads the Programming Languages Group within the Declarative Languages and Artificial Intelligence (DTAI) research group. His research focuses on programming languages, particularly functional and logic programming, with special emphasis on Haskell, type systems, and algebraic effects. His research interests include: Functional Programming, especially Haskell Type Systems and Type Theory Algebraic Effects and Handlers Logic Programming, particularly Prolog Constraint Programming Domain-Specific Languages Programming Language Theory Prof. Schrijvers' recent research has focused on effect systems, staged programming, and language composition. His work on algebraic effect handlers has been particularly influential, providing new insights into how effects can be modularly composed and handled in functional languages. He has also made significant contributions to the understanding of type classes and their implementation in Haskell. His publications demonstrate a consistent focus on practical applications of programming language theory, with work spanning from foundational type theory to applied domain-specific languages for areas like fluorescence microscopy. His research often bridges the gap between theoretical programming language concepts and practical implementation concerns. Prof. Schrijvers has supervised numerous PhD students to completion, including Pieter Wuille, Benoit Desouter, George Karachalias, Steven Keuchel, Amr Saleh, Alexander Vandenbroucke, and Ruben Pieters. He currently supervises PhD students Klara Mardirosian, César Santos, Gert-Jan Bottu, Koen Pauwels, Birthe van den Berg, and Roger Bosman. His research group has received funding from various sources including EU projects like GRACeFUL. The Programming Languages Group at KU Leuven, which he leads, focuses on functional (Haskell) and logic (Prolog, Datalog, CLP) programming languages, as well as general programming language theory. The group has been active in numerous research projects and collaborations across Europe.

• Programming Languages
• Functional Programming
• Type Systems
• +۶ مورد دیگر

Limin Jia is a Research Professor in the Electrical and Computer Engineering (ECE) department at Carnegie Mellon University, with a courtesy appointment in the Computer Science Department (CSD). Affiliated with CyLab, their work focuses on applying formal techniques to enhance software security through programming language design, formal verification, and information flow analysis. Research interests span Security Programming Languages Formal Verification Information Flow Control Intermittent Computing Rust Programming . Recent publications integrate formal methods with practical security challenges, including Node.js vulnerability detection Rust API testing Secure multi-execution Intermittent computing type systems IFTTT security analysis Browser security frameworks . Limin serves on program committees for conferences like POPL, PLDI, VMCAI, and is actively involved in teaching courses such as Browser Security (18-636) Introduction to Information Security (18-631) .

• Security
• Programming Languages
• Formal Verification
• +۳ مورد دیگر

Conrad Watt is an Assistant Professor at Nanyang Technological University (NTU), Singapore , specializing in WebAssembly, formal verification, and concurrency. He previously served as a Research Fellow at Peterhouse, University of Cambridge, and earned his PhD under Peter Sewell. Co-chair of the W3C WebAssembly Community Group Active in WebAssembly standards development, including concurrency specifications Developed mechanizations in theorem provers like Isabelle/HOL Collaborator with industry (wasmtime engine) and academic teams on verification tools Research Focus: Formal verification of low-level languages, concurrency models, and security mechanisms for WebAssembly. His work bridges theoretical rigor with practical applications, including WasmRef-Isabelle and threads projects. Recent Trends: 2025 publications explore separation logic automation and concurrency experiments, while 2024-2023 work emphasizes specification toolchains (SpecTec), verified interpreters, and memory-safe execution techniques. Scientific Awards ACM Doctoral Dissertation Award Honorable Mention EAPLS Best Dissertation Award Advising: Supervises PhD students Qiyuan Xu and Antanas Kalkauskas. Collaborates with researchers like Philippa Gardner and Jean Pichon-Pharabod.

• WebAssembly
• Formal Verification
• 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.

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

Gang (Gary) Tan is a Professor at the Pennsylvania State University's College of Engineering, specializing in computer security, formal methods, and programming languages. He co-directs the Institute for Networking and Security Research (INSR) and leads the Security of Software (SOS) Group, focusing on compiler, programming language, and formal method techniques to enhance computer security. Education: B.E. in Computer Science from Tsinghua University Ph.D. in Computer Science from Princeton University His research integrates formal verification with practical security applications, particularly emphasizing: Compiler-based security enforcement Side-channel mitigation in speculative execution Fairness analysis in machine learning systems Formal grammar approaches for software reliability Key article trends show: Security-focused formal methods (15% of publications) ML fairness verification (20% of recent work) Compiler-based security solutions (30% of output) Side-channel defense mechanisms (25% of research) Parser design and formal grammar synthesis (10% of contributions) Scientific achievements include: NSF CAREER Award Google Research Awards (2x) PLDI 2024 Best Paper James F. Will Career Development Professorship Outstanding Research Award at Penn State Ruth and Joel Spira Excellence in Teaching Award Dr. Tan actively contributes to academic communities through: DARPA ISAT study group membership Program committee roles (CGO 2024, ECOOP 2018, etc) Leadership in security research initiatives

• Computer Security
• Formal Methods
• Programming Languages
• +۲ مورد دیگر

Hatem Bazian is a co-founder and Professor of Islamic Law and Theology at Zaytuna College, the first accredited Muslim liberal arts college in the U.S., and a lecturer at the University of California, Berkeley, in Near Eastern and Asian American Studies. His academic career includes roles as an adjunct professor at Boalt Hall School of Law (2002–2007) and visiting professor at Saint Mary’s College of California (2001–2007). He founded the Islamophobia Research and Documentation Project (2009) and the Islamophobia Studies Journal (2012), both addressing systemic Othering of Muslims and Islam. His work critiques settler colonialism, particularly in Palestine, and advocates for decolonial frameworks. He also serves as national chair of American Muslims for Palestine and board member of organizations like the Islamic Scholarship Fund. Research focuses on Islamic law, Middle Eastern studies, and countering Islamophobia. He has authored books like Palestine … it is something colonial (2023), analyzing Palestinian history through settler colonialism. His articles address economic critiques (e.g., federal bailouts, militarism) and university reform, emphasizing racial equity and decolonizing education. He is a columnist for Turkish media and a vocal advocate for Palestinian rights, linking grassroots activism with academic scholarship.

• Islamic Studies
• Middle Eastern Studies
• Religious Studies
• +۴ مورد دیگر

Bryan Parno is a Professor at Carnegie Mellon University in the Departments of Electrical & Computer Engineering and Computer Science . He is the recipient of the Kavčić-Moura Chair and leads the Secure Foundations Lab , focusing on end-to-end secure systems through formal verification. Research spans secure systems , applied cryptography , distributed systems , and zero-knowledge proofs Developed Verus (verified Rust systems) and Project Everest (verified HTTPS stack) Key contributions include Ironclad , Flicker , and Pinocchio , with impacts on Intel CPUs and Windows/iOS security models His work emphasizes open-source tools and reproducibility , often published in top venues like POPL, PLDI, and IEEE S&P. Recent projects address WebAssembly security and formal verification of complex distributed systems . Major Awards Jay Lepreau Best Paper Award (OSDI 2025) IEEE Cybersecurity Award for Practice (2024) Sloan Research Fellowship (2018) Test-of-Time Awards (IEEE S&P 2023, IEEE S&P 2020) Best Paper Awards at USENIX Security, OOPSLA, and PLDI

• Secure Systems
• Formal Software Verification
• Verifiable Computation
• +۷ مورد دیگر

Pierre Marquis is a distinguished Professor of Computer Science at Université d'Artois , affiliated with the Centre de Recherche en Informatique de Lens (CRIL-CNRS, UMR 8188) . Since December 2024, he has served as the vice-president for research and doctoral studies at Université d'Artois. His research focuses on Artificial Intelligence , particularly knowledge representation , automated reasoning , inconsistency handling , and knowledge compilation , with recent emphasis on Explainable AI (XAI) . Research Interests: Marquis's work spans foundational AI topics including abduction , induction , belief revision , and preference modeling . He has pioneered knowledge compilation techniques to optimize AI tasks and developed frameworks for reasoning under inconsistency through paraconsistent logics and argumentation. His EXPEKTATION chair (2020-2026) under France's national AI program drives his current focus on interpretable machine learning models. Scientific Awards: 2025: CNRS Silver Medal 2022: AAIA Fellow 2017: Senior Member of Institut Universitaire de France (IUF) 2009: EurAI (ECCAI) Fellow Doctoral Students: Mentoring Clément Lens (critical patient monitoring systems) and Mehdi Sabiri (data-knowledge integration for AI explanations). Collaborating with students like Louenas Bounia (formal XAI models) and Romain Wallon (pseudo-Boolean constraints). Grants & Projects: Leads the EXPEKTATION research chair (2020-2026) and participates in ANR PING/ACK (2019-2023), ANR THEMIS (2021-2025), CNRS IRP MAKC (2020-2024), and H2020 TAILOR (2020-2024). Previously led PIA4 MAIA (2023-2032) and Pint (2022-2023). Labs & Teams: Active in CRIL-CNRS, contributing to PyXAI (Python XAI library) and d4 (model counting), while mentoring teams on consensus belief merging and dynamic constraint processing .

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

Éric Tanter is a Full Professor in the Computer Science Department (DCC) at the University of Chile, where he also leads the PLEIAD Lab. He holds an Inria International Chair (2025–2029) and is an Associate Researcher at the Millenium Institute for Foundational Research on Data (IMFD). His academic leadership includes prior roles as Director and Deputy Director of the DCC, and Coordinator of the PhD Program in Computer Science. His research centers on programming languages and software engineering, with a strong focus on gradual typing, type systems, program verification, and secure programming. He explores both theoretical foundations and empirical practices, aiming to bridge the gap between static and dynamic language paradigms. His recent work emphasizes gradual verification, refinement types, and applications in proof assistants and security. The trends in his recent publications show a deep engagement with foundational aspects of gradual and dependent typing, often aiming to enhance the reliability and security of software systems. These works frequently involve formalization in proof assistants like Coq and explore applications in differential privacy, secure interoperability, and symbolic execution. Inria International Chair (2025–2030) Best Paper Awards at POPL 2019, OOPSLA 2018, ICFP 2018, MSR 2011, AOSD 2010, SBLP 2008, DAIS 2006 Most Influential/Most Notable Paper Awards at DLS, Programming, DLS Facebook Research Testing and Verification Award (2018) Google Faculty Research Awards (2015, 2016) Best Professor Award, University of Chile (2011) Éric Tanter has advised numerous PhD and Master’s students, many of whom have gone on to publish influential work in top venues. He has led multiple research projects funded by FONDECYT, ANID, INRIA, and other national and international agencies. His service includes editorial roles in journals such as the Journal of Functional Programming and Science of Computer Programming, and extensive participation in program committees of major conferences like POPL, ICFP, and OOPSLA. He leads the PLEIAD Lab at the University of Chile, a research group focused on programming languages, software engineering, and formal methods. The lab fosters collaboration with international institutions and emphasizes both theoretical rigor and practical impact.

• Programming Languages
• Gradual Typing
• Software Engineering
• +۹ مورد دیگر

Szende Thomas is a full Professor at Inalco (Institut National des Langues et Civilisations Orientales). He serves as Director of the EA 4514 Plidam research center and heads the Hungarian Studies section at Inalco. His academic work focuses on language teaching, cultural differences in dictionaries, and applied linguistics. Director, EA 4514 Plidam Research Center Head of Hungarian Studies Section, Inalco Member, UNESCO Chair "Language Policies for Multilingualism" Executive Committee Jury member, Paris University Thesis Prize Member, Inalco Scientific Council His research spans language didactics , applied linguistics , and lexicography . He has published extensively on second culture teaching, bilingual dictionary analysis, and language appropriation dynamics, with recent work on language-culture pedagogy and grammatical instruction methodologies. Key publication themes include: intercultural education , language policy in Central/Eastern Europe , bilingual dictionary design , and Hungarian language didactics . His academic contributions extend to methodological works like the Assimil Hungarian language series and specialized dictionaries.

• Language Didactics
• Applied Linguistics
• Lexicography
• +۳ مورد دیگر

Geoffroy Couteau is a CNRS research scientist at IRIF (Institut de Recherche en Informatique Fondamentale), Université Paris Cité, where he conducts research in theoretical and applied cryptography. He obtained his PhD from École Normale Supérieure de Paris in 2017 under the supervision of David Pointcheval and Hoeteck Wee, followed by a postdoctoral position at Karlsruhe Institute of Technology (KIT) from 2017 to 2019. His primary research interests include secure multiparty computation, zero-knowledge proofs, and the theoretical foundations of cryptography, with a particular emphasis on pseudorandom correlation generators and efficiency improvements in cryptographic protocols. He has made significant contributions to fine-grained cryptography, non-interactive zero-knowledge proofs, and post-quantum secure computation. The recent publications reflect a strong trend toward foundational advances in secure computation, with increasing focus on efficiency, practicality, and connections to complexity theory and learning theory. His work often bridges theoretical hardness assumptions with practical protocol design. ERC Starting Grant (2023) for project OBELiSC (Overcoming Barriers and Efficiency Limitations in Secure Computation) Geoffroy Couteau has advised numerous PhD and master’s students, including Dung Bui, Clément Ducros, Eliana Carozza, and Ulysse Léchine. He has also hosted many visiting students and postdocs, fostering a vibrant research group. He has served on the program committees of major conferences such as EUROCRYPT, CRYPTO, TCC, and PKC. He is currently leading research in cryptography at IRIF and is involved in postdoctoral hiring for projects in advanced cryptographic primitives. He maintains a research blog and resource collection for students, including LaTeX templates, a probability cheat sheet, and curated answers to common cryptography questions.

• Cryptography
• Secure Multiparty Computation
• Zero-Knowledge Proofs
• +۵ مورد دیگر

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

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

Amal Ahmed is a Professor and Associate Dean for Graduate Programs at Khoury College of Computer Sciences, Northeastern University, USA. Her career spans over two decades, with a focus on correct and secure compilation , safe language interoperability , and semantic type systems . Research Interests: Her work addresses key challenges in Secure compilation across software-hardware stacks Design of sound foreign-function interfaces (FFIs) Typed compiler intermediate languages for multi-language systems Probabilistic and modal separation logic Gradual typing with parametricity Provenance and concurrency semantics Recent Publications highlight advancements in application binary interfaces , probabilistic logic , WebAssembly interoperability , and gradual typing . These works span POPL , ICFP , LICS , and PLDI , with collaborations across institutions like Cornell and UBC. Scientific Recognition: NSF CISE CAREER Workshop awardee (2016) Editorial Board, Journal of Functional Programming (2017–present) Editorial Board, Mathematical Structures in Computer Science (2016–present) Advising & Mentorship: She mentors PhD students like John Li (co-advised with Steven Holtzen) and Andrew Wagner, alongside postdocs and undergraduates. Alumni include Daniel Patterson (Assistant Teaching Professor at Northeastern), Max New (Assistant Professor at U. Michigan), and William Bowman (Assistant Professor at UBC). Professional Leadership: Active in program committees for POPL , OOPSLA , and LICS , she co-organizes workshops like Dagstuhl Seminars and chairs PLDI 2024 and POPL 2023 .

• correct and secure compilation
• linking types for multi-language software
• typed compilation of dependent types
• +۱۲ مورد دیگر

Florian Brandner is an Associate Professor at Télécom Paris , Institut Polytechnique de Paris, and a member of the AuTonomous Critical Embedded Systems (ACES) team within the Information Processing and Communication Laboratory (LTCI) . His research focuses on compiler backend optimization for embedded processors , especially VLIW architectures , in the context of real-time systems . He specializes in worst-case execution time (WCET) optimization , code generation techniques, register allocation, and dynamic binary translation. His work addresses challenges in identifying code paths critical for WCET and ensuring predictable behavior in embedded environments. Academic Appointments: Associate Professor (HDR) at Télécom Paris (2025–present); previous roles at COMPSYS team, ENS Lyon; Microsoft Research; Technical University of Denmark. Research Grants: Involved in projects like Designing Formally Verified Predictable Architectures (CEA 2023–2026), Collaborative Action on Timing Interferences (ANR 2022–2026), and Time-Predictable Cache Management (CEA 2016–2019). Scientific Awards: Outstanding Paper at ECRTS'25, Best Paper at RTNS'22, RTNS'20, SoftCOM'17, and RTNS'15. Patents: Co-inventor of Time-Division Multiplexing Methods (US Patent US20210397488A1, French Patent FR3087982B1). Recent Publications highlight advancements in formal verification for memory controllers (Real-Time Systems 2023), causality modeling in timing anomalies (STTT 2022), and context-sensitive cache analysis (Real-Time Systems 2022). His work spans real-time systems theory, practical compiler design, and hardware-software co-verification.

• Real-Time Systems
• Embedded Systems
• Compiler Optimization
• +۵ مورد دیگر