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

Danfeng Zhangمشاهده پروفایل

استاد

• Programming Languages
• Security
• Differential Privacy
• +۵ مورد دیگر

Danfeng Zhang is a faculty member at Duke University whose research sits at the intersection of programming languages and security. Active across the premier PL conferences since 2015, Zhang has served on more than two-dozen program committees and currently co-chairs the POPL Student Research Competition. Education & Affiliation: Home page: users.cs.duke.edu/~dz132 Affiliation: Duke University, United States Research Interests: Zhang’s work spans programming-language design, static and dynamic analysis, formal verification, and security. A recurring theme is developing language-based techniques that guarantee strong security and privacy properties—ranging from side-channel resistance and constant-time execution to differential-privacy proofs—while preserving performance and usability. His recent projects combine type systems, program logics, and automated reasoning to build practical verification tools for concurrent, speculative, and approximate software. Publication Trends: Across nine representative papers (2015-2024) Zhang has advanced static detection of cache side channels, automated proofs of differential privacy, and relaxed concurrency models. The trajectory shows deepening integration of security concerns into language infrastructure, with tool-building (CtChecker, SpecSafe, LightDP) that bridge formal guarantees and real-world systems. Service & Leadership: 2024 POPL Student Research Competition Co-Chair 2025 POPL Program Committee member Repeated reviewer/PC member: PLDI, SPLASH/OOPSLA, ISSTA, ECOOP, APLAS, PriSC, PASS Zhang regularly mentors student researchers through SRC sessions and workshop panels, fostering diversity and early-career participation in the programming-languages community.

Emmanuel Haucourtمشاهده پروفایل

استاد

• Directed Algebraic Topology
• Concurrency Theory
• Static Analysis of Concurrent Programs
• +۳ مورد دیگر

Emmanuel Haucourt is a Professor of Computer Science at École Polytechnique, conducting research at the Computer Science Laboratory (LIX) within the Cosynus team. His work focuses on applying directed algebraic topology to analyze concurrent programs. Research Interests: Directed Algebraic Topology, Concurrency Theory, Geometric Models in Computer Science, Static Analysis of Concurrent Programs, Software Verification, and Theoretical Computer Science. Publications Trends: His publications emphasize the use of higher-dimensional geometric structures (e.g., d-spaces, cubical areas, non-Hausdorff manifolds) to model concurrency, enabling deadlock detection and state-space reduction through theoretical advances in category theory and topology. Laboratory: Affiliated with the Computer Science Laboratory (LIX) at École Polytechnique and the Cosynus team.

Caleb Stanfordمشاهده پروفایل

استادیار

• Programming Languages
• Formal Methods
• Distributed Systems
• +۴ مورد دیگر

Caleb Stanford is an Assistant Professor in the Department of Computer Science at the University of California, Davis. He specializes in programming languages and formal methods with applications to distributed systems, data processing, and computer security. His research focuses on developing practical tools and theoretical foundations for secure and reliable systems. Research interests span programming languages theory, formal verification techniques for distributed systems, Rust ecosystem security, stream processing verification, and automata theory extensions. Specific projects include securing Rust crates through automated auditing tools, extending derivative-based abstractions for regular expressions, and developing verification frameworks for dataflow programming. His publications demonstrate consistent focus on formal methods applications, with recent emphasis on Rust program safety (2025), stream processing verification (2020-2024), and incremental graph algorithms (2023). Article keywords frequently include formal verification, programming languages, distributed systems, and automata theory. Dr. Stanford actively recruits students for research positions: Undergraduates should demonstrate excellence in relevant coursework Prospective PhD students must apply through UC Davis admissions Current openings focus on Rust security, formal methods, and distributed systems verification He leads the Guided Incremental Digraphs (GID) research project and collaborates with UCSD on Rust security initiatives. Community contributions include serving as Artifact Evaluation Co-Chair for POPL 2024 and committee member for PLDI and OOPSLA conferences.

Jacques-Henri Jourdanمشاهده پروفایل

پژوهشگر

• Formal Verification
• Rust Programming Language
• Coq Proof Assistant
• +۵ مورد دیگر

Jacques-Henri Jourdan is a CNRS researcher at the Laboratoire Méthodes Formelles (LMF) , Université Paris-Saclay. His work focuses on formal verification and programming language design , particularly for Rust and OCaml , using proof assistants like Coq and the Iris framework. Current academic rank: Researcher (CNRS) Affiliation: LMF, Université Paris-Saclay Research highlights include: Developing Creusot , a deductive verification tool for Rust Contributing to the Iris concurrent separation logic Formalizing RustBelt for Rust's type system soundness Building a statistical memory profiler for OCaml Scientific awards: GdR GPL 2016 Thesis Prize for his PhD on formal verification Notable contributions to academia: Co-teacher of Advanced Programming at ENS Paris-Saclay Co-development of OCaml's runtime library and parser Active program committee member in POPL, ICFP, and WITS

• Formal Methods
• Concurrent Systems
• Dynamic Memory Analysis
• +۶ مورد دیگر

Alejandro Sánchez is a Post-doctoral Researcher at the IMDEA Software Institute in Madrid, Spain. His research focuses on formal methods, decision procedures, and the verification of parametrized concurrent systems and data structures. He holds a PhD in Computer Science from the Universidad Politécnica de Madrid (2015), a Master's in Programming and Software Technology from Universidad Complutense de Madrid (2011), and a Bachelor's in Computer Science from Universidad Nacional de Córdoba (2007). Education Background: PhD in Computer Science, Universidad Politécnica de Madrid (2012–2015) Master in Programming and Software Technology, Universidad Complutense de Madrid (2010–2011) Bachelor of Science in Computer Science, Universidad Nacional de Córdoba (2002–2007) Research Interests: His work emphasizes formal verification techniques for concurrent systems, including parametrized systems, dynamic memory analysis, and specialized decision procedures. Key areas include temporal logics, deductive reasoning, and the verification of complex data structures like skiplists and concurrent lists. He has developed tools like LEAP for parametrized verification and contributed decision procedures integrated with SMT solvers (Yices, Z3). Professional Contributions: He has published extensively on formal methods and concurrency, including work on invariant generation, parametrized verification diagrams, and skiplist theory. His research bridges theoretical foundations with practical tool development, addressing challenges in verifying safety and liveness properties in complex concurrent systems. Tool Development: LEAP, an interactive theorem prover he maintains, enables deductive verification of concurrent systems. He has also implemented decision procedures for pointer-based data structures, demonstrating practical applications of formal methods in real-world systems.

Sukyoung Ryuمشاهده پروفایل

استاد

• Programming Languages
• Program Analysis
• Static Analysis
• +۵ مورد دیگر

Sukyoung Ryu is a Professor in the Department of Computer Science at KAIST's College of Computing, South Korea. Her research centers on programming languages and program analysis, with significant contributions to WebAssembly, JavaScript semantics, and language specification. She leads the Programming Languages Research Group (PLRG) at KAIST. Her research spans multiple critical areas including executable specification engineering, static analysis techniques, and language interoperability. Recent work focuses on WebAssembly conformance testing, C-to-Rust translation, and bridging real-world implementations with formal semantics. Her group develops practical tools like SpecTec for mechanized language specifications and JISET for JavaScript semantics extraction. Analysis of her 15 most recent publications reveals strong trends in executable specifications (7 papers), WebAssembly tooling (5 papers), and language translation (4 papers). Key methodological approaches include record-replay debugging, filtered-simulation for binary lifting, and algebraic data type transformations for memory safety. Ryu actively contributes to the programming languages community through leadership roles including Steering Committee Chair for APLAS, Program Co-Chair for SPLASH/OOPSLA, and committee positions at POPL, PLDI, and ICFP. She frequently organizes workshops on real-world language specification (RPLS) and presents keynotes on programming language research for social good. Her mentoring activities include co-chairing New Faculty Symposia and participating in RTFM panels on faculty mentoring. She advises students through KAIST's programs and supervises research in the PLRG lab, which focuses on building practical language tools with formal foundations. Current projects emphasize WebAssembly standardization, secure language interoperability, and specification-based testing frameworks.

Xiaokang Qiuمشاهده پروفایل

دانشیار

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

Xiaokang Qiu is an Associate Professor at Purdue University's Elmore Family School of Electrical and Computer Engineering. His work bridges theoretical and applied research in programming languages and software engineering. Current Role: Associate Professor at Purdue University Research Focus: Program verification, synthesis, and automated deduction Over the past decade, Xiaokang's research has centered on advancing program synthesis techniques. His work appears in leading venues like POPL, PLDI, and SAS, where he explores: Syntax-guided synthesis for bit-vector operations Concurrent string transformation synthesis Library-based synthesis frameworks Recursive program verification He actively contributes to the academic community as a committee member and session chair at conferences including POPL, VMCAI, and SPLASH. His research addresses fundamental challenges in automating code generation while ensuring formal correctness.

Alastair F. Donaldsonمشاهده پروفایل

استاد

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

Alastair F. Donaldson is a Professor in the Department of Computing at Imperial College London, leading the Multicore Programming Group. His research focuses on programming languages, compilers, and automated testing of software systems. He previously directed GraphicsFuzz, an Imperial College spinout acquired by Google in 2018. Education: PhD in Computer Science (University of Glasgow), Postdoctoral Research Fellow (University of Oxford), Visiting Researcher (Microsoft Research Redmond) His research interests include: Compiler Design and Verification Randomized Testing Techniques Multicore and GPU Programming Formal Methods for Software Reliability Recent publications emphasize compiler fuzzing, metamorphic testing, and verification of GPU systems. He actively contributes to the development of testing tools for programming languages and hardware interfaces. Alastair holds leadership roles in academic conferences, including Publicity Co-Chair for POPL 2024 and committee roles in ASE, ECOOP, PLDI, and SPLASH. He maintains a personal website at http://www.doc.ic.ac.uk/~afd and has been registered on conf.researchr.org since 2015.

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

دانشیار

• Formal Methods
• Algorithmic Verification
• Automata Theory
• +۶ مورد دیگر

Andreas Pavlogiannis is an Associate Professor in the Department of Computer Science at Aarhus University, Denmark, where he leads research in the Programming Languages group. His work focuses on formal methods, algorithmic verification, and concurrency analysis, with additional interests in network diffusion and evolutionary graph theory. He holds a PhD from IST Austria and actively recruits PhD students and PostDocs. Research Interests: Pavlogiannis investigates foundational and applied aspects of concurrent systems, including static/dynamic program analysis, automata theory, and weak memory models. His interdisciplinary work bridges computer science with evolutionary biology through network diffusion models and game theory. Awards: Distinguished Paper Award (PLDI 2025) Best Paper Award (ASPLOS 2024) Best Presentation Award (SOAP 2024) Best Paper Award (ASPLOS 2022) Teaching: He teaches courses on Programming Languages (Bachelor), Algorithmic Model Checking (Master), and Program Analysis (Master). Service: Serves on program committees for top conferences including POPL, PLDI, CAV, and IJCAI. Organizer of CONFEST 2025. Funding: Research supported by Villum Foundation, Danish Free Research Foundation (DFF), Stibo Foundation, and Austrian Science Fund (FWF).

Manuel Hermenegildoمشاهده پروفایل

استاد

• Computer Science
• Programming Languages
• Software Engineering
• +۶ مورد دیگر

Manuel Hermenegildo is a distinguished academic holding dual appointments as a Full Professor at the Polytechnic University of Madrid (Spain) and a Distinguished Professor at the IMDEA Software Institute. He earned his Ph.D. in Computer Science from the University of Texas at Austin in 1986. His roles include Founding Director of IMDEA Software (2007–2017) and former Director of Spain's national research funding agency. He leads the CLIP Lab (UPM) and contributes to the Ciao programming language and CiaoPP analysis tool. Education: Ph.D. in Computer Science, University of Texas at Austin (1986) Research focuses on global program analysis, verification, debugging, parallelism, and logic programming. He has authored over 250 papers and received prestigious awards like the ACM Fellowship and Spain's Julio Rey Pastor Prize. His leadership roles span international organizations such as INRIA's Scientific Board and the European Association for Programming Languages and Systems (EAPS). Key contributions include static analysis frameworks, energy-aware programming models, and educational tools like the Ciao Prolog Playground. Notable collaborations include the ENTRA project for whole-system energy transparency. His work emphasizes practical applications of formal methods, with projects funded by national and international grants. Advises on policy and research strategy for EU and Spanish science initiatives.

Soham Chakrabortyمشاهده پروفایل

استادیار

• Programming Languages
• Compilers
• Computer Architecture
• +۳ مورد دیگر

Soham Chakraborty is an Assistant Professor at the Programming Languages Group, TU Delft since 2021. He previously served as an Assistant Professor at the CSE Department, IIT Delhi before joining TU Delft. His academic journey includes a PhD from Max Planck Institute for Software Systems (MPI-SWS) in 2019 and a Master's degree from CSE Department, IIT Kharagpur in 2008. Affiliation: TU Delft, IIT Delhi, MPI-SWS Research Interests: Programming Languages, Compilers, Architecture, Verification, Concurrency His research focuses on formal semantics, compiler correctness, architecture-to-architecture translation, and verification of weak memory models. He has contributed to major conferences including POPL, PLDI, CGO, and ASPLOS. His work addresses challenges in heterogeneous concurrency, relaxed memory concurrency, and binary translation for weak memory architectures. Recent works include How Hard is Weak-Memory Testing? (POPL'24) and Toast: A Heterogeneous Memory Management System (PACT'24). He also received the Distinguished Paper Award at DATE'25 and Distinguished Artifact Award at PODC'22 . Teaching: Courses like Concepts of Programming Languages (CS2120), Parallel and Concurrent Programming (CS4555), Compiler Construction (CS4555), Analysis of Concurrent and Distributed Programs (CS4405), Software Fundamentals (Rust), and Seminar Programming Languages (COL 380) Students: PhD student Dennis Sprokholt, MSc students Michal Raczkiewicz, Alexandru Dumitriu, Huixuan Wu, and alumni including Pieter van den Ham, Mingyu Gao, Jeroen Kloppenburg, and others. Service: Served on program committees for POPL, PLDI, CGO, VMCAI, APLAS, and Eurosys workshops.

Stefan K. Mullerمشاهده پروفایل

استادیار

• Type Systems
• Parallel Computing
• Resource Analysis
• +۳ مورد دیگر

Stefan K. Muller is an Assistant Professor in the Computer Science Department at Illinois Institute of Technology. His research focuses on applying programming language techniques to improve correctness and efficiency in parallel computing, with applications spanning AI, computer science education, and systems design. He earned his PhD at Carnegie Mellon University (2018) under Umut A. Acar, following a postdoc there (2018–20), and holds an AB in Computer Science from Harvard University (2012). PhD, Carnegie Mellon University (2018) Postdoc, Carnegie Mellon University (2018–20) AB, Harvard University (2012) Stefan’s work integrates type systems, static resource analysis, and concurrency to address challenges in parallelism. His recent projects include Graph Types for language-agnostic parallel computation analysis, Responsive Parallelism models for interactive systems, and Resource-aware GPU Programming tools. He has contributed to conferences like POPL, PLDI, ICFP, and SPLASH, often focusing on deadlock detection, futures-based parallelism, and efficient compiler optimizations. His publications (2012–2024) emphasize formal methods for parallel systems. Key trends include type-driven concurrency, static analysis of GPU programs, and responsive scheduling for interactive applications. He mentors students in programming language theory and parallel computing, with former advisees now at institutions like Apple, Amazon, and UPenn. Stefan’s teaching includes courses on Types and Programming Languages (CS534), Science of Programming (CS536), and Compiler Construction (CS443). Outside academia, he is a homebrewer, runner, and singer, with a Bacon number of 2 and Erdős number of 4 .

Thomas W. Repsمشاهده پروفایل

استاد

• Program Analysis
• Abstract Interpretation
• Model Checking
• +۴ مورد دیگر

Thomas W. Reps is the J. Barkley Rosser Professor & Rajiv and Ritu Batra Chair Emeritus at the University of Wisconsin-Madison , where he has been a faculty member since 1985. He is also President of GrammaTech, Inc., and a co-founder of the company. Education: Ph.D. in Computer Science from Cornell University (1982), winner of the 1983 ACM Doctoral Dissertation Award. Reps’s research spans program analysis , abstract interpretation , model checking , and computer security . His recent work focuses on quantum computing verification , probabilistic program analysis , and symbolic methods for static analysis . His publications (over 225) include foundational contributions to program slicing (1988 paper with Horwitz and Binkley, cited >1,780 times), machine-code analysis (ETAPS Best-Paper Awards in 2004 and 2008), and programming environments (co-author of The Synthesizer Generator ). Key awards include the ACM SIGPLAN Programming Languages Achievement Award (2017) , Guggenheim and Packard Fellowships , and ACM Fellow (2005) . Students: Mentored award-winning graduates like Akash Lal (SIGPLAN Outstanding Dissertation) and Venkatesh Srinivasan (Outstanding Graduate Student Research Award).

Andreea Costeaمشاهده پروفایل

استادیار

• Programming Languages
• Software Verification
• Automated Program Repair
• +۵ مورد دیگر

Dr. Andreea Costea is an Assistant Professor at the Programming Languages Group in the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at TU Delft, Netherlands. She completed her PhD at the School of Computing, National University of Singapore (NUS), and previously collaborated with NUS's Programming Languages and Software Engineering lab, Automated Program Repair team, and VERSE lab. Research: Formal Methods, Software Verification, Automated Program Repair, Rust Programming, Concurrency Funding: Ministry of Education Tier 3 Grant (2022) Projects: HIPPODROME (Java data race repair), ROBoSuSLik (heap synthesis), Mercurius (session protocols) Recent MSc Students: Matei Mirică (2025), Arjan Seijs (2025), Jim van Vliet (2025), Timen Zandbergen (2025), Arthur de Groot (2024), Julius de Jeu (2024), Matteo Bertorotta (2024). Conference Involvement: Program Committee member for PriSC 2024, PEPM 2024, SPLASH/ISSTA 2026, ICSE 2025, ICFP 2023, APLAS 2021.

Andrew Myersمشاهده پروفایل

استاد

• Programming Languages
• Computer Security
• Distributed Systems
• +۳ مورد دیگر

Andrew Myers is a Professor in the Department of Computer Science at Cornell University , focusing on Programming Languages , Computer Security , and Distributed Systems . He is an ACM Fellow and currently serves as Editor-in-Chief for ACM Transactions on Programming Languages and Systems (TOPLAS). His professional roles include program chair or co-chair for conferences such as ACM POPL 2018 , ACM CCS 2016 , and POST 2014 . His research bridges formal methods with practical language design , as evidenced by projects like the Condorcet Internet Voting System and the Viaduct compiler . Contributions span security protocols , concurrent programming , and hardware design languages . 2023 : Universally Composable Security for Program Partitioning 2022 : A Flexible Type System for Fearless Concurrency, PDL: A High-Level Hardware Design Language 2021 : Viaduct compiler for secure distributed programs 2020 : Handling Bidirectional Control Flow 2018 : MixT consistency language, Covert Channel-Free Hardware Scientific recognition includes Best Paper Awards at POPL 1999 , SOSP 2001 , SOSP 2007 , CIDR 2013 , PLDI 2013 , and PLDI 2015 . Professional service includes conference organization (e.g., ACM POPL 2018 Program Chair , Steering Committee roles in PriSC and PLDI). Myers maintains active open-source projects like civs (Condorcet Internet Voting System) and Viaduct , reflecting his commitment to secure, verifiable systems and language-driven solutions .