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

Yao Liمشاهده پروفایل

استادیار

• Programming Languages
• Formal Verification
• Dependent Types

Yao Li is an Assistant Professor of Computer Science at Portland State University, specializing in Programming Languages, Formal Verification, and Dependent Types. They earned a Ph.D. in Computer and Information Science from the University of Pennsylvania (2022), supervised by Stephanie Weirich, and hold a Master’s and Bachelor’s in Software Engineering from Shanghai Jiao Tong University (2016, 2013) under Zhengwei Qi. Ph.D., Computer and Information Science, University of Pennsylvania (2022) M.S., Software Engineering, Shanghai Jiao Tong University (2016) B.S., Software Engineering, Shanghai Jiao Tong University (2013) Their research focuses on formal verification of functional programming languages, particularly Haskell, and mechanized proofs using tools like Coq. They work on specifying and verifying networked servers, lazy program cost analysis, and embedded systems through program adverbs and Tlön embeddings. Recent publications (2018-2025) demonstrate expertise in Haskell verification, formal methods, and interaction trees. Key trends include bridging the gap between mechanized formalization and real-world code, advancing lazy evaluation semantics, and enhancing software verification through dependent types. Yao Li actively participates in academic service as a committee member and session chair in conferences like POPL, ICFP, and PLDI, contributing to artifact evaluation, program organization, and student research competitions.

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

استادیار

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

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.

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

استاد

• Programming Languages
• Networking
• Formal Verification
• +۳ مورد دیگر

Nate Foster is a Professor of Computer Science at Cornell University and a Visiting Researcher at Jane Street . During the 2023-24 academic year, he served as a Visiting Professor at EPFL in the Data Center Systems Laboratory. His research bridges Programming Languages and Networking , focusing on formal verification, data plane programming, and language design for networked systems. His recent work includes developing symbolic automata for network verification (e.g., Active Learning of Symbolic NetKAT Automata , StacKAT ), creating efficient verifiers like KATch , and advancing type safety in data plane programming (e.g., SafeP4 ). These efforts span formal methods, algorithm optimization, and practical networked systems. Notable scientific awards include: NSF CAREER Award Sloan Research Fellowship ACM SIGCOMM Rising Star Award ACM SIGPLAN Robin Milner Award He actively contributes to PLDI, POPL, OOPSLA, and ICFP, serving as author, editor, and committee member. His GitHub repositories include tools for academic website templates and programming language research codebases.

Samuel Thibaultمشاهده پروفایل

استاد

• Parallel Computing
• High Performance Computing
• Task-Based Runtime Systems
• +۳ مورد دیگر

Samuel Thibault is a Professor at University of Bordeaux, affiliated with Laboratoire Bordelais de Recherche en Informatique (LaBRI) and Inria Bordeaux -- Sud-Ouest. He is a member of the SATANAS team at LaBRI (theme: High Performance Runtime Systems for Parallel Architectures) and the STORM research team at Inria Bordeaux (previously RunTime). His work bridges academic research and practical implementation of high-performance computing systems. Thibault's research focuses on task-based runtime systems, particularly StarPU, for heterogeneous and parallel computing architectures. His work addresses critical challenges in scheduling algorithms, memory management under constraints, data locality optimization, and performance modeling for complex NUMA architectures. He has made significant contributions to the field of parallel computing through the development and analysis of runtime systems that efficiently manage tasks across diverse hardware resources including CPUs, GPUs, and other accelerators. His research has practical applications in scientific computing, deep learning inference, and large-scale simulations requiring extreme computing power. His recent publication trends show a strong emphasis on optimizing task-based runtime systems for heterogeneous architectures with particular attention to memory constraints and data locality. There's a clear progression toward applying these techniques to deep learning inference workloads, as evidenced by his StarONNX project. His work consistently addresses the challenge of balancing throughput and latency in complex computing environments, with increasing focus on recursive task graphs and dynamic adaptation strategies. Thibault is actively involved in European research initiatives including TEXTAROSSA (focusing on exascale technologies) and EXA2PRO (high development productivity on heterogeneous systems). His work has been published consistently in top-tier conferences and journals in parallel and distributed computing. As part of the STORM team at Inria Bordeaux, Thibault contributes to advancing the state of the art in runtime systems for high-performance computing. His team's work on StarPU has become a reference implementation in the field, enabling researchers and practitioners to develop applications that can efficiently utilize heterogeneous computing resources without needing to manage the complexity of different hardware architectures directly.

Sylvain Conchonمشاهده پروفایل

استاد

• Formal Methods
• Automated Deduction
• Program Verification
• +۱۰ مورد دیگر

Sylvain Conchon is a Professor at Université Paris-Saclay, affiliated with the Laboratoire Méthodes Formelles (LMF, UMR 9021) and the Toccata research team, a joint project with INRIA Saclay – Île-de-France. His work lies at the intersection of formal methods, automated reasoning, and software verification. Research Interests: His primary research areas include SMT solving, automated deduction, program verification, model checking for parameterized systems, and information flow analysis. He develops theoretical foundations and practical tools to ensure software correctness, particularly in safety-critical and concurrent systems. Publications and Tools: His recent work centers on projects like BPI IDemo ARGOS (2024) and PEPR Secureval (2022), focusing on industrial software verification and cybersecurity. He is the main developer of Alt-Ergo , an SMT-based theorem prover, and Cubicle , a model checker for parameterized systems. His publications span formal methods, logic in computer science, and static analysis, with a strong emphasis on tool building and application. Scientific Awards: Advising and Grants: He has advised several PhD students including Guillaume Girol, Alain Mebsout, and Mohamed Iguernelala. He has led and participated in numerous research projects funded by ANR, FUI, PEPR, and industrial partners, demonstrating sustained grant success in formal methods and verification. Labs and Teams: He is a core member of the Toccata team at INRIA Saclay and the LMF laboratory, where he collaborates on advancing the state-of-the-art in deductive program verification and automated reasoning.

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

دانشیار

• Programming Languages
• Type Theory
• Logical Relations
• +۹ مورد دیگر

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.

Djamal Zeghlacheمشاهده پروفایل

استاد

• Network Virtualization
• Cloud Computing
• Software-Defined Networking
• +۵ مورد دیگر

Djamal Zeghlache is a Professor at Telecom SudParis (now part of Institut Polytechnique de Paris), where he leads research in network virtualization, cloud computing, and software-defined networking. His work spans multiple domains including wireless communications, network security, and AI applications in networking systems. Affiliated with the SAMOVAR laboratory (Services and Architectures for Multimedia and Ubiquitous Access to Resources), he has established himself as a prominent researcher in network and service management. Professor Zeghlache's research interests focus on the intersection of networking and artificial intelligence, with particular emphasis on network virtualization, cloud computing, and software-defined networking. His work addresses critical challenges in network function virtualization, resource allocation, and optimization in distributed systems. In recent years, he has expanded his research to include AI-driven approaches for network management, healthcare monitoring using wireless technologies, and optical network control. His publications demonstrate a consistent trajectory from traditional networking challenges to more complex, AI-integrated solutions for modern network infrastructures. Analysis of his recent publications (2023-2025) reveals a strong trend toward integrating machine learning, particularly deep reinforcement learning and graph neural networks, into network management systems. His work spans multiple application areas including healthcare monitoring (using RF-based techniques for vital sign detection), transportation systems (bike-sharing optimization), and optical networking (disaggregated control frameworks). The interdisciplinary nature of his research connects computer networking with biomedical engineering, urban mobility, and formal methods for system verification. Professor Zeghlache has supervised numerous PhD students and collaborated extensively with researchers across Europe and internationally. His work has resulted in significant contributions to network virtualization, cloud resource management, and network security. He has been involved in multiple research projects focusing on next-generation networking technologies, including 5G, network slicing, and cloud-native network functions.

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

پژوهشگر

• programming languages
• functional programming
• type systems
• +۵ مورد دیگر

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مشاهده پروفایل

پژوهشگر

• Programming Languages
• Type Systems
• Functional Programming
• +۴ مورد دیگر

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مشاهده پروفایل

دانشیار

• Computer Science
• Functional Programming
• Temporal Media Systems
• +۴ مورد دیگر

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

• Economics of Information
• Microeconomic Theory
• Game Theory
• +۳ مورد دیگر

Gorkem Celik serves as Professor of Economics at ESSEC Business School since 2015, teaching PhD, advanced masters, and MBA programs. He concurrently holds a Research Fellow position at THEMA (CY Cergy Paris University and CNRS), focusing on economic theory with emphasis on institutional design under private information constraints. His academic credentials include: Ph.D. in Economics, Northwestern University (2002) B.A. in Economics with Highest Honors, Bilkent University (1997) Celik's research integrates Economics of Information, Microeconomic Theory, and Game Theory to analyze strategic behavior in mechanism design contexts. His work examines how institutions can achieve objectives when agents possess private information and conflicting interests, with applications spanning Industrial Organization, Positive Political Theory, and Law and Economics. He employs rigorous game-theoretic modeling to investigate information revelation dynamics and incentive structures. Publication trends reveal sustained contributions to mechanism design theory, with recent work addressing dispute resolution protocols (2025), organizational information aggregation (2023), and public goods provision (2021). His scholarship consistently bridges theoretical innovation with institutional applications, appearing in premier journals like Journal of Economic Theory and RAND Journal of Economics. Key recognitions include: Marie Curie Reintegration Grant (2011) SSHRC Standard Research Grant (2006) Robert Eisner Graduate Fellowship (2000) Top of Class at Bilkent University (1997) Celik advises doctoral candidates including FAZELI N. (2020 thesis on Industrial Organization) and serves on multiple thesis committees. His research program receives support from European Commission and Canadian funding bodies, while his academic service encompasses conference organization (e.g., Workshop on Voting Theory), journal reviewing for 20+ publications, and committee roles at LabEx MME-DII. He maintains active collaboration networks through visiting positions at Humboldt-Universität (2023-2024) and previous appointments at Tor Vergata University. As head of ESSEC's Economics track (2017-2021) and THEMA laboratory member since 2010, he contributes to research infrastructure development while leading projects on information economics and strategic manipulation in institutional settings.

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

پژوهشگر

• Cross-language interoperability
• Hardware-software co-design
• Compiler design
• +۴ مورد دیگر

David Chisnall is a researcher affiliated with the University of Cambridge and active in systems programming, compiler design, and cross-language interoperability. He contributes to conferences like POPL, PLDI, ISMM, and SPLASH, with particular focus on secure compilation and memory management.

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

استاد

• Computer Systems
• Software Verification
• Concurrency
• +۷ مورد دیگر

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.

Magnus Madsenمشاهده پروفایل

دانشیار

• Programming Languages
• Compilers
• Type and Effect Systems
• +۷ مورد دیگر

Magnus Madsen is an Associate Professor at Aarhus University, Department of Computer Science. He leads the development of the Flix programming language, a declarative tool integrating logic, functional, and imperative features with Java interoperability. His work spans type and effect systems, program analysis, and JavaScript bug-finding tools, particularly for asynchronous applications. Academic Affiliation: Aarhus University (Denmark) Leadership: Flix Programming Language Magnus's research focuses on programming language design, type systems, and static/dynamic analysis. This includes Datalog constraints, polymorphic effects, and nullability frameworks. His contributions to JavaScript analysis address asynchrony and concurrency challenges. Key trends in his work include declarative program analysis, effect system design, and Datalog-based frameworks like IFDS/IDE. Recent papers explore rank-polymorphic function inference, purity reflection, and stratification in logic programming. Scientific awards include: Sapere Aude grant (2023) Dahl-Nygaard Junior Prize (2022) STEM Grant (2022) Amazon Research Award (2021) DFF Project One (2020) ECOOP 2023 Distinguished Paper ICSE 2016 Distinguished Paper Current PhD students advised: Jonathan Lindegaard Starup, Matthew Lutze, Andreas Stenbæk Larsen (co-advised with Aslan Askarov), Caroline Palma Berger (co-advised with Clemens Nylandsted Klokmose).

Quentin Stiévenartمشاهده پروفایل

پژوهشگر

• Abstract Interpretation
• Concurrency
• Static Analysis

Quentin Stiévenart is a researcher at Université du Québec à Montréal, focusing on abstract interpretation, concurrency, and static analysis. His work spans programming language design, software verification, and tool development for WebAssembly and functional languages like Racket and Scheme. Active in organizing and reviewing for conferences including SPLASH, ICFP, ECOOP, and SAS Developed tools such as Wassail for WebAssembly static analysis and RacketLogger for educational purposes Contributions include theoretical work on effect-driven flow analysis and practical advancements in concolic execution abstraction His research addresses challenges in concurrency verification, cyclic reinforcement in incremental analysis, and security-focused taint tracking across multiple language paradigms.