Concurrent Data Structures Professors and Supervisors in France | ApplySharif

فیلترهای فعال:

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

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

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

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

Andrzej Murawskiمشاهده پروفایل

استاد

InriaFrance

Andrzej Murawski is a Professor of Computer Science at the University of Oxford and a Tutorial Fellow at Worcester College . His research focuses on the semantics of programming languages and software verification, with applications in automata theory, probabilistic computation, and concurrency. Current affiliations: University of Oxford, SIGLOG Vice-Chair, FoSSaCS Steering Committee Research interests: Game semantics, higher-order recursion, probabilistic systems, differential privacy Recent publications address probabilistic verification, equivalence checking, and game semantics for concurrent systems. He has chaired program committees for conferences such as ESOP and PERR, and his work has earned recognition like the POPL 2025 Distinguished Paper Award . Current students : Benedict Bunting, Haoxuan Yin Past students : Conrad Cotton-Barratt, David Hopkins, Guanyan Li, Dominik Wagner, Fabian Zaiser

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

Tej Chajedمشاهده پروفایل

استادیار

InriaFrance

Tej Chajed is an Assistant Professor in the Department of Computer Sciences at the University of Wisconsin-Madison, focusing on formal verification of systems software. His research bridges theoretical foundations and practical implementations to ensure software correctness in concurrent and crash-safe systems. Research interests include formal verification, concurrency, crash safety, and programming languages, particularly using Coq, Perennial, and Goose frameworks. He has contributed to systems like DaisyNFS, a verified file system with sequential reasoning, and Verus, a foundation for systems verification. His work appears in top venues like SOSP, OSDI, and PLDI. 2025: Dafny PC Member 2024: PLDI Committee Member, CoqPL Co-chair 2023: CoqPL Co-chair, POPL Program Committee He actively mentors students and develops tools for systems verification education, including extensive Coq-based course materials.

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

Umang Mathurمشاهده پروفایل

استادیار

InriaFrance

Umang Mathur is an Assistant Professor at the National University of Singapore's School of Computing, where he leads the FOCS Lab and is affiliated with PLSE@NUS. His research focuses on Formal Methods , Concurrency , and Decidability in Programming Languages and Software Engineering . PhD in Computer Science from the University of Illinois at Urbana-Champaign (advisor: Prof. Mahesh Viswanathan) Former Research Scientist at Facebook Inc. and Research Fellow at the Simons Institute Recipient of Google PhD Fellowship, 2024 CPP Distinguished Paper Award, 2023 ACM SIGPLAN Award, and ASPLOS 2022 Best Paper Award His recent work explores algorithmic techniques for detecting concurrency bugs , decidable program verification , and synthesis , with a focus on weak memory models, predictive monitoring, and automata-theoretic approaches. Articles span topics like causal concurrency, tree clock data structures, and probabilistic counting algorithms, reflecting interdisciplinary intersections of logic and systems research. Scientific Awards Google PhD Fellowship 2024 CPP Distinguished Paper 2023 ACM SIGPLAN Distinguished Paper 2022 ASPLOS Best Paper 2018 ESEC/FSE Distinguished Paper He advises PhD students in Formal Methods and supervises teams in the FOCS Lab. Teaching includes advanced modules on Automata Theory, Logic, and Verification at NUS.

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

Petr Kuznetsovمشاهده پروفایل

استاد

Télécom ParisFrance

Petr Kuznetsov is a Professor at Telecom Paris (Institut Polytechnique de Paris), affiliated with the Department of Computer Science and Networks (INFRES). He leads the Autonomous Critical Embedded Systems (ACES) research team at the Information Processing and Communication Laboratory (LTCI). His work bridges theoretical foundations and practical applications in distributed systems. Research Focus: Kuznetsov specializes in distributed algorithms, synchronization protocols, failure detection mechanisms, and the application of algebraic topology to distributed computing. His recent work explores Byzantine fault tolerance, blockchain consensus, and concurrency in networking infrastructures. Recent Publication Trends (2015-2025): His articles predominantly focus on scalability and resilience in distributed systems, with emerging themes in blockchain technologies, Byzantine fault tolerance, and concurrency optimization. Theoretical contributions include computability theorems and complexity bounds, while applied work targets payment systems and distributed ledgers. Awards & Honors: Best Paper Award at DISC 2019 for Scalable Byzantine Reliable Broadcast Best Student Paper Award at PODC 2018 for An Asynchronous Computability Theorem for Fair Adversaries Projects & Advising: He directs the TrustShare Innovation Chair (large-scale data synchronization) and DISCMAT (mathematical foundations of distributed computing). Actively seeks PhD candidates for projects on distributed algorithms and concurrency. Laboratory & Teams: Heads the ACES team at LTCI, focusing on critical embedded systems and fault-tolerant distributed architectures. Collaborates internationally through workshops like SPTDC.

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

Brigitte Pientkaمشاهده پروفایل

استاد

InriaFrance

Brigitte Pientka is a Full Professor in the School of Computer Science at McGill University, where she leads the Computation and Logic group. She received her PhD from Carnegie Mellon University in 2003, and previously studied at the University of Edinburgh and Technical University of Darmstadt. Her educational background includes: PhD from Carnegie Mellon University (2003) Studies at the University of Edinburgh Studies at Technical University of Darmstadt Dr. Pientka's research focuses on developing theoretical and practical foundations for building and reasoning about reliable, safe software systems. She combines theoretical research on logical foundations of computer science in programming languages and verification with system building. Her work spans logics (classical and non-classical), type theory, theorem proving, logic and functional programming, and logical frameworks. She has made significant contributions to the field of contextual types and mechanized metatheory. Her recent publications demonstrate a strong trend toward modal type theory, contextual types, and session types, with applications to functional programming, verification, and meta-programming. She has made significant contributions to the Beluga system, which explores how to combine functional programming with dependently-typed, higher-order data specified in the logical framework LF. Her work often bridges theoretical foundations with practical implementations for mechanized reasoning. Dr. Pientka has received several notable awards: Humboldt Fellowship Test of Time Award @ PPDP'18 for 'Programming with proofs and explicit contexts' Best student paper award at ICLP'03 She is actively involved in mentoring and academic service, having served as PC Chair for ICFP'24, CPP'23 and CPP'24, and as General Chair for POPL'20. She is an Executive Editor of Logical Methods in Computer Science and serves on the editorial boards of the Journal of Functional Programming and ACM Transactions of Computational Logic. She leads the Computation and Logic group at McGill University, which focuses on developing theoretical and practical foundations for reliable software systems through research in logical frameworks, type theory, and programming language design.

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

Kartik Nagarمشاهده پروفایل

استادیار

InriaFrance

Kartik Nagar is an Assistant Professor at the Department of Computer Science and Engineering, IIT Madras . He specializes in developing verification and analysis techniques to enhance the reliability, security, and efficiency of computer systems, focusing on concurrent and distributed systems, computer architecture, and real-time systems.

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

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

دانشیار

InriaFrance

Amin Timany is an Associate Professor in the Department of Computer Science at Aarhus University, Denmark, where he conducts research in programming languages, type theory, and formal verification. He is a member of the Logic and Semantics Group and actively contributes to the development of logical relations, separation logic, and proof assistants such as Coq and Iris. He holds a PhD in Computer Science from KU Leuven (2018) and was previously a postdoctoral fellow with FWO at KU Leuven. His research focuses on mechanized semantics, program equivalence, concurrency, and distributed systems verification. He is particularly known for solving the long-standing problem of proving encapsulation in the ST monad using logical relations. His recent publications span top-tier venues including POPL, ICFP, PLDI, and CPP, with key contributions in guarded interaction trees, higher-order separation logic (e.g., Trillium), and modular verification of CRDTs and virtual machines. His work emphasizes formalization and mechanization in Coq, often within the Iris framework. He has served on numerous program committees and has chaired conferences such as CPP and sessions at CoqPL. Notably, his paper 'Modular Denotational Semantics for Effects with Guarded Interaction Trees' received a Distinguished Paper Award at POPL 2024. PhD, KU Leuven, 2018 MSc, TU Dresden, 2013 He teaches courses such as Compilation, Program Logics, and Advanced Topics in Programming Language Theory. He collaborates extensively with researchers like Lars Birkedal, Robbert Krebbers, and Derek Dreyer, and mentors students in formal methods and PL theory.

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

François Pottierمشاهده پروفایل

پژوهشگر

InriaFrance

François Pottier is a senior researcher at Inria in Paris, France, where he leads the Cambium research team. He is affiliated with the Gallium research group and has maintained an active research profile spanning several decades in programming languages and formal methods. His research focuses on programming languages , particularly functional programming and OCaml, type systems design and implementation, program verification using separation logic, and compiler construction . His work bridges theoretical foundations with practical implementation, evidenced by numerous open-source software tools he has developed. Pottier's publication record shows consistent contributions to top programming languages conferences (POPL, ICFP, ESOP) with recent work emphasizing separation logic frameworks, resource analysis, and formal verification of OCaml systems. His research demonstrates a clear trajectory from foundational type theory toward practical verification techniques for real-world programming languages. He has advised numerous PhD students including Remy Seassau, Tiago Soares, Clément Allain, and Alexandre Moine, among others, many of whom have gone on to research positions at institutions like New York University, Imperial College London, and Inria itself. Pottier maintains active service roles in the programming languages community as a member of IFIP Working Group 2.8 on Functional Programming and IFIP Working Group 2.16 on Language Design, and serves on program committees for major conferences including upcoming roles for JFLA 2026 and ITP 2026. He leads the Cambium research team at Inria, which focuses on programming language theory and implementation, particularly around OCaml and formal verification. The team develops both theoretical frameworks and practical tools that have influenced the broader programming languages ecosystem.

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

J. Garrett Morrisمشاهده پروفایل

پژوهشگر

InriaFrance

J. Garrett Morris is a researcher and teacher at the University of Iowa's Department of Computer Science, with previous affiliation to the University of Kansas. His work focuses on programming languages, type systems, and formal verification. Active contributor to conferences like POPL, ICFP, and Haskell Recognized for research in session types, linear logic, and functional programming His publications span topics including Exceptional Asynchronous Session Types , Partial Type Constructors , and Constrained Type Families . While no specific awards or students are mentioned in the scraped data, his academic activities include committee roles and keynote sessions.

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

David Janinمشاهده پروفایل

دانشیار

InriaFrance

David Janin is an Associate Professor in Computer Science at Bordeaux INP , specifically within the ENSEIRB-MATMECA school. He leads the PoSET research project, exploring algebraic models for heterogeneous interactive temporal media systems. Research Affiliations : CNRS INS2I , INRIA Bordeaux Sud-Ouest , Idex Bordeaux , LaBRI (CNRS UMR 5800). Research Focus : His work bridges inverse semigroup theory and functional programming to develop algebraic frameworks for synchronizing diverse temporal media (sound, animation, video). This includes T-calculus in Haskell and Octopus for 3D animation. Technical Contributions : Key developments include models for overlapping tiles , birooted tree languages , and causal function semantics in real-time systems. Contact : janin@labri.fr

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

Binoy Ravindranمشاهده پروفایل

استاد

InriaFrance

Binoy Ravindran is a Professor at Virginia Tech’s College of Engineering, Department of Electrical and Computer Engineering, leading the Systems Software Research Group (SSRG). His research focuses on computer systems, emphasizing security, performance, concurrency, distributed systems, and real-time computing, with recent work in software verification and heterogeneous-ISA platforms. Key projects: Low-level Reasoning Machine (LLRM), Popcorn Linux, LibrettOS, Hyflow, HermiTux, SlimGuard, HydraVM, KairosVM. He has co-authored 15+ papers from 2025 to 2022, spanning venues like ASPLOS, POPL, PLDI, VEE, PPoPP, and MIDDLEWARE, with awards including ACM Distinguished Scientist and eight Best Paper Awards. Service roles: Editorial Boards (IEEE Transactions on Cloud Computing, ACM TECS), Program Co-Chair (ACM Systor 2025), Committee memberships across ASPLOS, PLDI, and more.

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

Ningning Xieمشاهده پروفایل

پژوهشگر

InriaFrance

Ningning Xie is a researcher affiliated with the University of Toronto, specializing in functional programming, type systems, and logics. Their work spans applications in compilers, code generation, and machine learning, with a focus on compositional programming and effect handling. Research interests include: Functional programming Type systems Logics Compiler design Multi-stage programming Effect handlers Recent publications demonstrate expertise in type-level programming, staged compilation, and effect systems. Key areas include distributive disjoint polymorphism, parallel algebraic effect handlers, and macro systems for OCaml and Haskell. Their work bridges theoretical formalisms with practical language implementations. Contributions to academic service include organizing and reviewing for conferences like POPL, PLDI, ICFP, and Haskell workshops. Notable roles include Publicity Chair for POPL 2026 and Co-chair for PLMW and Artifact Evaluation committees.

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

Laure Gonnordمشاهده پروفایل

استاد

Grenoble INPFrance

Laure Gonnord is a Full Professor in Computer Science at Grenoble INP , affiliated with the Esisar Engineer School in Valence, France, since September 2021. She is a member of the CTSYS research team at the LCIS laboratory and an external member of the CASH team at the University of Lyon / CNRS / LIP / Inria. Her research focuses on compilation , static analysis , and applications to safety , security in high-performance and embedded systems . Fields of Interest : Compiler Design Static Analysis for Safety & Security Abstract Interpretation Embedded Systems High-Performance Programming Hardware Security Engineering Research Trends (from recent publications): Her work explores modular verification through monadic abstract interpreters, complexity bounds in term rewriting , and educational tools for theorem proving . Notable contributions include compiler hardening schemes for hardware security and memory layout optimizations for algebraic data types. Academic Leadership : Scientific Director of the Summer School EJCP (École Jeune Compilation et Programmation) Board Member of the French national research group GDR GPL Teaching Responsibilities at Grenoble INP include courses in architecture , compilation , programming languages , algorithms , and databases . She has also taught at University of Lyon, ENS Lyon, Polytech'Lille, and INSA.

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

Dario Colazzoمشاهده پروفایل

استاد

Polytechnic SchoolFrance

Dario Colazzo is a Professor at Université Paris-Dauphine, affiliated with the LAMSADE laboratory. His research focuses on database systems and programming languages, particularly in cloud databases, type systems for semi-structured data, and query processing optimizations. He has contributed extensively to XML and XQuery research, including parallel query execution and static analysis techniques. His teaching includes courses on programming (Java), UML, database systems, and semantic web technologies at both undergraduate and graduate levels (in French). Key research interests span XML/XQuery optimization, JSON processing, distributed systems, and type systems for safe and efficient data handling. His work emphasizes scalable cloud-based solutions and efficient query execution models. Publications highlight advancements in parallel query processing (e.g., PAXQuery), type-based optimizations for XML updates, and semantic graph analytics. He has collaborated with institutions like EDBT, WWW, and VLDB conferences.

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

Radu Mateescuمشاهده پروفایل

استاد

InriaFrance

Radu Mateescu is a Research Director at Inria Grenoble - Rhône-Alpes where he heads the CONVECS research team. He has been with Inria since 1998, previously working as a researcher in the VASY project-team. His research focuses on formal methods, particularly model checking and verification of concurrent systems. Mateescu holds a PhD in Computer Science from INPG (Institut National Polytechnique de Grenoble) with a thesis on "Verification of the temporal properties of parallel programs". His educational background includes a graduate engineer diploma from the POLITEHNICA University of Bucharest in Automatic Control and Computers. He has been instrumental in developing several formal verification tools including XTL, CAESAR_SOLVE, EVALUATOR, and BISIMULATOR. His research interests span formal specification and verification of temporal properties of concurrent systems, temporal logics extended with data-handling primitives, on-the-fly model checking, equivalence checking, diagnostic generation, partial order reduction, and massively parallel verification. He served as chairman of the FMICS (Formal Methods for Industrial Critical Systems) Working Group of ERCIM from 2011 to 2014. Mateescu has published extensively in formal methods, with recent work focusing on applications in autonomous vehicles, IoT systems, and hardware verification. His publications show a consistent trend toward applying formal verification techniques to increasingly complex real-world systems, particularly in safety-critical domains. Test-of-Time Tool Award at ETAPS'2023 Inria - Académie des Sciences - Dassault Systèmes Innovation Prize Information Technology Award from Fondation Rhône-Alpes Futur Mateescu has taught courses at ENSIMAG (Grenoble), ESIREM (Dijon), and the University of Savoie. He has contributed to major research projects involving industrial applications of formal methods, particularly through the CADP toolbox which has been used to verify numerous critical systems including the IEEE-1394 FireWire protocol, Bull's cluster file system, and autonomous vehicle systems. His work bridges theoretical formal methods with practical industrial applications.

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