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

Ken Friis Larsenمشاهده پروفایل

دانشیار

• Programming Languages
• Security
• Privacy
• +۷ مورد دیگر

Ken Friis Larsen is an Associate Professor at the Department of Computer Science (DIKU), University of Copenhagen, specializing in programming languages, security, privacy, and functional programming. He contributes to projects like HIPERFIT (high-performance financial computing) and WallViz (visualization tools). Research Focus : Language design, formal methods, functional programming (Standard ML, Haskell, OCaml, Scheme), secure compilation, and performance optimization. Technical Leadership : Maintains Moscow ML (Standard ML implementation) and mGTK (functional GUI library). Key Publications : 2020: Hermes (secure compilation without side-channels) 2019: F (music composition language) 2016: Redomap (GPGPU performance in Futhark) Additional Contributions : Co-developed PaML (parser combinators in SML) Active participant in ICFP Programming Contest (2005, 2008, 2017) Advocate for rigorous testing practices (QuickCheck, Criterion) and type-driven design

Lars Birkedalمشاهده پروفایل

استاد

• Programming Languages
• Type Theory
• Separation Logic
• +۴ مورد دیگر

Lars Birkedal is a Professor in the Department of Computer Science at Aarhus University, Denmark. He is a leading researcher in programming languages and formal methods with extensive contributions to the field over the past decade. His work appears consistently in top-tier programming languages conferences including POPL, ICFP, and PLDI, where he has served in leadership roles such as Program Chair and committee member. Birkedal's research primarily focuses on the theoretical foundations of program verification, with significant contributions to separation logic, type theory, and formal methods for concurrent and probabilistic systems. His work bridges theoretical computer science with practical verification challenges, particularly through the development and application of the Iris framework for higher-order concurrent separation logic. He has pioneered approaches for reasoning about probabilistic programs, capability-based security, and memory models for modern architectures. Analysis of Birkedal's recent publications (2023-2025) reveals a continued focus on advancing separation logic for increasingly complex systems. His work shows a clear trajectory from foundational theoretical work toward practical verification of real-world systems like WebAssembly while maintaining rigorous formal guarantees. There's a notable emphasis on probabilistic programming, error bounds analysis, and distributed systems verification in his most recent contributions. As a faculty member at Aarhus University, Birkedal has built a strong research group focused on programming language theory and formal verification. His leadership in the programming languages community is evident through his repeated service on program committees for major conferences and his mentorship of numerous graduate students and junior researchers, though specific student names aren't listed in the available information. His research has likely been supported by significant grants from Danish and European funding agencies, given the sustained output and international collaborations evident in his publication record.

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

استاد

• Programming Languages
• Computer Security
• Quantum Computing
• +۷ مورد دیگر

Michael Hicks is a Professor in the Department of Computer and Information Science at the University of Pennsylvania and an Amazon Scholar. Previously, he was a Professor at the University of Maryland (2002-2021) and Senior Principal Scientist at Amazon Web Services (2022-2025). He co-founded the Programming Languages research lab (PLUM) at Maryland and was its director, as well as Director of the Maryland Cybersecurity Center (MC2). He is a Fellow of the Association of Computing Machinery (ACM), former Chair of ACM SIGPLAN, and Editor-in-Chief of Proceedings of the ACM on Programming Languages (PACMPL). His research focuses on programming languages and their application to software security , quantum programming , and formal verification . He has pioneered dynamic software updating techniques, developed tools like Checked C for memory safety, and co-designed the Cedar authorization policy language at AWS. In quantum computing, he works on verified compilers like VOQC and Qunity to ensure reliability and correctness. His recent work trends include quantum programming languages , secure multi-party computation (e.g., Wysteria , Symphony ), and fuzz testing methodologies . He has contributed to formal verification for quantum programs and language-based security frameworks. Scientific Awards include: ACM Fellow He has advised numerous PhD and Master’s students , including James Parker, Andrew Ruef, Kesha Hietala, and Aseem Rastogi, who now hold academic and industry positions. His lab, PLUM , has been instrumental in advancing programming languages research.

Sandrine Blazyمشاهده پروفایل

استاد

• Formal Verification
• Semantics of Programming Languages
• Compilers
• +۵ مورد دیگر

Sandrine Blazy is a Professor at the University of Rennes , where she teaches mechanized semantics (in Coq), functional programming (in OCaml), formal methods (using Why3), and software vulnerabilities. She is a member of the CELTIQUE and Epicure project-teams, both affiliated with Inria Rennes and IRISA laboratory. Her research focuses on formal verification of compilers and program transformations, notably through the CompCert compiler and Versaco static analyzer. Education : HDR (Habilitation à Diriger des Recherches) in Computer Science, Université d'Évry Val d'Essonne (2008). Research Interests : Her work ensures mathematical guarantees in compiler correctness, preventing security bugs during program translation. She specializes in deductive verification , static analysis , and software security , with applications in critical systems like avionics and cryptography. Scientific Awards : CNRS Silver Medal (2023) Lucas Award from Formal Methods Europe (2023) ACM SIGPLAN Programming Languages Software Award (2022) ACM Software System Award (2021) Best Paper Award at FMTea 2014 La Recherche Award in Information Sciences (2011) Advising and Grants : She has advised numerous PhD students (e.g., Solène Mirliaz, Aurèle Barrière) and led research projects like Scrypt (secure compilation for cryptography), ERC VESTA (verified static analysis), and VERASCO (formal verification of compilers). Her grants include ANR and FNRAE funding. Labs and Teams : Actively involved in IRISA CNRS UMR 6074 as deputy director (2021), and collaborates with Inria Rennes and CNRS project teams.

Daniel R. Licataمشاهده پروفایل

دانشیار

• Type Theory
• Category Theory
• Logic
• +۹ مورد دیگر

Daniel R. Licata is an Associate Professor at Wesleyan University and a leading researcher in type theory, category theory, and functional programming. He earned his PhD from Carnegie Mellon University in 2011 and completed a postdoctoral fellowship at the Institute for Advanced Study (2012–2013). Research Interests : Type theory, category theory, logic, functional programming, cost analysis, and education. Teaching : He frequently teaches Functional Programming and has organized programming language summer schools. Research Trends : His work bridges homotopy type theory, directed type systems, and formal verification. Key contributions include gradual type theory, mechanized proofs in synthetic homotopy, and frameworks for substructural and modal logics. He often explores connections between type theory and computational mathematics. Service : He has served on program committees for POPL, ICFP, and CPP. He co-organized NEPLS at Wesleyan and contributed to the Twelf Wiki and tutorial projects.

Enrico Tassiمشاهده پروفایل

پژوهشگر

• Interactive Theorem Proving
• Formal Verification
• Type Theory
• +۵ مورد دیگر

Enrico Tassi is a researcher at Inria, France, affiliated with the STAMP team. His work focuses on the technology of formal proofs, particularly type theory, interactive theorem proving, and its application to formalizing mathematics. He is a key contributor to the development of tools like Coq-Elpi , Hierarchy-Builder , and the small scale reflection Coq extension. His research spans proof assistant architecture, software design, and formal verification, with a strong emphasis on free software principles. Enrico completed his Ph.D. at the University of Bologna in 2008, where he designed the Matita interactive theorem prover. He contributed to the formalization of the Odd Order Theorem and the Paral-ITP project, aiming to scale Coq for large mathematical libraries. His software projects include Elpi , a meta-language for proof assistants, and past contributions to Debian as a developer (2006–2016), focusing on integrating the Lua language into Debian systems. His publications highlight innovations in unification algorithms, tactical design, and proof structuring techniques. Articles address challenges in bi-directional type inference, pattern-based proof command focusing, and nonuniform coercion implementations. His work on small-scale reflection and Hierarchy-Builder demonstrates expertise in algebraic hierarchies and formal library management. Current efforts target enhancing OCaml-based systems through Elpi's high-level programming capabilities. Key Collaborations : Mathematical Components team (INRIA), D.A.M.A. Project Major Tools : Coq-Elpi, Hierarchy-Builder, Matita Formalization Efforts : Ordered Uniformities, Odd Order Theorem, Finite Group Theory

Shriram Krishnamurthiمشاهده پروفایل

استاد

• Programming Languages
• Type Systems
• Formal Methods
• +۳ مورد دیگر

Shriram Krishnamurthi is a Professor in the Department of Computer Science at Brown University, specializing in programming languages, formal methods, and software education. His research focuses on language design, type systems, and pedagogical approaches to programming concepts. Recent publications highlight his work in areas such as Rust trait error debugging formal methods teaching tools automated type error telemetry document calculus design logic misconceptions in education His contributions also include program committee roles at major conferences like SPLASH, ICFP, and SIGCSE.

Işıl Dilligمشاهده پروفایل

دانشیار

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

Işıl Dillig is an Associate Professor in the Department of Computer Science at the University of Texas at Austin, leading the UToPiA research group. She focuses on programming languages, with emphasis on static analysis, verification, and synthesis to enhance software reliability and security. Education: BS, MS, PhD in Computer Science from Stanford University Her research addresses critical challenges in: Program analysis for security and correctness Automated program synthesis for complex tasks Verification of concurrent and database-driven systems Recent publications span neurosymbolic synthesis, database integration, and smart contract optimization. Trends include hybrid AI-formal methods approaches and domain-specific language design. Scientific recognition includes: Sloan Fellowship NSF CAREER award She actively contributes to academic leadership as committee member, program chair, and keynote speaker in top conferences like PLDI, OOPSLA, and POPL.

Denis Firsovمشاهده پروفایل

پژوهشگر

• Formal Methods
• Cryptography
• Type Theory
• +۳ مورد دیگر

Denis Firsov is a researcher at the Department of Software Science at Tallinn University of Technology (TUT) and a formal methods engineer at Input Output Global (IOG) . His work bridges formal methods , cryptography , and type theory , with a focus on zero-knowledge proofs , security verification , and language-based security . He has a PhD from the Institute of Cybernetics at TUT (2016), where he studied constructive type theory using Agda and Coq. Postdoctoral research at the University of Iowa (2016-2018) involved impredicative type theory in Cedille. He has held positions at GuardTime (2018-2020) and Matter Labs (2020-2023), working on formal verification of cryptographic protocols and ZK-circuit DSLs . Research Highlights: Developed formalizations for zero-knowledge protocols (Fiat-Shamir, Schnorr, Blum) in EasyCrypt Created Rust DSLs for ZK-circuits with formal correctness proofs Advanced impredicative lambda-encodings with induction in Cedille Contributed to parser certification for context-free and regular languages Patents: US 11,316,698: Delegated signatures for smart devices EU EP4044501B1: Method for data signatures with unbounded keys

Tobias Nipkowمشاهده پروفایل

استاد

• Term Rewriting
• Theorem Proving
• Formal Methods
• +۳ مورد دیگر

Tobias Nipkow is a full Professor at the Faculty of Informatics, Technical University of Munich (TUM), Germany, where he leads the Theorem Proving Group and maintains active academic duties as evidenced by ongoing conference commitments through 2026. His office is located at Boltzmannstr. 3, 85748 Garching, with contact email nipkow@in.tum.de and office hours held Wednesdays 11:00-12:00 during semester periods. Nipkow serves on CPP Steering Committees (2015-2026) and Program Committees (2018, 2023), reflecting sustained leadership in programming language research. His seminal work spans term rewriting systems and theorem proving, established through the authoritative text Term Rewriting and All That (Cambridge University Press, 1998). Current research emphasizes formal verification using Isabelle/HOL, with extensions into verified functional algorithms ( Functional Algorithms, Verified! ), concrete semantics education, and probabilistic program verification. This integrates theoretical computer science with practical proof assistant applications, focusing on termination, confluence, and unification in rewriting systems. Recent publications demonstrate a clear trajectory toward educational applications of formal methods and foundational data structure verification. The 2021 CPP invited talk explores proof assistants for teaching algorithms, while the 2020 CPP proof pearl formalizes Braun trees using Isabelle. Earlier work like the 2015 ESOP paper on verified probability density compilers shows consistent themes of mechanized semantics and verification. These outputs highlight his dedication to bridging theoretical concepts with classroom and industrial practice. Nipkow directs TUM's Theorem Proving Group, the core development team for the Isabelle interactive proof assistant. The group maintains the Archive of Formal Proofs (isa-afp.org), a major repository of formalized mathematics, and organizes annual Isabelle Workshops. Their work underpins verification projects across academia and industry, with direct influence on ITP and CPP conference series through leadership roles and tutorial development.

• Interactive Theorem Proving
• Formalization of Mathematics
• Proof by Reflection
• +۳ مورد دیگر

Kazuhiko Sakaguchi is a Researcher affiliated with CNRS (French National Centre for Scientific Research), École Normale Supérieure de Lyon (ENS Lyon) , and Université Claude Bernard Lyon 1 , working at the Laboratoire de l'Informatique du Parallélisme (LIP, UMR 5668) . His primary research focuses on foundational aspects of programming languages and formal verification. Research Interests: Sakaguchi specializes in interactive theorem proving (particularly using Coq), formalization of mathematics , and proof by reflection . His work bridges theoretical computer science and practical tool development, with applications in algorithm verification, algebraic hierarchies, and dependent type systems. Publication Trends: His recent articles emphasize formal verification of algorithms (e.g., mergesort correctness), design patterns for mathematical structures in proof assistants, and program extraction techniques. A consistent theme is enhancing productivity in theorem proving through reusable abstractions and automated tactics.

Oded Padonمشاهده پروفایل

استادیار

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

Oded Padon is a Senior Scientist (≈Assistant Professor) at the Weizmann Institute of Science , affiliated with the Faculty of Mathematics and Computer Science . He joined Weizmann in September 2024 after prior roles as a researcher at VMware Research Group , a postdoc in Alex Aiken's group at Stanford University , and a PhD student at Tel Aviv University under Mooly Sagiv . Research Interests : Oded's work focuses on developing principled algorithms for automated verification of complex systems, particularly distributed protocols, storage systems, and cluster management. He emphasizes decidable logics, primal-dual methods, and decomposition techniques. His recent interests include verification of deep neural networks , quantum computing , and leveraging large language models for verification tasks. Key projects: Ivy (safety/liveness verification), mypyvy (invariant inference), Verus (Rust verification), TASO (deep learning optimization), Quartz (quantum circuit superoptimizer). Scientific Awards : Azrieli Early Career Faculty Fellowship 2020 ETAPS Doctoral Dissertation Award 2017 Google PhD Fellowship in Programming Languages Radhia Cousot Young Researcher Best Paper Award (SAS 2017) Publications span decidable verification, invariant inference, quantum optimization, and machine learning for verification. His work has received Jay Lepreau Best Paper Award at SOSP 2024 (Anvil) and Distinguished Paper Awards at POPL 2024 (An Infinite Needle) and OOPSLA 2023 (Leaf).

Jonathan Sterlingمشاهده پروفایل

دانشیار

• semantics
• type theory
• category theory
• +۴ مورد دیگر

Jonathan Sterling is an Associate Professor in Logical Foundations and Formal Methods at the University of Cambridge , and a Fellow of Clare College . His research focuses on programming languages and formal methods , integrating type theory , category theory , domain theory , and topos theory to explore semantics of computation. His recent contributions include papers at POPL 2024 ( The Essence of Generalized Algebraic Data Types , Decalf: A Directed, Effectful Cost-Aware Logical Framework ), POPL 2022, and ICFP 2019. These works span logical frameworks , cost-aware programming , and modal dependent type theory , reflecting his interest in bridging theoretical insights with practical programming language design. Jonathan maintains active involvement in academic service, serving on program committees for OOPSLA, ICFP, POPL, TyDe, and WITS. He advocates for sustainable intellectual infrastructure, emphasizing the need for long-term funding models for tools like proof assistants and formal verification systems. His personal website and GitHub repositories ( @jonsterling ) host projects such as Agda-CAFe and RedTT , which explore formal methods and type theory.

Bernardo Toninhoمشاهده پروفایل

استادیار

• Type Theory
• Programming Languages
• Linear Logic
• +۵ مورد دیگر

Bernardo Toninho is an Assistant Professor at the School of Science and Technology, NOVA University of Lisbon, with a research focus on type theory and its applications to concurrent and distributed systems. He is affiliated with NOVA-LINCS and actively works on session types, linear logic, and program verification in languages like Go, Rust, and Haskell. Research interests include Type Theory, Programming Languages, Linear Logic, and Meta-programming Current teaching: Concurrent Programming Languages, Introduction to Programming (Fall 2022) Organizer of Programming Languages Mentoring Workshop (PLMW) at POPL 2019 Judge for Student Research Competition at SPLASH 2019 His work on Refinement Kinds (with Luís Caires) explores type-safe meta-programming by extending refinement types to the kind level. Articles highlight his contributions to session type theory, type systems for concurrency, and formal verification of channel-based communication. Scientific Awards Distinguished Reviewer Award (ESOP 2022) He has served on program committees for OOPSLA, ICFP, ESOP, and CONCUR, and contributed to foundational work in session types and linear logic. Projects include GOLEM (funded research) and Featherweight Go (formalization of Go's concurrency model).

Guillaume Bouvierمشاهده پروفایل

پژوهشگر

• Structural biology
• Protein conformational dynamics
• Dimensionality reduction techniques
• +۷ مورد دیگر

Guillaume Bouvier is a Researcher at the Institut Pasteur in Paris, France. His work focuses on structural biology, computational modeling, and biophysics, particularly on protein conformational dynamics and drug-target interactions. His research involves: Developing dimensionality reduction techniques for protein structural analysis Applying Self-Organizing Maps (SOM) to map protein conformational spaces Combining molecular dynamics simulations with experimental data Contributing to drug discovery projects targeting tuberculosis and viral diseases Working on algorithms for contact matrix ordering and protein fold prediction Recent publications highlight his contributions to: 3D deep learning models for functional binding site prediction (InDeep/InDeepNet) Antiviral compound mechanism studies, particularly phthalazinone derivatives Atomic modeling of protein complexes using cryo-EM and co-evolutionary data Crosslinking mass spectrometry-based assembly modeling (XL-MOD software) Structural characterization of bacterial surface proteins and drug engagement