Relaxed Memory Concurrency Professors and Supervisors | ApplySharif

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

استاد راهنما، استاد دانشگاه یا پژوهشگر مناسب برای مسیر پژوهشی‌تان را پیدا کنید و با او ارتباط بگیرید.

نمایش ۱-۱۵ از ۶۰ استاد راهنما

اطلاعات این پروفایل‌ها از صفحات عمومی دانشگاه‌ها جمع‌آوری شده و ممکن است به‌روز نباشد.

Conrad Wattمشاهده پروفایل

استادیار

InriaFrance

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

پروفایل رسمی دانشگاه

Neelakantan R. Krishnaswamiمشاهده پروفایل

استاد

University of CambridgeUnited Kingdom

Neelakantan R. Krishnaswami is a Professor of Computer Science at the University of Cambridge's Computer Laboratory , and a Fellow of Trinity College . His research focuses on the intersection of program verification, programming language design, and foundational topics like type theory and semantics. His work spans areas such as refinement types, parser design, separation logic for systems software, and the semantics of reactive programming. Notable contributions include the Datafun language for higher-order Datalog and the λert type theory for explicit refinement types. He has also developed foundational frameworks for verifying imperative programs using advanced type systems and logical relations. Key publications include 'Explicit Refinement Types' (ICFP 2023), 'flap: A Deterministic Parser with Fused Lexing' (PLDI 2023), and 'CN: Verifying Systems C Code' (POPL 2023). His work frequently addresses challenges in efficiency, correctness, and modularity for both functional and imperative systems. His awards include Distinguished Paper Awards at PLDI 2019 and POPL 2020. His research integrates theoretical rigor with practical tooling, exemplified by contributions to languages like Coq, Lean, and Haskell.

پروفایل رسمی دانشگاه

Mark Battyمشاهده پروفایل

استاد

University of KentUnited Kingdom

Mark Batty is a Professor in the School of Computing at the University of Kent, specializing in formal methods for concurrent systems. His work bridges hardware-software interfaces, focusing on memory models for C/C++, OpenCL, and architectures including x86, ARM, POWER, and GPUs. As a member of the Programming Languages and Systems Research Group, he develops mathematical specifications and verification tools for real-world concurrency challenges. His research centers on empirical testing of hardware/compiler behavior, formal modeling of system components, and verification of fine-grained concurrent algorithms. Key contributions address relaxed memory semantics, transactional memory, and compositional reasoning for concurrent data structures. His work combines theoretical rigor with practical tool development to ensure correctness in complex concurrent environments. Analysis of his 2015-2025 publications reveals consistent focus on memory consistency models, formal verification of weak memory concurrency, and compiler optimizations. Dominant themes include C/C++11 standards, GPU concurrency semantics, and mechanized verification techniques. His research demonstrates strong industry relevance through collaborations with hardware vendors and contributions to language standards. Mark Batty has received significant recognition: John C. Reynolds Doctoral Dissertation Award (2015) from ACM SIGPLAN CPHC and BCS Distinguished Dissertation Award (2015) Lloyds Register Foundation and Royal Academy of Engineering Research Fellowship (2016) He actively leads major research initiatives and mentors next-generation researchers: Current Funding: EPSRC Standard Grant 'Verifiably Correct transactional memory' (2018), VeTTS Grant 'Specification and verification of C++ data structure libraries' (2018), EPSRC First Grant 'Compositional, dependency-aware C++ concurrency' (2018) PhD Recruitment: Actively seeking candidates for UKRI-funded studentship in Verified Trustworthy Software Systems Batty drives community engagement through Kent Concurrency Workshop (2016) and South of England Programming Language Seminars, fostering national collaboration in programming languages research. His leadership in organizing Royal Society discussions underscores his influence in trustworthy systems verification.

پروفایل رسمی دانشگاه

Ori Lahavمشاهده پروفایل

دانشیار

Max Planck Institute for Software SystemsGermany

Ori Lahav is a faculty member in the School of Computer Science at Tel Aviv University. His research is generously supported by an ERC Starting Grant and an ISF Grant. He actively supervises PhD and MSc students, and seeks highly motivated candidates for postdoc, PhD, and MSc positions in programming language theory, concurrency, and formal methods. Dr. Lahav completed his PhD at Tel Aviv University under the supervision of Arnon Avron. In 2014, he was a postdoctoral researcher at Tel Aviv University hosted by Mooly Sagiv. From 2014 to September 2017, he was a postdoctoral researcher at MPI-SWS in Germany hosted by Viktor Vafeiadis and Derek Dreyer. His primary research areas focus on programming languages and verification, with specialization in concurrency and relaxed memory models. He also has significant interests in proof-theory, semantics of non-classical logics, and automated reasoning. His work bridges theoretical foundations with practical applications in programming language design and implementation. Dr. Lahav's publication record shows a consistent trajectory of high-impact research in top-tier conferences including PLDI, POPL, OOPSLA, and ESOP. His recent work (2023-2025) demonstrates continued leadership in memory models, concurrency semantics, and verification techniques. His research spans both theoretical contributions in denotational semantics and practical tools for verification. Best Paper Award DISC 2024 Best Student Paper Award DISC 2024 Distinguished Artifact Award ESOP 2022 Distinguished Paper Award OOPSLA 2021 Kleene Award for Best Student Paper LICS 2013 Dr. Lahav actively advises students including Yoav Ben Shimon, Yotam Dvir, Amir Karniel, and Roy Margalit (PhD students), Yuval Katsman Ezra (MSc student), and has alumni including Ori Saporta (MSc) and Abhishek Kr Singh (postdoc, now Assistant Professor at IIIT Hyderabad). He has organized significant events including VMCAI 2024 and Dagstuhl Seminars on persistent programming. His teaching portfolio includes courses on Shared Memory Concurrency Semantics, Programming Language Foundations, and Software Foundations in Coq.

پروفایل رسمی دانشگاه

Joe Deviettiمشاهده پروفایل

دانشیار

University of PennsylvaniaUnited States

Joseph Devietti is an Associate Professor in the Department of Computer & Information Science at the University of Pennsylvania. His research focuses on improving programmability and performance of multiprocessor systems through architectural and programming model innovations. He actively advises PhD students and has supervised numerous graduates now employed at leading tech companies and academic institutions. Education: PhD (2012), MS (2009) in Computer Science and Engineering from University of Washington; BSE (2006) in Computer Science and BA (2006) in English from University of Pennsylvania. Employment: Associate Professor (2020–present), Assistant Professor (2013–2020) at University of Pennsylvania; Principal Scientist & Co-founder at Cloudseal, Inc. (2018–2020). Devietti’s research spans computer architecture, parallel programming, and deterministic execution. Key areas include cache/memory optimization (prefetching, false sharing repair), GPU programming models (race detection, block-size independence), and hardware-software co-design for concurrency safety. His recent work addresses dynamic runtime prefetch tuning (RPG 2 ), online code layout optimization (OCOLOS), and intelligent BTB prefetching (Twig) for data center applications. His publications from 2024–2017 reveal trends in instruction/cache optimization (2024–2020), GPU determinism (2018–2017), and race detection (2018–2016). Awards include the 2024 Penn Engineering Ford Motor Company Award, Radhia Cousot Best Paper (2018), and IEEE Micro Top Picks recognition (2023, 2009, 2008). Scientific Awards : 2024 Penn Engineering Ford Motor Company Award Radhia Cousot Young Researcher Best Paper Award (SAS 2018) IEEE Micro Top Picks (2023, 2009, 2008) Intel Early Career Faculty Honor Program (2013) Intel Ph.D. Fellowship (2011) Advising : Supervised 15+ PhD/Master’s students with placements at Google, Microsoft, Amazon, NYU, and the United States Naval Academy. Collaborations : Works with industry leaders (NVIDIA, Facebook) and academic institutions (University of Washington, Penn).

پروفایل رسمی دانشگاه

Okeoghene Oduduمشاهده پروفایل

مدرس ارشد

University of CambridgeUnited Kingdom

Professor Okeoghene Odudu is the Herchel Smith University Senior Lecturer in Law at the University of Cambridge, Faculty of Law, and a Fellow of Emmanuel College. He is Co-Director of the Centre for European Legal Studies (CELS) and affiliated with the Centre for Law, Medicine and Life Sciences (LML). His academic work focuses on competition law, EU law, and the legal regulation of healthcare systems. MA (Cantab), Law, Sidney Sussex College, Cambridge MA (Keele), Criminology, funded by ESRC DPhil (Oxon), Aspects of Article 101 TFEU, supervised by Professor Paul Craig His research interests lie at the intersection of competition law and public services, particularly in the healthcare sector. He has extensively published on the application of EU competition law to NHS institutions, hub-and-spoke collusion, state aid, and the public/private distinction in EU law. His work combines doctrinal legal analysis with policy-oriented inquiry, often addressing contemporary regulatory challenges such as NHS privatization and crisis-driven competition law relaxation during the pandemic. His recent publications show a strong trend toward analyzing competition law in public service contexts, especially healthcare, and exploring doctrinal nuances in EU antitrust enforcement. He frequently contributes to high-impact legal journals and edited volumes on EU law and competition policy. Kennedy Memorial Trust Scholarship British Academy Mid-Career Fellowship (2011–2012) AHRB Doctoral Funding ESRC MA Funding Professor Odudu has served on the editorial boards of the European Competition Journal , Cambridge Yearbook of European Legal Studies , and Concurrences . He has supervised doctoral research and contributed to major research projects, including a British Academy-funded study on competition law in the NHS. His work is supported by prestigious fellowships and institutional affiliations. He is actively involved in the Centre for European Legal Studies and the Centre for Law, Medicine and Life Sciences, where he collaborates on interdisciplinary research on law, health, and regulation.

پروفایل رسمی دانشگاه

Peter Sewellمشاهده پروفایل

استاد

Max Planck Institute for Software SystemsGermany

Peter Sewell is Professor of Computer Science at the University of Cambridge Computer Laboratory, where he builds rigorous foundations for real-world computer systems to enhance robustness, security, and formal verification of hardware-software interactions. His educational background includes undergraduate studies at the University of Cambridge and University of Oxford, followed by a PhD from the University of Edinburgh in 1995 under Robin Milner's supervision. Professor Sewell's research focuses on concurrency models (x86, ARM, Power, C/C++11), verified compilation, formal semantics for C/linking/filesystems/TLS, and applied semantics tools. He pioneers executable ISA specifications through projects like Sail and Cerberus, addressing relaxed-memory concurrency and capability-based security architectures. His 2020-2026 publications reveal a clear trajectory toward formal verification of hardware security properties, with increasing emphasis on capability systems (Arm Morello, CHERI) and real-world applicability of concurrency models across ARM, RISC-V, and MIPS architectures. Scientific recognition: Royal Society University Research Fellowship (1999-2007) He leads major research initiatives in systems security formalization, supported by Cambridge positions and collaborative projects with industry partners. His work bridges theoretical formal methods and practical systems engineering through executable semantics frameworks. As a core member of Cambridge's Systems Research Group, he directs projects including Sail (ISA semantics), Cerberus (C semantics), and verification frameworks for capability architectures, fostering interdisciplinary collaboration across hardware and software security domains.

پروفایل رسمی دانشگاه

Philippas Tsigasمشاهده پروفایل

استاد

Chalmers University of TechnologySweden

Philippas Tsigas is a Professor at the Department of Computer Science and Engineering at Chalmers University of Technology. He leads the Distributed Computing and Systems Research Group and has held roles as co-leader of research initiatives such as the PEPPHER project. His research spans distributed/parallel computing, information visualization, and fault-tolerant communication mechanisms. He has supervised numerous PhD students, including Yi Zhang, Håkan Sundell, and Farnaz Moradi. Research interests include lock-free data structures, multicore algorithms, secure network services, and visualization tools like Lydian and DataMeadow. Notable awards include Best Paper Awards at IPDPS 2003 and SNS 2012. His work has been published in top venues like IEEE Transactions on Parallel and Distributed Systems and ACM Journal of Experimental Algorithmics. Awards highlight contributions to lock-free algorithms and network modeling. Students have contributed to projects like NBmalloc (memory reclamation) and GPU Quicksort. Collaborations with institutions like SSF and VR have supported his research. Tsigas is also involved in teaching distributed systems and mentoring early-career researchers.

پروفایل رسمی دانشگاه

Shaked Flurمشاهده پروفایل

پژوهشگر

University of CambridgeUnited Kingdom

Shaked Flur is a Researcher at the Department of Computer Science and Technology, University of Cambridge. His work focuses on formal methods, instruction-set semantics, and concurrency models in computer architectures. He contributes to the development of formal verification tools and specifications for ISA standards like ARMv8-A, RISC-V, and CHERI-MIPS. His research bridges academic formal models with practical software and hardware design, emphasizing the adoption of rigorous methods in real-world systems. Flur collaborates on projects such as the Sail specification language, enhancing clarity and precision in ISA documentation. His publications address challenges in memory models, concurrency semantics, and automated verification techniques.

پروفایل رسمی دانشگاه

Mahmut Taylan Kandemirمشاهده پروفایل

استاد

Pennsylvania State UniversityUnited States

Summary Role & Affiliation: Mahmut Taylan Kandemir is a Professor in the Department of Computer Science and Engineering at Pennsylvania State University. He is a member of the Microsystems Design Lab and has held roles such as Graduate Program Coordinator. His research focuses on optimizing compilers, runtime systems, embedded systems, and storage technologies. Education: B.S. and M.S. from Istanbul Technical University (Computer Engineering), Ph.D. from Syracuse University (Computer Science). Research Interests: Kandemir’s work spans compiler optimization, energy-efficient architectures, non-volatile memory systems, and cloud storage. His research has been funded by NSF, DARPA, and industry partners like Intel and Microsoft. Articles & Contributions: Over 150 journal papers and 650+ conference publications, covering topics like compiler-driven storage efficiency, 3D NAND SSD optimization, and approximate computing frameworks. Awards: NSF Career Award, Penn State Premier Research Award, IEEE Fellow, and multiple best paper awards. His contributions include compiler tools and storage systems for high-performance computing. Advising & Grants: Advised 32 Ph.D. and 20 M.S. students. Active in program committees for conferences like MICRO, ISCA, and HPCA. Current grants focus on cloud resource management and emerging memory technologies. Labs & Collaborations: Leads projects in collaboration with Argonne National Lab, NVIDIA, and Intel. His work bridges academia and industry, addressing challenges in multicore and embedded systems.

پروفایل رسمی دانشگاه

Duccio Testaمشاهده پروفایل

پژوهشگر

Swiss Federal Institute of Technology in LausanneSwitzerland

Duccio Testa is a Researcher at the Swiss Plasma Center (SPC) within the School of Basic Sciences at École Polytechnique Fédérale de Lausanne (EPFL). He holds concurrent Lecturer positions in the School of Engineering (SB-SPH) and the School of Humanities and Social Sciences (CDH-SHS). His career spans plasma physics for nuclear fusion, mathematical modeling of complex systems, and archaeology of the Roman and pre-Roman eras. Education : High School Diploma from Liceo Classico Vincenzo Gioberti (1988); Bachelor/Master in Physics from Universita di Torino (1994); Ph.D. in Plasma Physics from Imperial College London (1998); Post-Doc at MIT (2002-2007). His research focuses on plasma diagnostics and magnetic sensor development for tokamaks like JET, TCV, and ITER. He pioneered LTCC sensors and real-time MHD instability detection algorithms (e.g., SparSpec). His work bridges fusion engineering and archaeology , with publications on Etruscan civilization and Pharaonic trade routes. Recent articles highlight advancements in photolithography-based magnetic sensors for DTT and DEMO, high-frequency diagnostics across tokamaks, and fast ion transport modeling . He has received European Community Research Training Grant , Ph.D. Fellowship , and Post-Doc Fellowship . Scientific Awards European Community Research Training Grant (1995) Ph.D. Fellowship (Imperial College London, 1995-1998) Post-Doc Fellowship (MIT, 1998-2007) Testa has mentored numerous Ph.D. students (e.g., Theodoros Panis, Christian Schlatter) and post-doctoral researchers , while contributing to MOOC courses and tutorials on plasma physics. His leadership in international collaborations (EPFL, MIT, UKAEA) underscores his role in fusion technology and diagnostic systems .

پروفایل رسمی دانشگاه

Robbert Krebbersمشاهده پروفایل

دانشیار

Max Planck Institute for Software SystemsGermany

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.

پروفایل رسمی دانشگاه

Nima Honarmandمشاهده پروفایل

استادیار

Stony Brook UniversityUnited States

Nima Honarmand is an Assistant Professor in the Department of Computer Science at Stony Brook University, where he co-directs the Computer Architecture Stony Brook (COMPAS) Lab . His research focuses on computer system design , particularly parallel computer architecture and operating systems . Education : Ph.D. in Computer Science from University of Illinois at Urbana-Champaign under Josep Torrellas. His work addresses challenges in deterministic replay of parallel programs to simplify debugging on multi-processor systems. Current research explores memory fencing, consistency models, and architectural extensions for reproducibility. Recent publications span conferences like ASPLOS, ISCA, PACT, and POPL, with emphasis on parallelism constraints , memory hierarchy optimization , and fault-tolerant systems . Awards include Best Paper at PACT 2011 and Best Paper Candidate at VTS 2007 . Teaching : Courses include Computer Architecture (CSE 502) and Operating Systems (CSE 306/CSE 506). Email : nhonarmand@cs.stonybrook.edu

پروفایل رسمی دانشگاه

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

پژوهشگر

IMDEA Software InstituteSpain

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

پروفایل رسمی دانشگاه

Michalis Kokologiannakisمشاهده پروفایل

استادیار

National and Kapodistrian University of AthensGreece

Michalis Kokologiannakis is an Assistant Professor in the Department of Computer Science at ETH Zurich, Switzerland. Previously, he was affiliated with the Max Planck Institute for Software Systems (MPI-SWS) in Germany where he completed his PhD. His research focuses on programming languages, compilers, and software verification, with particular emphasis on: Automated verification and testing of concurrent programs Weak memory models employed by modern microprocessors Stateless model checking techniques Formal methods for program analysis His work has led to the development of several verification tools including GenMC (a stateless model checker for C/C++ programs under weak memory models) and Kater (a tool that automates weak memory model metatheory and consistency checking). Dr. Kokologiannakis has published extensively at top-tier programming languages and verification conferences including PLDI, POPL, OOPSLA, and CAV. His research has pioneered advances in stateless model checking, partial order reduction, and verification under weak memory consistency models. He completed his MEng at the National Technical University of Athens (NTUA) before earning his PhD from MPI-SWS.

پروفایل رسمی دانشگاه