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

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.

• GPU Computing
• Parallel Computing
• Domain-Specific Languages
• +۵ مورد دیگر

Prof. Dr.-Ing. Richard Membarth is a Research Professor for System-on-a-Chip and AI at the Edge Computing at Technische Hochschule Ingolstadt (THI). He is affiliated with the Hardware-Software Co-Design group and holds a secondary position at the German Research Center for Artificial Intelligence (DFKI) Saarbrücken. Co-creator of DSL frameworks like AnyDSL and Hipacc Key contributor to MetaDL (AI metaprogramming) and PRIME (predictive rendering) His research bridges GPU computing , domain-specific languages , and compiler technology , with recent work on Vulkan SPIR-V compilation and device-driven SpMV algorithms . Notable awards include the HiPEAC Paper Award (2018) and multiple Best Paper Awards for his compiler frameworks.

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

پژوهشگر

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

Dr. Théo Winterhalter is a researcher at the Deducteam within INRIA Saclay and the Laboratoire de Méthodes Formelles (LMF) at École Normale Supérieure Paris-Saclay. Previously, he held a postdoctoral position at the Max Planck Institute for Security and Privacy (MPI-SP) in Bochum, Germany. He completed his PhD in computer science at the University of Nantes under the supervision of Nicolas Tabareau and Matthieu Sozeau, focusing on the formalization and meta-theory of type theory. His research centers on proof assistants, particularly Coq, and involves advancing formal methods for security, type systems, and dependent type theory. Winterhalter's work includes contributions to the MetaCoq project, enabling meta-programming and formal reasoning about Coq itself. He is also involved in developing verified cryptographic frameworks like SSProve and SecRef*, ensuring secure integration of verified and unverified code. His educational background includes a PhD in type theory and prior work in cryptographic algorithms, such as randomized scalar multiplication. He actively participates in academic communities, serving on program committees for ICFP, TYPES, and POPL. His teaching includes co-teaching the MPRI course on proof assistants with Yannick Forster. Supervision activities include PhD student Yann Leray and multiple interns focusing on Coq extensions and formal verification.

Koushik Senمشاهده پروفایل

استاد

• Software Engineering
• Programming Languages
• Formal Methods

Koushik Sen is a Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley. His research focuses on developing software tools and methodologies to enhance programmer productivity and software quality, with expertise in Software Engineering, Programming Languages, and Formal Methods. Education: B.Tech from Indian Institute of Technology, Kanpur M.S. and Ph.D. in Computer Science from University of Illinois at Urbana-Champaign Research Focus: Professor Sen pioneers automated testing techniques including concolic testing and DART (Directed Automated Random Testing). His work bridges formal methods with practical software development, emphasizing bug detection, program synthesis, and AI-driven software analysis tools. Recent innovations include machine learning approaches for code recommendation and fuzzing. Publication Trends: His recent publications (2019-2023) demonstrate strong emphasis on fuzzing techniques, program synthesis, and AI/ML applications in software engineering. Notable domains include smart contract security, automated testing, and developer tooling, with frequent collaborations in top-tier conferences. Awards and Honors: NSF CAREER Award (2008) Sloan Foundation Fellowship (2011) IFIP TC2 Manfred Paul Award (2010) Okawa Foundation Research Grant (2015) Multiple ACM SIGSOFT Distinguished Paper Awards UIUC Distinguished Alumni Educator Award (2014) Leadership: Active program committee member for premier conferences (PLDI, ICSE, ISSTA) and keynote speaker. His research is supported by NSF, Okawa Foundation, and Sloan Foundation.

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.

Chris Hawblitzelمشاهده پروفایل

پژوهشگر

• Programming Languages
• Operating Systems
• Verification
• +۴ مورد دیگر

Chris Hawblitzel is a Senior Principal Researcher at Microsoft Research , affiliated with the Systems Research Group – Redmond . His work bridges programming languages, operating systems, verification, and security, emphasizing the integration of safe programming language features into systems development. Research interests include: Programming Languages and Type Systems Formal Verification of Systems Software Language Design for Security and Safety Systems and Networking Recent publications highlight advancements in Rust verification, linear types for systems, proof automation in F*, assembly language verification, and tactic languages. Key trends involve leveraging type systems for safety, SMT-based automation, and cross-layer formal methods. He has contributed to academic communities as a committee member for conferences such as PLDI 2025 , OOPSLA 2023 , and CPP 2019 , alongside session chair roles.

• Programming Languages
• Type Theory
• Compiler Construction
• +۴ مورد دیگر

Björn Lötters, M.Sc., is a Lecturer and research associate at the Technical University of Central Hesse (THM) within the Department of Mathematics, Natural Sciences and Computer Science. He is also a doctoral student in collaboration with the Justus Liebig University. His primary teaching responsibilities include courses on functional programming, compiler construction, and programming language design, with a focus on empowering students to explore advanced topics like dependent types and syntax abstraction. Education: Studied computer science at THM until 2019. Career: Worked as a software engineer until 2021, then transitioned to academia as a research associate and lecturer at THM. Research Focus: Programming languages (design & implementation) Type systems and type theory Metaprogramming tools Software architecture and design His ongoing research projects include a doctoral thesis on the application of intuitionistic type theory in programming languages and a study on syntax abstraction mechanisms. He actively supervises bachelor's and master's theses, offering topics related to dependent type elaborators, reference management systems, and educational LISP platforms.

Nada Aminمشاهده پروفایل

استادیار

• Programming Languages
• Artificial Intelligence
• Metaprogramming
• +۴ مورد دیگر

Nada Amin is an Assistant Professor of Computer Science at Harvard University's John A. Paulson School of Engineering and Applied Sciences (SEAS), where she leads the metareflection lab . Her research combines programming languages (PL) and artificial intelligence (AI), focusing on neuro-symbolic systems that are correct by construction, with applications in program synthesis, verification, and precision medicine. Harvard John A. Paulson School of Engineering and Applied Sciences (2019–Present) University Lecturer in Programming Languages at University of Cambridge (2017–2019) Doctoral and postdoctoral work at EPFL (2011–2017) Her research spans three core themes: Safer : Type systems and formal verification (Coq, Dafny, Frama-C) Faster : Multi-stage programming and interpreter collapsing techniques Easier : Neuro-symbolic AI for program manipulation and biological reasoning Key publications include: 2025: Modular Imperative with LLMs (LMPL), Multi-stage Relational Programming (PLDI) 2024: Persimmon for extensible variant types (OOPSLA) 2023: LURK for recursive knowledge (ICFP), Dolorem language growth pattern (ECOOP) Scientific honors include: Teaching Assistant Team Award (EPFL, 2015) Michigan Cambridge Research Initiative Grant (2018) ArsDigita Prize (1999) She has served on program committees for GPCE (co-chair), ICFP, PLDI, and organized workshops in metaprogramming and logic programming. Her teaching portfolio includes graduate courses on neurosymbolic programming, program synthesis, and advanced PL theory.

Andreas Abelمشاهده پروفایل

مدرس ارشد

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

Andreas Abel is a Senior Lecturer in the Department of Computer Science and Engineering at Gothenburg University, with additional affiliation at Chalmers University of Technology. He is a senior developer of the Agda programming language and maintains the Backus Naur Form Compiler (BNFC). His educational background includes a Computer Science diploma (1999), PhD (2006), and Habilitation (2013), all from Ludwig-Maximilians-University (LMU) Munich. His career spans positions at LMU, INRIA Paris, and Chalmers before his current role at Gothenburg University since 2013. Abel's research focuses on dependently typed programming , type theory , and verified software development . His work bridges theoretical foundations with practical implementations, particularly in the Agda proof assistant. His interests span from foundational aspects of lambda calculus and normalization to practical applications in programming language design. His publications demonstrate a consistent focus on type theory foundations and practical implementations, with recent work exploring applicative functors, cubical type theory, modalities in type systems, and formalizations of algebraic structures. His research often combines deep theoretical insights with concrete implementations in proof assistants. Distinguished Paper Award at ICFP 2019 (4 out of 39 accepted papers) Editor of Theoretical Pearls column, Journal of Functional Programming Member of IFIP WG 1.3 on Foundations of System Specification Abel actively supervises students through the Initial Types Club and Master's thesis projects, focusing on advanced topics in programming languages and type theory. He teaches Programming Language Technology and Advanced Functional Programming, emphasizing both theoretical foundations and practical implementation. His current research is supported by a Vetenskapsrådet grant for the project 'Modal Dependent Type Theory' (2020-2024), continuing his long-standing contributions to programming language theory and formal verification.

Roopsha Samantaمشاهده پروفایل

استادیار

• Program synthesis
• Program repair
• Concurrency
• +۳ مورد دیگر

Roopsha Samanta is an Assistant Professor in the Department of Computer Science at Purdue University, where she leads the Purdue Formal Methods (PurForM) research group and is a core member of the Purdue Programming Languages (PurPL) group. She completed her PhD at the University of Texas at Austin in 2013 under the supervision of E. Allen Emerson and Vijay K. Garg, followed by postdoctoral research at IST Austria (2014-2016) with Thomas A. Henzinger. Her research focuses on developing foundational techniques at the intersection of formal methods and programming languages, with primary interests in: Program synthesis and repair using semantic guidance Modular verification of distributed systems Concurrency and synchronization synthesis Robustness analysis of I/O systems Her publication record shows consistent contributions across programming languages and formal methods venues, with recent emphasis on explainable program synthesis, bounded verification of distributed systems, and semantics-guided approaches to enhance synthesis robustness. Her work frequently appears in premier conferences including PLDI, POPL, OOPSLA, and CAV. Notable scientific recognitions include: NSF CAREER Award (2019) Amazon Research Award (2021) She actively advises graduate and undergraduate researchers in the PurForM group, with current students including Nouraldin Jaber, Christopher Wagner, and Yongwei Yuan. Her research is supported by grants from NSF and Amazon. Beyond research, she teaches courses on program reasoning (CS560) and neurosymbolic program synthesis (CS592), and serves on steering committees for VMW@CAV and DARS. She also co-edits the ACM SIGPLAN Blog on PL Perspectives.

Jonathan Aldrichمشاهده پروفایل

استاد

• Programming Languages
• Software Engineering
• Verification
• +۳ مورد دیگر

Jonathan Aldrich is a Professor at Carnegie Mellon University's School of Computer Science, with joint appointments in the Software and Societal Systems Department and Computer Science Department. He directs the Master of Software Engineering program (as of July 2025) and previously led the Software Engineering Ph.D. program. Aldrich teaches courses in programming languages, software engineering, and program analysis. Education: Ph.D. in Computer Science and Engineering, University of Washington (2003) M.S. in Computer Science and Engineering, University of Washington (1999) B.S. in Engineering and Applied Science (Computer Science), Caltech (1997) Research Focus: Aldrich's work bridges programming languages and software engineering to improve software quality and productivity. His research explores how structural and behavioral design aspects can be expressed in source code, enabling better tooling and error reduction. Key innovations include gradual verification systems, typestate-oriented programming, and ownership models for security. His projects span blockchain safety (Obsidian), concurrency (AEminium), and visualization (Penrose). Publication Trends: Aldrich's 15 most recent articles reflect a strong emphasis on language-based security, formal verification (especially gradual verification techniques), and human-centered language design. His work increasingly integrates empirical studies to evaluate usability in advanced type systems. Awards: NSF CAREER Award (2006) Dahl-Nygaard Junior Prize (2007) ICSE Most Influential Paper Award (2012) DARPA Computer Science Study Group (2007) William Chan Memorial Dissertation Award (2003) Leadership & Service: Aldrich directs graduate programs, co-authored the textbook 'Programming Language Pragmatics,' and serves on the ACM Publications Board. As CTO of Noteful, he develops educational music technology. He has chaired program committees for OOPSLA, ECOOP, and SPLASH conferences.

Lionel Parreauxمشاهده پروفایل

استادیار

• Programming Languages
• Type Systems
• Compiler Optimization
• +۳ مورد دیگر

Lionel Parreaux is an Assistant Professor at the Hong Kong University of Science and Technology (HKUST) in the Department of Computer Science and Engineering since February 2021. He obtained his PhD in Computer Science from the Swiss Federal Institute of Technology, Lausanne (EPFL) in 2020, where he developed the Squid type-safe metaprogramming library for Scala. Research Interests: His work spans programming languages, type systems, functional programming, generative programming, language design, and compiler optimizations. He focuses on improving program correctness and performance through advanced type theory and compilation techniques. Publications: His recent articles concentrate on type inference methodologies, compiler optimizations (especially for functional programs), metaprogramming, and formal verification of language features. Key themes include constraint-based type systems, deforestation techniques, polymorphic subtyping, and error message improvements. Research Group: He leads a team of 8 PhD students and 1 MPhil student, with 2 MPhil students graduated in 2024. Actively recruits students for projects in programming languages and compilers. Projects: A Lightweight Type System for Scope and Effect Safety (Huawei-funded, 2024–) Optimizing Functional Programs via Graph Reduction (RGC Early Career Scheme, 2022–2025)

Matthew Flattمشاهده پروفایل

استاد

• Programming Languages
• Functional Programming
• Language Design
• +۳ مورد دیگر

Matthew Flatt is a Professor in the School of Computing at the University of Utah, specializing in programming languages, runtime systems, and functional programming. He is a primary developer of the Racket programming language and focuses on extensible language design and metaprogramming tools. PhD from Rice University (1999) Active in PLDI, ICFP, and OOPSLA program committees Developed Racket's core infrastructure including submodules and chaperones His recent research trends emphasize macro systems, language composition, and runtime engineering for functional languages. Key contributions include Rhombus (2023) for macro usability and SweetPea (2021) for experimental design DSLs.

• GPU computing
• Parallel computing
• Domain-specific languages
• +۹ مورد دیگر

Prof. Dr.-Ing. Richard Membarth is a faculty member at Technische Hochschule Ingolstadt , where he holds the professorship for System-on-a-Chip and AI for Edge Computing. He is also affiliated with the German Research Center for Artificial Intelligence (DFKI) as a Senior Researcher and Team Leader for Compiler Technologies and High-Performance Computing, and with the Saarland University Computer Graphics Lab . His research spans GPU computing, domain-specific languages, and compilers. PhD from Friedrich-Alexander University Erlangen-Nürnberg (2013) Postgraduate diploma from Auckland University of Technology His research focuses on: Parallel computer architectures and programming models Automatic code generation for embedded to HPC systems Image processing, computer graphics, and deep learning applications Domain-specific languages for performance-portable code Recent publications highlight compiler design, GPU acceleration, and parallel algorithms. Scientific awards include the HiPEAC Paper Award (2018) and GPCE Best Paper Award (2015) . Professional roles include organizing High-Performance Graphics conferences as Treasurer (2024-2025) and Papers Chair (2020).

Markus Weinhardtمشاهده پروفایل

استاد

• Reconfigurable Computing
• Compiler Development
• Image Processing
• +۳ مورد دیگر

Prof. Dr.-Ing. Markus Weinhardt is a Professor at the Faculty of Engineering and Computer Science at Osnabrück University of Applied Sciences. His research focuses on reconfigurable computing, compiler development, and image processing. He earned his Ph.D. from Karlsruhe Institute of Technology (2000) and held postdoctoral positions at Imperial College London (2000) and PACT XPP Technologies AG (2009). He leads the DFG-funded HiPReP project and organizes workshops like FSP 2016. Education: Ph.D. in Computer Science (Karlsruhe Institute of Technology), postdoctoral research at Imperial College London, and industry experience at PACT XPP Technologies AG. Research Interests: Reconfigurable architectures, FPGA-based acceleration, compiler optimization, and high-performance computing. Projects include HiPReP (high-performance reconfigurable processor) and HPVis (software optimization via FPGA coprocessors). Teaching: Courses on Hardware/Software Codesign, Programming, and Master’s projects in compiler design and hardware optimization. Key Contributions: Over 30 publications, including works on CHiPReP compilers, dynamic scheduling in reconfigurable arrays, and FPGA-accelerated algorithms.