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

Michael Carbinمشاهده پروفایل

استادیار

• Programming Systems
• Approximate Computing
• Probabilistic Programming
• +۴ مورد دیگر

Michael Carbin is the Jamieson Career Development Assistant Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT) and leads the MIT Programming Systems Group. His research focuses on programming systems that address system uncertainty to enhance performance, energy efficiency, and resilience, particularly in environments involving neural networks , approximate computing , and unreliable hardware . His work spans probabilistic programming , quantum computing , and machine learning systems . Articles highlight contributions in pruning neural networks , quantum data structures , and compiler optimization , reflecting trends in deep learning , formal verification , and language-driven systems . Scientific Awards : MIT Frank E. Perkins Award (2020) Sloan Research Fellowship (2020) Facebook Research Award (2019) NSF CAREER Award (2018) Best Paper Awards at OOPSLA (2013, 2014) He has advised numerous graduate students and postdocs including Eric Atkinson, Cambridge Yang, and Charles Yuan, and served on program committees for conferences like POPL, OOPSLA, and ICLR. His group collaborates with institutions such as MIT CSAIL and explores applications in quantum algorithms and probabilistic inference .

Shweta Shindeمشاهده پروفایل

استادیار

• Trusted Computing
• System Security
• Hardware Security
• +۴ مورد دیگر

Shweta Shinde is an Assistant Professor in the Department of Computer Science at ETH Zurich where she leads the Secure & Trustworthy Systems (SECTRS) research group. She is also a member of the Institute of Information Security and the ZISC Center at ETH Zurich. Her work bridges theoretical foundations with practical implementations in hardware and system security. Dr. Shinde's research focuses on the intersection of trusted computing, system security, and program analysis. Her group investigates both foundational aspects of security to protect phones, servers, and accelerators, as well as practical aspects of realizing these solutions through large-scale system building. Her work spans hardware security primitives, trusted execution environments, confidential computing, and secure system design across multiple platforms including mobile devices, cloud infrastructure, and blockchain systems. Her publication record demonstrates significant impact in the field, with numerous papers in top security venues including IEEE S&P, USENIX Security, CCS, and NDSS. Her research has uncovered critical vulnerabilities in major hardware security technologies like Intel SGX and AMD SEV-SNP while also proposing novel frameworks for building more secure systems. The work spans multiple domains including hardware security, cloud security, mobile security, and blockchain security, with a consistent thread of identifying and addressing fundamental security challenges in trusted computing. Among her notable achievements are multiple best paper awards including at SysTEX 2025 and nominations at DATE 2025, a Distinguished Paper Award at IEEE S&P 2024, and recognition as a Most Innovative Research Pwnie Award Nominee in 2024. Her work on WeSee received particular attention for breaking AMD SEV-SNP through novel interrupt-based attacks. Dr. Shinde actively mentors PhD students including Mark Kuhne, Supraja Sridhara, Mélisande Zonta-Roudes, Benedict Schlüter, Andrin Bertschi, and others. She teaches courses on Systems Security, Information Security Lab, Seminar on Systems Security, and Current Topics in Information Security at ETH Zurich. Her service to the community includes extensive program committee work for major security conferences including Oakland (S&P), NDSS, USENIX Security, and CCS, where she has served as track co-chair and program co-chair for several workshops.

Nate Fosterمشاهده پروفایل

استاد

• Programming Languages
• Networking
• Databases
• +۵ مورد دیگر

Nate Foster is a Professor of Computer Science at Cornell University and currently serves as the Associate Dean for Research in the Ann S. Bowers College of Computing and Information Science. He is also a Visiting Researcher at Jane Street and served as a Visiting Professor at École Polytechnique Fédérale de Lausanne during the 2023-24 academic year. His research uses ideas from programming languages to solve problems in networking, databases, and security. BA in Computer Science, Williams College (2001) MPhil in History and Philosophy of Science, University of Cambridge (2008, all work completed in 2003) PhD in Computer and Information Science, University of Pennsylvania (2009) Foster's research focuses on developing languages and tools that make it easy for programmers to build secure and reliable systems. His current work centers on the design and implementation of languages and tools for programmable networks, particularly using the P4 language. His past work includes bidirectional languages (also known as 'lenses'), database query languages, data provenance, type systems, mechanized proof, and formal semantics. His research group at Cornell has made significant contributions to network verification, software-defined networking, and formal foundations for programmable data planes. Analysis of Foster's recent publications reveals a strong focus on network verification and programming language foundations for networking. His work consistently applies formal methods to practical networking problems, with a particular emphasis on the NetKAT and P4 languages. Over the past five years, his research has evolved toward more complex network verification techniques, including infinite state verification, active learning of network models, and dependently-typed approaches to network programming. His work bridges theoretical computer science with practical networking systems, making formal methods accessible to network engineers. ACM Fellow (2025) ACM SIGPLAN Robin Milner Award (2023) ACM SIGCOMM Rising Star Award (2018) NSF CAREER Award (2013) Alfred P. Sloan Fellowship (2012) Multiple distinguished paper awards across top conferences including POPL, PLDI, and SIGCOMM Foster has advised numerous PhD and Master's students who have gone on to prominent positions in both industry and academia, with many continuing work in programming languages and networking. He has led multiple significant research grants including an NSF CAREER Award and has been involved in the P4 Language Consortium, serving as Chair of the P4 Language Governing Board. His work has been supported by various organizations including NSF, DARPA, and industry partners like Intel and Jane Street. Foster is also active in the programming languages research community, serving on numerous program committees and as Vice Chair of DARPA's Information Science and Technology (ISAT) study group. Foster leads a vibrant research group at Cornell focused on programming languages for networks, with collaborators from academia and industry. His group has developed several influential tools and frameworks including NetKAT, Petr4, and KATch. They maintain strong connections with the P4 community and work closely with industry partners to ensure their research has practical impact on real-world networking systems.

Bernhard J. Bergerمشاهده پروفایل

مدرس

• Software Security
• Static Code Analysis
• Machine Learning
• +۴ مورد دیگر

Bernhard J. Berger is a Lecturer in the Department of Computer Engineering at the Institute of Embedded Systems, Hamburg University of Technology (TUHH). His research focuses on software security, static code analysis, machine learning, optimization, and research data management. He has held significant roles such as Program Committee member for ICPC 2025 and MSR 2025, and has received awards including the Best Reviewer Award (ICPC 2023) and Best Engineering Paper Award (SCAM 2019). His work spans interdisciplinary applications including maritime systems security, GPU-accelerated AI, and evolutionary algorithms. Recent studies emphasize AI-driven security tools (e.g., ML-SAST) and domain-specific language approaches to optimization (EvoAl). He has contributed to over 30 peer-reviewed publications, with notable work in IEEE Transactions on Software Engineering and Science of Computer Programming. Berger collaborates closely with industry through DAAD review committees and serves on artifact evaluation boards for ISSTA and ARES conferences. Education: Doctoral Thesis (2022), Diploma in Computer Science (2007) Key Projects: ArchSec tool suite, Threat Modeling Frameworks, Bauhaus static analysis methodology Lab Affiliation: Embedded Systems Design Group His advisory roles include Deputy of TUHH's Election Verification Committee and Session Chair at IEEE Congress on Evolutionary Computation 2023. Current research trends integrate machine learning with static analysis for automated vulnerability detection, while also exploring explainable AI techniques for neural network optimization.

Nadia Polikarpovaمشاهده پروفایل

دانشیار

• Program Synthesis
• Program Verification
• Type Systems
• +۵ مورد دیگر

Nadia Polikarpova is an Associate Professor in the Department of Computer Science and Engineering at the University of California, San Diego . She earned her PhD from ETH Zurich in 2014 under Bertrand Meyer , followed by postdoctoral research at MIT CSAIL with Armando Solar-Lezama . Her academic contributions have been recognized with prestigious awards including the 2020 Sloan Fellowship , 2020 Intel Rising Stars Award , and 2020 NSF CAREER Award . Polikarpova's research focuses on program synthesis , program verification , and type systems . She leads the Programming Systems group at UCSD and contributes to the IFIP Working Group 2.8 on Functional Programming since 2022. Her work spans foundational research and practical tools, including projects like Synquid , SuSLik , and Laurel that combine formal methods with machine learning for code generation. Her recent publications in venues like OOPSLA , NeurIPS , and ICFP reveal trends in AI-assisted programming , live programming environments , and formal verification . She has advised numerous PhD and Master’s students including Shraddha Barke , Zheng Guo , and Tristan Knoth , many of whom have moved to prominent academic and industry positions. Notable artifacts from her lab include tools like ColDeco for spreadsheet inspection and Superfusion for eliminating intermediate data structures. 2020 : Sloan Fellow 2020 : Intel Rising Stars Award 2020 : NSF CAREER Award 2021 : Distinguished Paper at POPL 2023 : Distinguished Artifact at PLDI 2023 : Distinguished Paper at OOPSLA Polikarpova actively contributes to academic service, serving on program committees for PLDI , POPL , and OOPSLA , and co-chairing the OOPSLA Review Committee in 2023. She has delivered keynotes at APLAS'20 and PLDI'24 , emphasizing the integration of large language models with formal methods.

Marco Platznerمشاهده پروفایل

استاد

• Reconfigurable Computing
• Approximate Computing
• Self-Aware Computing
• +۷ مورد دیگر

Marco Platzner is a Professor for Computer Engineering at Paderborn University , Germany. He serves as the Dean of Research for the Faculty of Computer Science, Electrical Engineering and Mathematics and heads the Department of Computer Science. Previously, he held research positions at ETH Zurich, Stanford University, GMD (now Fraunhofer IAIS), and Graz University of Technology. Education: Diploma and PhD in Telematics (Graz University of Technology, 1991 and 1996), Habilitation in Hardware-Software Co-Design (ETH Zurich, 2002) Research Interests focus on reconfigurable computing, approximate computing, self-* computing, and embedded systems. His work addresses hardware security, FPGA design, and sustainable AI in data centers. Current projects include energy-efficient AI through deep neural network approximation for FPGAs (EKI-App) and lifecycle sustainability of socio-technical systems (SAIL). Publication Trends show expertise in FPGA security, approximate circuit synthesis, robotics, and hardware acceleration. Collaborations span robotics (ROS 2 integration), AI (transformer optimization), and cybersecurity (Trojan detection). Scientific Awards: ACM SIGDA Hall of Fame (2020) Significant Paper Award (FPL 2015) Best Paper Awards at IEEE ISVLSI (2024), ARC (2018), IEEE ReConFig (2015), and others Weierstraß Prize for Teaching (2008) Leadership Roles include membership in the board of Paderborn Center for Parallel Computing (PC2) and the Jenny Aloni Centre for Early Career Researchers. He has contributed to EU FP7 FET project EPiCS and German priority programs on embedded systems and organic computing.

• Secure Decentralized Systems
• Blockchain Technology
• Systems Security
• +۳ مورد دیگر

Prof. Bryan Ford leads the Decentralized/Distributed Systems (DEDIS) lab at EPFL. He focuses on secure decentralized systems, including blockchain technology, privacy, and systems security. He earned his Ph.D. from MIT and held faculty positions at Yale University and EPFL. His work spans distributed consensus protocols, peer-to-peer networking, and privacy-preserving systems. Key projects include QuePaxa (timeout-free consensus), UIA (global connectivity for mobile devices), and MedCo (secure healthcare data sharing). He advises numerous PhD students and contributes to open-source projects like Bitcoin collective signing and privacy networks like Riffle. Education: Ph.D., MIT; Postdoctoral work at Yale Research interests include blockchain scalability, consensus algorithms, and cryptographic privacy. His lab develops systems like TRIP for coercion-resistant voting and F3B to mitigate blockchain front-running. His work on NAT traversal and peer-to-peer protocols (e.g., STUN/ICE) remains foundational in network architecture. He emphasizes practical, auditable security solutions such as CertiKOS and atomic cross-chain transactions (Atom). Notable contributions: CoSi (collective signing), OmniLedger (sharded blockchain), and privacy-preserving protocols like PURBs (Protected Unsealable Recursive Boxes). His lab collaborates with Swiss Post to audit e-voting systems and designs democratic cryptocurrencies like PoPCoin.

Alexander Pretschnerمشاهده پروفایل

استاد

• Software Engineering
• Testing
• Information Security
• +۵ مورد دیگر

Prof. Alexander Pretschner is a Professor of Software & Systems Engineering at the Technical University of Munich (TUM) and Founding Director of the Bavarian Research Institute for Digital Transformation (bidt). He also serves as Scientific Director of fortiss, a Bavarian research institute for software-intensive systems. His research focuses on software engineering, testing, information security, and ethical software development. Pretschner holds a PhD from TUM and has held academic positions at Karlsruhe Institute of Technology (KIT) and TU Kaiserslautern. He is a co-editor of several prestigious journals, including IEEE Transactions on Reliability and the Journal of Software Testing, Verification and Reliability. Education: PhD in Computer Science, Technical University of Munich MSc in Computer Science, University of Kansas (on Fulbright Scholarship) Diplom in Computer Science, RWTH Aachen University Research Interests: His work spans testing methodologies, secure software design, and ethical considerations in agile development. Notable contributions include frameworks for metamorphic testing, distributed data usage control, and accountability mechanisms for cyber-physical systems. Awards: IBM Faculty Award (2012, 2013) Google Focused Research Award (2011, 2012) EARTO Innovation Prize (2014) 2nd Platz Supervisory Award (2020) Advising & Grants: Pretschner has supervised numerous PhD and Master’s students, contributing to over 200 publications. He leads projects like EDAP (Ethical Deliberation in Agile Processes) and collaborates with industry partners on cybersecurity and AI ethics initiatives. Labs & Teams: His work is anchored in bidt, fortiss, and TUM’s Chair of Software & Systems Engineering, focusing on societal impacts of digitalization and trustworthy AI systems.

• Software Engineering
• Computer Systems
• Software Security
• +۱۱ مورد دیگر

Cristian Cadar is a Professor in the Department of Computing at Imperial College London, leading the Software Reliability Group . His research focuses on improving software reliability and security through practical techniques in software engineering, computer systems, and program analysis. Education: Ph.D. in Computer Science, Stanford University M.Eng. in Computer Science, MIT B.S. in Computer Science and Mathematics, MIT His research interests center on software engineering and software security , particularly symbolic execution , dynamic symbolic execution (DSE) , and multi-version execution . Current work explores techniques for scalability, constraint solving, and runtime security in software systems. Key trends in his recent articles include optimizing symbolic execution for testing, addressing path explosion in constraint-based test generation, and advancing multi-version execution for dynamic software updates. His publications also cover program analysis , automated testing , and formal methods for software reliability. Awarded prestigious honors such as the Humboldt Research Award (2024) , ERC Consolidator Grant (2018) , and IEEE New Directions Award (2022) . Other accolades include the BCS Roger Needham Award (2019) and SIGOPS Hall of Fame (2018) . Cadar supervises PhD and postdoctoral researchers in software reliability and security. His group has secured grants from the ERC and EPSRC , including a Consolidator Grant (2018) and Early-Career Fellowship (2013) . He actively contributes to conference organizing committees and editorial boards. The Software Reliability Group at Imperial College, led by Cadar, specializes in techniques like KLEE and EXE for automated testing. Their work has been adopted by industry partners such as Fujitsu, IBM, and Microsoft, particularly in runtime security tools like WIT .

• Computer Architecture
• Non-Volatile Memory Systems
• Deep Learning Systems
• +۳ مورد دیگر

Jishen Zhao is an Assistant Professor in the Department of Computer Science and Engineering at the University of California, San Diego (Jacobs School of Engineering). His research focuses on computer architecture, non-volatile memory systems, and deep learning acceleration. Dr. Zhao has published extensively in top venues including ISCA, MICRO, ASPLOS, and IEEE Transactions. He collaborates with researchers at UCSD and beyond to advance systems for emerging applications in AI and autonomous vehicles. Dr. Zhao's primary research areas include persistent memory systems, hardware/software co-design for deep learning, and safety-critical computing. He develops techniques for crash consistency, memory disaggregation, and efficient neural network deployment. His work on autonomous vehicles addresses scenario generation and perception-aware system design. Recent projects explore LLM applications for software engineering and hardware verification. Analysis of Dr. Zhao's 2024-2025 publications reveals a strong shift toward AI-integrated systems research. He applies large language models to tasks like RTL verification and software issue localization while continuing to innovate in memory systems for serverless computing. There is growing emphasis on safety-critical systems for autonomous vehicles and energy-efficient neural network training using novel hardware architectures. Information about Dr. Zhao's scientific awards, advising activities, grants, and laboratory facilities was not available in the provided documentation.

Todd Millsteinمشاهده پروفایل

استاد

• Software Reliability
• Network Verification
• Programming Languages
• +۵ مورد دیگر

Todd Millstein is a Professor in the Computer Science Department at the University of California, Los Angeles (UCLA), and served as Department Chair from 2022–2025. He is also an Amazon Scholar and a co-founder and former Chief Scientist of Intentionet (now at AWS). His research focuses on making software systems more reliable, particularly through network verification and programming language techniques. He pioneered the Batfish network configuration analyzer, which is used by AWS, Oracle Cloud, and dozens of companies, and received the ACM SIGCOMM Networking Systems Award (2025) for this work. His recent publications span probabilistic programming, network reliability, and interactive program verification, including papers at PLDI 2024 (on bit blasting probabilistic programs), NSDI 2024 (on behavioral testing of BGP), and HotNets 2024 (on network layering). Todd has received prestigious awards such as an NSF CAREER Award , a Microsoft Research Outstanding Collaborator Award , and multiple best paper awards at PLDI, OOPSLA, and SIGCOMM. He has advised Ph.D. students like Ana Brendel and Poorva Garg , and teaches courses such as CS30 (Principles of Computing), CS231 (Types and Programming Languages), and CS239 (Current Topics in PL and Systems). His professional roles include Program Chair for OOPSLA 2014 and ECOOP 2018, and committee member for numerous conferences including PLDI , SPLASH , and LAFI .

Zachary Kincaidمشاهده پروفایل

دانشیار

• Program Analysis
• Formal Methods
• Programming Languages
• +۴ مورد دیگر

Zachary Kincaid is an Associate Professor in the Department of Computer Science at Princeton University's School of Engineering and Applied Science. His research focuses on program analysis, logic, and programming languages, with an emphasis on making program analysis compositional and robust. He received his PhD from the University of Toronto under the supervision of Azadeh Farzan. His work has been implemented in the Duet program analyzer, and he has an Erdős number of 3. Dr. Kincaid's research interests include: Compositional program analysis techniques Algebraic approaches to program analysis Termination analysis and ranking function synthesis Verification of concurrent and parallel programs Automated reasoning and decision procedures Analysis of numerical programs and loops His recent publications show a strong focus on developing novel techniques for program analysis that bridge theoretical computer science with practical verification tools, particularly in nonlinear analysis, quantified reasoning, and compositional verification. Dr. Kincaid has received research support from ONR grant N00014-19-1-2318 for his work on robust program analysis. He has advised graduate students including: Current: Jake Silverman, Nicolas Koh, Nikhil Pimpalkhare Graduated: Shaowei Zhu (PhD 2024, Researcher at Amazon), Charlie Murphy (PhD 2023, Postdoc at University of Wisconsin–Madison) Dr. Kincaid teaches courses including: COS 320 – Compiling Techniques (Spring 2024, 2022, 2020, 2019) COS 516 / ELE 516 – Automated Reasoning about Software (Fall 2025, 2022, 2018) COS 217 – Introduction to Programming Systems (Fall 2024) COS IW – Practical Solutions to Intractable Problems (Fall 2023, Spring 2023, 2018, 2017) COS IW – Little Languages (Spring 2018) COS 597D – Reasoning about concurrent systems (Fall 2016)

• Quantum Computing
• Quantum Foundations
• ZX-calculus
• +۷ مورد دیگر

John van de Wetering is an Assistant Professor at the Theoretical Computer Science group of the Informatics Institute, University of Amsterdam, working with the QuSoft research center. He co-authored the open-access book Picturing Quantum Software and developed the PyZX quantum compiler. His research spans quantum computation and quantum foundations, focusing on diagrammatic methods like the ZX-calculus and ZH-calculus. Quantum circuit optimization and verification Quantum foundations via algebraic/compositional methods Co-creator of PyZX His recent publications explore multi-qutrit systems, completeness of graphical calculi, and quantum state representations. Supervises students in quantum computing, including Lia Yeh and Sarah Li. Directs the new Master's program in Quantum Computer Science at UvA. Actively contributes to open-source projects and international conferences. Notable collaborations include Aleks Kissinger, Neil J. Ross, and QuSoft researchers. Uses GitHub for DiZX development (qudit extension of PyZX). No explicit scientific awards mentioned.

Michael D. Ernstمشاهده پروفایل

استاد

• software engineering
• programming languages
• type theory
• +۶ مورد دیگر

Michael D. Ernst is a Professor in the Computer Science & Engineering department at the University of Washington's College of Engineering. His research aims to make software more reliable, more secure, and easier (and more fun!) to produce. Previously, he was a tenured professor at MIT and a researcher at Microsoft Research. Ernst's primary technical interests are in software engineering, programming languages, type theory, security, program analysis, bug prediction, testing, and verification. His research combines strong theoretical foundations with realistic experimentation, with an eye to changing the way that software developers work. He focuses particularly on programmer productivity and developing practical tools that can be integrated into developers' workflows. Analysis of his recent publications (2018-2025) reveals a continued focus on verification techniques, program analysis, and testing methodologies. His work spans from theoretical foundations of type systems to practical applications of NLP for test generation and LLMs for test oracle creation. A consistent theme is developing lightweight, modular approaches that can be practically applied in real-world development environments. Scientific Awards: ACM Fellow (2014) John Backus Award (2009) NSF CAREER Award (2002) ACM SIGSOFT Impact Paper Award (2013) 8 ACM Distinguished Paper Awards across multiple conferences ECOOP 2011 Best Paper Award Microsoft Academic Search ranked #2 in software engineering research (2013) Ernst has received significant research funding including the NSF CAREER Award, supporting his work on program analysis and verification techniques. His research combines theoretical rigor with practical impact, often resulting in tools that are adopted by the software engineering community. He actively collaborates with researchers across institutions and has served in leadership roles for major conferences in programming languages and software engineering. His research group develops practical tools that address real challenges in software development, with a focus on making verification and analysis techniques more accessible to working developers. Current projects include applying machine learning techniques to software engineering problems while maintaining strong theoretical foundations.

Matthieu Sozeauمشاهده پروفایل

پژوهشگر

• Type Theory
• Proof Assistants
• Functional Programming
• +۴ مورد دیگر

Matthieu Sozeau is a prominent researcher at Inria in the Gallinette team in Nantes, France, and a key contributor and coordinator of the Coq/Rocq proof assistant project. His work bridges theoretical computer science and practical software development, focusing on creating reliable formal verification tools. His research interests span Type Theory, Proof Assistants, Functional Programming, and Unification. He has made significant contributions to the development of Coq (recently renamed to Rocq Prover), particularly through the MetaCoq project which aims to verify Coq's kernel within Coq itself, the Equations plugin for dependent pattern matching, and CertiCoq, a verified compiler from Coq to assembly. His work enables stronger guarantees about formalized mathematics and verified software. Sozeau's publications reveal a consistent focus on foundational aspects of proof assistants. His recent work includes verified type checking ('Coq Coq Correct!'), verified extraction from Coq to OCaml, and sort polymorphism for proof assistants. These contributions advance both theoretical understanding and practical implementation of dependently-typed programming languages. Distinguished paper award for Verified Compilation from Coq to OCaml at PLDI'24 As an academic mentor, Sozeau has supervised PhD students including Théo Winterhalter and Antoine Allioux. He regularly teaches courses on proof assistants, notably at MPRI (Master Parisien de Recherche en Informatique), and actively participates in the academic community through program committees, invited talks, and workshops. His work has significantly influenced both the theoretical foundations and practical applications of interactive theorem proving.