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

Anil Madhavapeddyمشاهده پروفایل

استاد

• Environmental Computing
• Climate Change Informatics
• Distributed Systems
• +۵ مورد دیگر

Anil Madhavapeddy serves as Professor of Planetary Computing at the University of Cambridge's Department of Computer Science and Technology and directs the Cambridge Centre for Carbon Credits (4C). A Fellow of Pembroke College, he integrates systems research with environmental conservation through the Computer Laboratory's Environment and Energy Group. His career spans industry leadership (NetApp, Citrix, Intel), academic appointments (Cambridge, Imperial, UCLA), and entrepreneurial ventures (XenSource, Unikernel Systems, Docker). Madhavapeddy earned his PhD at Cambridge's Computer Laboratory in 2006. His research bridges computational systems and planetary-scale environmental challenges, with deep expertise in open-source development (OCaml, Xen, Docker, OpenBSD) and technology strategy advising for organizations including Zededa, Tezos Foundation, and Tarides. His work centers on environmental computing and climate informatics, leveraging distributed systems and functional programming to develop sensing infrastructure for conservation. Recent projects focus on carbon credit systems, AI-driven biodiversity monitoring, and sustainable computing architectures that minimize ecological footprints while maximizing analytical capability. Analysis of his 2025 publications reveals a concentrated effort on AI-integrated conservation tools, privacy-preserving carbon accounting, and energy-efficient computing. Key themes include spatial networking for ecological data, LLM-enhanced evidence retrieval in conservation science, and novel metrics for extinction risk assessment—demonstrating computational innovation applied to urgent planetary boundaries. No scientific awards were documented in the source material. Madhavapeddy advises multiple technology firms on strategic development while leading the Cambridge Centre for Carbon Credits, though specific grant funding details remain unreported. He actively contributes to the Environment and Energy Group at Cambridge's Computer Laboratory and directs the interdisciplinary Cambridge Centre for Carbon Credits (4C). His open-source leadership spans critical infrastructure projects including OCaml, Xen, and Docker, fostering collaborative development communities that underpin modern cloud and container technologies.

Timothy M. Jonesمشاهده پروفایل

استاد

• Compilers
• Computer Architecture
• Binary Modification
• +۳ مورد دیگر

Timothy M. Jones is a Professor of Computer Architecture and Compilation at the University of Cambridge Computer Laboratory, where he leads research in systems-level computing. He is also a Fellow at Gonville and Caius College, contributing to academic leadership and student mentorship within the collegiate system. His primary affiliation with the Computer Laboratory positions him at the forefront of systems research within the university. Dr. Jones's research focuses on extracting various forms of parallelism (thread-level, data-level, memory-level) to enhance computational performance while addressing energy efficiency and reliability challenges. His work spans compiler design, binary translation, and microarchitecture optimization, with specific interest areas including: Compiler technologies for functional and parallel programming Hardware reliability and fault tolerance mechanisms Binary analysis and instrumentation frameworks Memory system optimization and virtual memory management Security enhancements through binary modification Runtime systems for heterogeneous architectures Analysis of his recent publications reveals strong emphasis on systems-level innovation, particularly in fault tolerance techniques, binary analysis tools, memory optimization, and parallel execution frameworks. His work consistently bridges theoretical computer science with practical hardware implementation challenges. Dr. Jones maintains active participation in the academic community through conference leadership roles, including serving as Program Co-Chair for CGO 2026 and committee positions at premier venues including ISMM, CGO, and ECOOP. He contributes to open-source academic resources through GitHub and maintains professional engagement via Twitter.

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.

• Program Verification
• Proof Engineering
• Formal Methods
• +۴ مورد دیگر

Karl Palmskog is a Lecturer at KTH Royal Institute of Technology in the Division of Theoretical Computer Science and the STEP research group. His work focuses on program verification and proof engineering, with particular emphasis on developing techniques and tools based on proof assistants for constructing functionally correct and secure software systems. Palmskog received his Ph.D. in Computer Science in 2014 from KTH, advised by Mads Dam, and his M.Sc. in Computer Science and Engineering from KTH in 2007. Prior to his current position, he was a postdoc at The University of Texas at Austin and University of Illinois at Urbana-Champaign. His research interests span programming languages, software engineering, and formal verification, with a particular focus on developing techniques and tools based on proof assistants. He is an avid user of the Coq proof assistant for both proving and programming, often complemented by OCaml, and also utilizes HOL4 and other ML family dialects. His work bridges theoretical foundations with practical applications, particularly in the domains of blockchain systems, distributed systems, and automotive software verification. Analysis of his recent publications reveals a strong focus on Coq-based verification, with significant contributions to proof engineering tools and methodologies. His work includes developing tools for regression proving, change impact analysis, mutation testing for Coq projects, and lemma name suggestion using deep learning. There's also a growing trend toward applying formal methods to real-world systems like blockchain protocols and automotive software. Palmskog has been involved in several research projects, including Coq-community Proof Engineering and Distributed Components. His past projects include Trustfull (SSF), Model-based Event Driven Scalable Programming for the Mobile Cloud (NSF), Highly Adaptable and Trustworthy Software (EU FP7), and 4WARD Future Internet (EU FP7). As an educator, Palmskog has served as examiner, course responsible, teacher, and assistant for various courses including Algorithms, Data Structures and Complexity; Degree Projects; Game Theory; Parallel and Distributed Computing; and Programming Paradigms. His work on Chip, a Coq formalization of change impact analysis, demonstrates his commitment to creating practical, certified tools that bridge formal methods with software engineering practice.

• Software Engineering
• Cybersecurity
• Formal Methods
• +۵ مورد دیگر

Role & Affiliation: Jean-Christophe BACH is an Associate Professor at IMT Atlantique's Computer Science department since 2015. He leads the PASS research group (IRISA) and focuses on software security, model-driven engineering, and cybersecurity applications. Previously, he held roles as a teaching assistant (ATER) at University of Lille (2014–2015) and completed his PhD on model transformations at Inria/LORIA under Pierre-Étienne Moreau and Marc Pantel (defended 2014). Research Interests: His work centers on improving software trustworthiness through 'security by design' principles. Key areas include model federation, formal methods for software verification, transformation traceability, and cybersecurity in industrial systems. He actively contributes to frameworks like Openflexo and PAMELA, emphasizing practical tooling for secure systems engineering. Teaching & Education: Teaches advanced topics such as object-oriented design, functional programming (OCaml), concurrency modeling, and cybersecurity. Supervises student projects on Openflexo, game development, and network security (IPv6/Tor). Courses include INF301, INF447, and others. Labs & Collaborations: Engaged with IRISA and Lab-STICC research centers. Collaborates on projects like the European Space Agency's SSE4Space framework for secure space missions and the Quarteft project (aerospace software). Active in open-source initiatives and scientific mediation for K-12 programming education.

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

استاد

• Formal verification
• Semantics of programming languages
• Compilers
• +۳ مورد دیگر

Sandrine Blazy is a Professor in the Computer Science Department at the University of Rennes, France. She is a member of CELTIQUE (also referred to as Epicure), a joint project-team with Inria Rennes Bretagne Atlantique and the IRISA laboratory. Since 2021, she has served as deputy director of the IRISA CNRS UMR 6074 laboratory and will be the general chair for POPL 2026, which will be held in Rennes. She is also a member of the editorial board of the LMCS journal. Dr. Blazy completed her PhD at CNAM (Conservatoire National des Arts et Métiers) in 1993 with a thesis titled "La spécialisation de programmes pour l'aide à la maintenance du logiciel" (Program Specialization for Software Maintenance Assistance). She later completed her Habilitation à diriger des recherches (HDR) in 2008 at the University of Évry Val d'Essonne with a thesis titled "Sémantiques formelles" (Formal Semantics). Her research focuses on the formal verification of program transformations and semantic properties of programming languages, particularly in the context of the CompCert compiler and Verasco static analyzer. She develops mechanized semantics using the Coq (or Rocq) proof assistant to ensure software correctness and security. A prime application domain of her work is software security, including constant-time programming for cryptographic applications and software obfuscation techniques. Her teaching includes mechanized semantics (in Coq), functional programming (in OCaml), formal methods (using Why3), and software vulnerabilities. Dr. Blazy's publication record from 2019-2025 shows a sustained focus on verified compilation techniques, particularly in preserving security properties during compilation. Her work bridges theoretical formal methods with practical compiler implementation, resulting in tools that have real-world impact in safety-critical systems. She has made significant contributions to the CompCert formally verified compiler project, with particular attention to constant-time preservation for cryptographic applications and JIT compilation verification. Her scientific achievements have been recognized with several major awards: CNRS Silver Medal (2023) Lucas Award from Formal Methods Europe (2023) ACM SIGPLAN Programming Languages Software Award for CompCert (2022) ACM Software System Award for CompCert (2021) Dr. Blazy has been actively involved in the programming languages research community, serving on numerous program committees for major conferences including POPL, ICFP, PLDI, and CPP. She has mentored students and contributed to education through teaching mechanized semantics and formal methods. Her work with the CompCert compiler has led to practical applications in safety-critical systems, with industry collaborations documented in publications like "CompCert: Practical experience on integrating and qualifying a formally verified optimizing compiler" (ERTS 2018). She leads research within the CELTIQUE project team, which focuses on developing trustworthy software using deductive verification. Her team works on advancing the state of the art in formal verification of compilers and static analyzers, with applications in security-critical domains including cryptographic implementations and safety-critical embedded systems.

Sam Lindleyمشاهده پروفایل

دانشیار

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

Sam Lindley is a Reader in Programming Language Design and Implementation at the School of Informatics, University of Edinburgh. He holds a UKRI Future Leaders Fellowship in Effect Handler Oriented Programming. His research focuses on foundational aspects of programming languages, including effect systems, session types, type theory, and functional programming. Key research interests span algebraic effects, concurrency models, type systems for resource management, and language implementation techniques. Lindley's work bridges theory and practice, addressing challenges in systems programming, web technologies (e.g., WebAssembly), and compiler design. Recent publications (2023–2025) emphasize effect handlers for low-level languages (e.g., C, WebAssembly), modal type systems for memory management, and formal semantics for concurrent systems. His work often explores how advanced type systems can improve expressivity and efficiency in programming models. Scientific Awards: UKRI Future Leaders Fellowship Labs/Teams: Laboratory for Foundations of Computer Science (LFCS) Grants: Active funding via UKRI Fellowship

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.

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

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.

Benjamin Pierceمشاهده پروفایل

استاد

• Programming Languages
• Type Systems
• Language-based Security
• +۴ مورد دیگر

Benjamin Pierce is the Henry Salvatori Professor in the Department of Computer and Information Science at the University of Pennsylvania. His research spans programming languages, formal verification, and sustainable computing, with a focus on practical applications in software reliability and security. He leads initiatives like Carbon Connect (NSF Expedition in Sustainable Computing) and serves on climate-focused committees such as Penn's Faculty Senate Select Committee on the Climate Emergency. Research Interests Pierce's work integrates theoretical and applied computer science, emphasizing: Programming Languages : Type systems, language-based security, and compiler verification Formal Methods : Computer-assisted verification, proof automation, and property-based testing Sustainability : Reducing computing's environmental impact through algorithmic efficiency and policy Recent Publications His 2023-2025 publications demonstrate a strong focus on enhancing software testing (e.g., Tyche for property-based testing), advancing formal verification tools (e.g., Coq deautomation), and pioneering sustainable computing frameworks. Climate-related research is a growing theme. Awards and Honors 2024: Distinguished Paper Award (ICSE) 2020: Best Paper Award (POPL) 2015: Most Influential Paper Award (ACM SIGPLAN) 2013: LICS Test of Time Award 2012: ACM Fellow Advising and Grants He advises 8 PhD students on topics ranging from type systems to verified compilation. Notable projects include: NSF-funded Carbon Connect expedition SHF grant for usable property-based testing Development of verification tools (VERSE, Unison) Professional Activities Serves on editorial boards for Journal of Functional Programming and Logical Methods in Computer Science , and organizes major conferences (PLDI, POPL, OOPSLA). Advocates for low-carbon virtual conferences.

Arthur Charguéraudمشاهده پروفایل

پژوهشگر

• Program Verification
• Separation Logic
• Interactive Theorem Proving
• +۸ مورد دیگر

Arthur Charguéraud is a senior researcher (Directeur de Recherche) at Inria, based in Strasbourg within the Camus team, affiliated with the iCube laboratory at Université de Strasbourg. His research spans program verification, program optimization, and mechanized semantics of programming languages, with a strong focus on separation logic and interactive theorem proving using Coq. Affiliation: Inria, Camus team, iCube Laboratory, Université de Strasbourg Position: Senior Researcher (Directeur de Recherche) Research Focus: Formal verification, separation logic, source-to-source transformations, high-performance computing His research interests center on developing formal methods to ensure correctness and efficiency in software systems. He works extensively on separation logic to verify both time and space complexity of programs, especially in the presence of garbage collection. His work bridges theoretical foundations with practical tools, such as the CFML framework and the OptiTrust optimization framework, which enables trustworthy source-to-source transformations with formal guarantees. His publications reveal a consistent focus on interactive verification, formal semantics, and performance optimization. Key themes include granularity control in parallelism, mechanized semantics (e.g., for JavaScript), and verified compilation. He has made significant contributions to separation logic, including extensions for time and space credits, big-O reasoning, and higher-order representation predicates. Arthur Charguéraud has received notable recognition for his work, including: Distinguished Paper Award at CPP 2022 SIGPLAN Research Highlight at PPoPP 2019 He has advised several PhD students and postdoctoral researchers, including Guillaume Bertholon, Alexandre Moine, and Armaël Guéneau. He leads the ANR-funded OptiTrust project (2022–2027), which aims to build a framework for verified source-to-source optimizations. He has also been involved in other major projects such as ANR VOCAL, ANR AJACS, and ERC DeepSea. His work is supported by both national (ANR, Inria) and institutional (CEA, ENS) grants. He is actively involved in the programming languages research community, serving on the program committees of top conferences including POPL, ICFP, PLDI, CPP, and CoqPL, and has chaired several workshops. He is also engaged in education and outreach, co-authoring the book Separation Logic Foundations in the Software Foundations series and designing challenges for the Concours Castor Informatique to promote computer science among young students.

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

پژوهشگر

• Functional Programming
• Type Systems
• Logics
• +۳ مورد دیگر

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.

Benjamin C. Pierceمشاهده پروفایل

استاد

• Programming Languages
• Type Systems
• Language-based Security
• +۵ مورد دیگر

Benjamin C. Pierce is the Henry Salvatori Professor of Computer and Information Science in the School of Engineering and Applied Science at the University of Pennsylvania. As a Fellow of the ACM, he has made significant contributions to programming language theory and formal methods. His academic leadership includes previous editorial roles as co-Editor in Chief of the Journal of Functional Programming and Managing Editor for Logical Methods in Computer Science. His research spans multiple interconnected domains in programming language theory, with particular emphasis on type systems and their applications to security and verification. Pierce's work bridges theoretical foundations with practical implementations, most notably through his development of the Unison file synchronization tool and contributions to the Clowdr virtual conference platform. His research interests form a cohesive trajectory from foundational type theory to applied security and verification techniques. Pierce's scholarly output shows consistent focus on property-based testing, type systems, and formal verification methods. His recent publications demonstrate evolving interests in differential privacy verification, synchronization technologies, and the practical challenges of implementing formal methods in real-world systems. The progression of his work reflects both theoretical depth and practical relevance to software development challenges. Fellow of the ACM Author of influential textbooks Types and Programming Languages and Software Foundations Lead designer of the Unison file synchronizer Co-developer of the Clowdr virtual conference platform Former editorial leadership for multiple prominent programming languages journals As an educator and mentor, Pierce has contributed to the Programming Languages Mentoring Workshop (PLMW) and has served on numerous conference program committees. His academic service extends to SIGPLAN leadership roles including SIGPLAN Vice Chair and Steering Committee membership. His textbook Software Foundations has become a standard resource for teaching formal methods and proof assistants.

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

پژوهشگر

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

Matthieu Sozeau is a Researcher at Inria , leading the MetaCoq project and contributing to the Coq proof assistant. He serves on program committees for conferences like POPL 2025 and ICFP 2024 , with a focus on mechanized metatheory and certified extraction. Research Interests : Type Theory, Proof Assistants, Functional Programming, Unification Key Contributions : Coq 8.5/8.19 kernel features, Equations plugin, CertiCoq verified compiler, MetaCoq formalization His recent work includes sort polymorphism for proof assistants, verified OCaml extraction , and soundness proofs for Coq's type system. He has received ACM Software System Award for Coq and distinguished paper awards at ICFP and PLDI. Actively involved in teaching proof assistants at MPRI and Coq Andes Summer School , he drives the evolution of Coq through formal verification and type system enhancements.