Find Academic Supervisors

Benjamin PierceView profile

Professor

• Programming Languages
• Type Systems
• Language-based Security
• +4 more

Benjamin Pierce is the Henry Salvatori Professor in the Department of Computer and Information Science at the University of Pennsylvania. His research spans programming languages, formal verification, and sustainable computing, with a focus on practical applications in software reliability and security. He leads initiatives like Carbon Connect (NSF Expedition in Sustainable Computing) and serves on climate-focused committees such as Penn's Faculty Senate Select Committee on the Climate Emergency. Research Interests Pierce's work integrates theoretical and applied computer science, emphasizing: Programming Languages : Type systems, language-based security, and compiler verification Formal Methods : Computer-assisted verification, proof automation, and property-based testing Sustainability : Reducing computing's environmental impact through algorithmic efficiency and policy Recent Publications His 2023-2025 publications demonstrate a strong focus on enhancing software testing (e.g., Tyche for property-based testing), advancing formal verification tools (e.g., Coq deautomation), and pioneering sustainable computing frameworks. Climate-related research is a growing theme. Awards and Honors 2024: Distinguished Paper Award (ICSE) 2020: Best Paper Award (POPL) 2015: Most Influential Paper Award (ACM SIGPLAN) 2013: LICS Test of Time Award 2012: ACM Fellow Advising and Grants He advises 8 PhD students on topics ranging from type systems to verified compilation. Notable projects include: NSF-funded Carbon Connect expedition SHF grant for usable property-based testing Development of verification tools (VERSE, Unison) Professional Activities Serves on editorial boards for Journal of Functional Programming and Logical Methods in Computer Science , and organizes major conferences (PLDI, POPL, OOPSLA). Advocates for low-carbon virtual conferences.

• Artificial Intelligence
• Multi-Agent Systems
• Norm Enforcement
• +3 more

Bas Testerink is a Researcher at the Faculty of Science , Utrecht University , focusing on Responsible AI . He works in the AI & Data Science subtheme with research interests in Human-centered Artificial Intelligence and Applied Data Science . Email: b.j.g.testerink@uu.nl Office: Minnaert Building, Leuvenlaan 4, Room 304, Utrecht His research explores Norm Enforcement in distributed systems, Multi-Agent System design, and Runtime Verification mechanisms. Key projects include AI-assisted message processing for police and Norm-based traffic control systems . Recent publications highlight his work on Argumentation-based Inquiry (2022) and Collaborative Monitoring (2016). He also investigates Security Threats in collaborative verification and Organizational Replication through inheritance models. He contributes to: Autonomous Vehicles regulation Crime Analysis through AI Peer-to-Peer Argumentation frameworks His work appears in venues like PRIMA , ECAI , and AAMAS .

• Cyber-Physical Systems
• Real-Time Systems
• Distributed Systems
• +4 more

Geir Mathisen serves as a Professor within the Department of Technical Cybernetics, Faculty of Information Technology and Electrical Engineering at the Norwegian University of Science and Technology (NTNU). He is an active member of the Group for Industrial Computer and Instrumentation Systems, focusing on real-time systems integration and cyber-physical applications across industrial and energy domains. His educational background includes a Civil Engineering degree and a Doctorate (PhD), both earned from NTNU's Department of Technical Cybernetics, establishing foundational expertise in control systems and technical cybernetics. Professor Mathisen's research spans cyber-physical systems, deterministic networking, and distributed real-time systems with significant applications in smart grids and industrial automation. His work pioneers magnetic field energy harvesting for railway systems, edge-based fault detection for photovoltaic panels, and multi-robot coordination in sewing automation. Current investigations focus on power system state estimation, optimal power flow in smart grids, and deterministic communication channels for latency-sensitive applications. Analysis of his 2020-2024 publications reveals a strategic convergence of real-time computing with energy systems, particularly in railway energy harvesting and photovoltaic monitoring. His research consistently bridges theoretical advances in networking protocols with practical industrial implementations, emphasizing determinism and composability in distributed cyber-physical environments. Scientific Awards: No specific awards or fellowships were documented in the provided materials. Professor Mathisen actively supervises doctoral and master's students, including Johannes Schrimpf (2013 PhD thesis on industrial robot control), and offers project assignments as noted for fall 2021. His research is conducted through Norwegian collaborative projects on flexible distribution grids and smart grid services, though specific grant mechanisms remain unspecified in the source material. He contributes significantly to the Group for Industrial Computer and Instrumentation Systems at NTNU, which develops advanced solutions for industrial control, measurement systems, and cyber-physical integration, particularly in energy and manufacturing contexts.

• Cyber-Physical Systems
• Hybrid Systems Verification
• Formal Methods
• +3 more

Stefan Alexander Schupp is a researcher affiliated with the Department of Cyber-Physical Systems at Technische Universität Wien (TU Wien). His work focuses on formal verification, hybrid systems, and controller synthesis for cyber-physical systems. Department: Cyber-Physical Systems (E191-01) Research Affiliation: TU Wien Network Lab Research interests include: Hybrid and stochastic system verification Controller synthesis for real-time systems Formal methods in software engineering Design and analysis of safety-critical systems Automated model checking techniques Flowpipe construction for reachability analysis Recent publications highlight collaborations with researchers from multiple institutions, covering topics such as: Hyperproperty verification in distributed systems Metric Temporal Logic (MTL) controller synthesis Adaptive simplex architectures for bounded-liveness properties Stochastic hybrid automata analysis tools HyPro verification tool developments Probabilistic reachability optimization

Nada AminView profile

Assistant Professor

• Programming Languages
• Artificial Intelligence
• Metaprogramming
• +4 more

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.

Benjamin C. PierceView profile

Professor

• Programming Languages
• Type Systems
• Language-based Security
• +5 more

Benjamin C. Pierce is the Henry Salvatori Professor of Computer and Information Science in the School of Engineering and Applied Science at the University of Pennsylvania. As a Fellow of the ACM, he has made significant contributions to programming language theory and formal methods. His academic leadership includes previous editorial roles as co-Editor in Chief of the Journal of Functional Programming and Managing Editor for Logical Methods in Computer Science. His research spans multiple interconnected domains in programming language theory, with particular emphasis on type systems and their applications to security and verification. Pierce's work bridges theoretical foundations with practical implementations, most notably through his development of the Unison file synchronization tool and contributions to the Clowdr virtual conference platform. His research interests form a cohesive trajectory from foundational type theory to applied security and verification techniques. Pierce's scholarly output shows consistent focus on property-based testing, type systems, and formal verification methods. His recent publications demonstrate evolving interests in differential privacy verification, synchronization technologies, and the practical challenges of implementing formal methods in real-world systems. The progression of his work reflects both theoretical depth and practical relevance to software development challenges. Fellow of the ACM Author of influential textbooks Types and Programming Languages and Software Foundations Lead designer of the Unison file synchronizer Co-developer of the Clowdr virtual conference platform Former editorial leadership for multiple prominent programming languages journals As an educator and mentor, Pierce has contributed to the Programming Languages Mentoring Workshop (PLMW) and has served on numerous conference program committees. His academic service extends to SIGPLAN leadership roles including SIGPLAN Vice Chair and Steering Committee membership. His textbook Software Foundations has become a standard resource for teaching formal methods and proof assistants.

Stephanie BalzerView profile

Assistant Professor

• Programming Languages
• Type Theory
• Program Verification
• +6 more

Stephanie Balzer is an Assistant Professor in the Principles of Programming Group at Carnegie Mellon University's School of Computer Science. She received her PhD from ETH Zurich under Thomas R. Gross and focuses on developing rigorous type systems and verification logics to build failure-free, secure software through compositional and practical methods. Education: PhD (ETH Zurich), Master's (University of Zurich), Semester Thesis (University of Zurich) Her research spans session types , logical relations , and separation logic to ensure correctness and security in concurrent systems. Recent work includes verifying timed message-passing protocols and disentanglement in type systems. Key publication trends include session-typed concurrency , noninterference , and deadlock freedom across programming languages, formal methods, and security domains. She has authored multiple distinguished papers at ECOOP and POPL. Scientific Awards: NSF CAREER Award, ACM SIGPLAN Distinguished Paper, ECOOP Distinguished Paper She advises PhD students including Yue Yao, Yinsen Zhang, and Zak Kent, and has supervised former PhD students like Jules Jacobs (now at Cornell). Her grants include NSF funding for IoT verification , heterogeneous applications , and real-time protocols .

Robbert KrebbersView profile

Associate Professor

• Semantics
• Separation logic
• Theorem proving
• +7 more

Robbert Krebbers is an associate professor at the Department of Software Science at Radboud University Nijmegen, Netherlands. He is a leading researcher in program verification, specializing in separation logic and the Coq proof assistant. Krebbers is a core contributor to the Iris framework, a higher-order concurrent separation logic framework implemented in Coq. His research spans theoretical foundations of programming languages and practical applications to real-world languages including C, Rust, and Scala. His research interests focus on scaling program verification techniques to challenging programming paradigms like concurrency, higher-order functions, and modules. Krebbers' work bridges formal methods with practical language implementation, particularly in verifying memory safety and concurrency properties. He has made significant contributions to Rust verification through the RustBelt project and has pioneered techniques for verifying concurrent data structures and message-passing systems. Krebbers' recent publications demonstrate a strong trend toward verifying complex concurrency patterns, developing automated proof techniques, and applying separation logic to practical programming language features. His work frequently appears in top-tier programming languages conferences including POPL, PLDI, and ICFP, with several papers receiving distinguished paper awards. The research spans from foundational logic development to practical verification tools for real-world programming languages. As a principal investigator in the Iris project, Krebbers has secured significant research funding including the ERC Consolidator Grant for the RustBelt project. His work has influenced both academic research and industrial practice, particularly in the Rust programming language ecosystem. The Iris framework he helped develop has been adopted by numerous verification projects worldwide. Krebbers has advised PhD students including Ike Mulder (focusing on proof automation for concurrent separation logic) and Jules Jacobs (working on guarantees by construction). He has been actively involved in the programming languages research community, serving on program committees for major conferences and organizing workshops on formal methods and verification. He leads research in the Department of Software Science at Radboud University, where his group focuses on developing foundational techniques for program verification. The group collaborates closely with the Logic and Semantics Group and Foundations of Programming Group across institutions, contributing to a vibrant research ecosystem around formal methods and programming languages.

Andreas AbelView profile

Senior Lecturer

• Type Theory
• Dependent Types
• Programming Languages
• +7 more

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.

• Computer Science
• Networking
• Wireless Communication
• +4 more

Brad Karp is a Professor of Computer Systems and Networks at University College London (UCL) , holding this position since 2005. His career spans multiple institutions and roles, including a Senior Lecturer (2005-2014) and Reader (2007-2014) at UCL, Adjunct Assistant Professor at Carnegie Mellon University , and Senior Staff Researcher at Intel Research Pittsburgh . He earned his PhD in Computer Science from Harvard University (2000) , preceded by an M.Sc. (1995) and B.Sc. (1992) in the same field from Harvard and Yale respectively. Research Interests : Systems security (operating systems, web browsers, application security) Wireless networking (multi-antenna capacity, interference management) Network routing (robustness, low-latency protocols) Distributed systems (DHTs, sensor networks) Scientific Contributions focus on optimizing network performance, enhancing security architectures, and developing practical routing algorithms. His work on gradient compression (2024) and low-latency routing topologies (2018) demonstrates continued relevance in network design. Earlier publications like OpenDHT (2005) and Polygraph (2005) established foundational contributions in distributed systems and security. Awards & Recognition : Royal Society-Wolfson Research Merit Award (2005-2010) Best Paper Award (Usenix 2014) Professional Activities include program committee roles for ACM SIGCOMM (2009, 2011-2017), HotNets (2008-2017), and NSF review panels. He has examined PhD theses at the University of Cambridge (2010) and contributed to the HotNets Steering Committee (2009-2014).

Phillip RogawayView profile

Professor

• Cryptography
• Computer Security
• Data Encryption
• +4 more

Phillip Rogaway is a Professor in the Department of Computer Science at the University of California, Davis, within the College of Engineering. His work focuses on cryptography and cybersecurity, particularly authenticated encryption, secure communication protocols, and cryptographic definitions. University: University of California, Davis Department: Computer Science Ranks: Professor Rogaway's research spans foundational and applied cryptography, including deterministic encryption, format-preserving encryption, and provable security frameworks. He actively contributes to cryptographic standards like OCB and explores the social and ethical dimensions of cryptographic work. His recent publications emphasize authenticated encryption mechanisms, secure data distribution, and cryptographic efficiency. Rogaway has received grants such as the SaTC: CORE: Small: Crypto-for-Privacy (2017) and participated in workshops like the Dagstuhl Seminar on Symmetric Cryptography (2012). Rogaway also engages in educational advocacy, authoring materials like "Giving Good Talks" (2017) and "Introduction to Modern Cryptography" (2012). His work underscores the importance of aligning cryptographic practices with societal needs.

A.E. ZaidmanView profile

Professor

• Software Testing
• Test Amplification
• Mutation Testing
• +6 more

A.E. Zaidman is a Professor in the Software Technology department at Delft University of Technology's Faculty of Electrical Engineering, Mathematics and Computer Science. His research focuses on software testing, code quality, and developer tooling, with recent emphasis on socio-technical factors, environmental impacts of testing, and GitHub Actions workflows. Key Research Areas Test amplification (developer interactions with automated testing) Code smell detection and its impact on software quality Empirical studies in open-source software testing AI/ML applications in test generation and analysis Scientific Awards Best Artifact Award (2022) Best Emerging Results Paper Award (2018) Best ERA paper award (2015) Best tool demo paper award (2017) ICPC 2009 Best Paper Award Recent Publications 2025: Systematic mapping of qualitative software testing methods 2025: Industrial language engineering case studies using Spoofax 2024: Environmental impact analysis of Java testing 2024: GitHub Actions workflow smell investigations

Mario GünzelView profile

Researcher

• Real-Time Systems
• Embedded Systems
• Self-Suspension
• +4 more

Mario Günzel is a Researcher at the Department of Computer Science, Faculty of Computer Science at Technical University of Dortmund, where he works in the Design Automation for Embedded Systems research group under Prof. Dr. Jian-Jia Chen. Having completed his PhD in 2024 with a dissertation on property-based timing analysis of distributed real-time systems, he has established himself as a leading researcher in real-time systems with over 30 publications and multiple prestigious awards including Best Paper Awards at ECRTS 2023 and EMSOFT 2024, as well as an Outstanding Paper Award at RTSS 2024. PhD in Computer Science, Technical University of Dortmund (2024) M.Sc. in Mathematics, University of Duisburg-Essen (2019) B.Sc. in Mathematics, University of Duisburg-Essen (2017) Günzel's research focuses on the theoretical and practical aspects of real-time systems, particularly in self-suspending tasks and end-to-end latency analysis of cause-effect chains. His work bridges formal methods with practical applications in embedded systems, automotive systems, and robotics. He has developed evaluation frameworks like SSSEvaluation and E2EEvaluation that have become important tools in the real-time systems community. His research demonstrates exceptional depth in both theoretical foundations and practical implementations, with significant contributions to scheduling algorithms, timing analysis, and real-time operating systems. The recent publication trend shows Günzel's expanding research scope from core real-time scheduling problems to applications in automotive systems, electric vehicle scheduling, and ROS 2 integration. His work consistently addresses fundamental challenges in real-time systems while developing practical solutions with real-world applicability. The publications reveal a strong focus on eliminating timing anomalies, optimizing priority assignments, and developing distribution-agnostic analysis methods that advance the theoretical foundations of real-time systems. Outstanding Paper Award at IEEE RTSS (2024) Best Paper Award at ACM EMSOFT (2024) Best Paper Award at ECRTS (2023) Outstanding Bachelor Thesis Award (2017) UDE Scholarship (2014-2019) Günzel actively supervises bachelor's and master's theses, with recent completed works including 'Odometry and IMU Fusion for Pose Estimation' and 'Evaluation Framework for End-to-End Analysis'. He has served in various organizational roles for major conferences including Publicity Co-Chair for RTSS 2025 and Publicity Chair for ECRTS 2025. His service to the community extends to editorial roles for journals including Real-Time Systems Journal and ACM Transactions on Embedded Computing Systems. Under Günzel's supervision, the research group maintains important open-source tools including SSSEvaluation (Evaluation Framework for Schedulability of Self-Suspending Tasks) and E2EEvaluation (Evaluation Framework for End-to-End Latency of Cause-Effect Chains), which have been adopted by researchers worldwide. He is also involved in collaborative projects with institutions including Scuola Superiore Sant'Anna in Pisa (planned research stay Feb-Apr 2025) and Eindhoven University of Technology.

• Electronic Design Automation
• High-Level Synthesis
• Machine Learning Applications
• +3 more

Kangwei Xu is a researcher at the Chair of Design Automation (Lehrstuhl für Entwurfsautomatisierung) under Prof. Ulf Schlichtmann at the Technical University of Munich (TUM), actively advancing Electronic Design Automation through AI-driven methodologies. His core research interests include: Electronic Design Automation (EDA) High-Level Synthesis Machine Learning for EDA Neural Network Accelerators Timing Analysis Hardware Reliability Analysis of his 2024-2025 publications reveals a decisive trend in leveraging Large Language Models to revolutionize hardware design flows. Key innovations span automated C/C++ code refactoring (HLSRewriter), behavioral discrepancy testing (HLSTester), and neural network logic optimization, demonstrating how AI integration significantly enhances efficiency and accuracy in EDA toolchains while addressing longstanding challenges in synthesis and verification. Scientific Awards: No awards documented in available sources. Advising and Grants: Public records indicate no formal student advisement roles or individually attributed research grants; his work operates within the broader funded projects of TUM's Design Automation chair. Labs and Teams: Xu contributes to TUM's interdisciplinary Design Automation research group, which spans Analog EDA, Electronic System Level design, Emerging Technologies, Microfluidics, Optical NoC, Novel Microfabrication, Timing Analysis, Neural Networks and Accelerators, and Reliability, maintaining strong industry collaborations and cutting-edge experimental facilities.

• Networked Systems
• Machine Learning for Networks
• Data Center Networking
• +7 more

Philip Brighten Godfrey is a Professor in the Department of Computer Science at the University of Illinois at Urbana-Champaign (UIUC) and Technical Director at VMware (formerly Broadcom). He co-founded network verification startup Veriflow, which was acquired in 2019. His research focuses on networked systems, blending theoretical and practical approaches to low-latency networking, software-defined architectures, microservices communication, and machine learning for network optimization. Education: Ph.D. in Computer Science (UC Berkeley, 2009), B.S. in Computer Science (Carnegie Mellon, 2002) His work spans data center design, network verification (e.g., VeriFlow), congestion control (PCC Vivace), and innovative projects like cISP (Speed-of-Light Internet). Recent publications address microservice tracing (TraceWeaver), fault localization (Flock), and XR device offloading (XRgo). Notable awards include the ACM SIGCOMM Rising Star Award, NSF CAREER Award, Sloan Research Fellowship, and multiple best paper recognitions. He has chaired SIGCOMM and HotNets, and his teaching excellence in courses like CS 538 Advanced Computer Networks has been repeatedly recognized. Scientific Honors ACM SIGCOMM Rising Star Award NSF CAREER Award (2012) Sloan Research Fellowship (2014) Best Paper Awards (SIGCOMM, HotSDN, CoNEXT) IEEE ComSoc Data Storage Best Paper Engineering Council Outstanding Advisor Award (2015) Godfrey leads research in the Coordinated Science Laboratory (CSL) and contributes to the LDOS NSF Expeditions project. His group advises Ph.D. students on topics ranging from network verification to XR systems optimization, with alumni now at Meta, Google, and academic institutions like ETH Zurich.