Pierre-Evariste Dagand

Pierre-Evariste Dagand is a CNRS Researcher at IRIF, Université de Paris, where he is a member of the Proofs, Programs, and Systems group. His research focuses on enhancing the safety of systems software through the application of domain-specific languages and formal verification techniques, particularly leveraging interactive theorem provers.

His research interests span several areas of computer science, including:

• Formal Methods: Using rigorous mathematical techniques to verify software and hardware systems
• Programming Languages: Designing and implementing languages with a focus on safety and correctness
• Compilers: Developing verified compilers for domain-specific languages and synchronous languages
• Type Theory: Exploring dependent types and their applications in verification
• Operating Systems: Contributing to the design of systems for multicore architectures
• Cryptography: Creating high-throughput cryptographic implementations via formal methods

Dagand's publications demonstrate a consistent focus on formal verification and theorem proving applied to practical systems. His work frequently involves the Coq proof assistant and addresses challenges in compilers, cryptography, and systems programming. Recent trends include the development of tools for secure cryptographic implementations (e.g., Usuba and Tornado) and formal models for intermittent computing.

He has advised numerous students in internships, working on projects related to formal methods, compilers, and cryptography. These internships have contributed to various research outputs and tools.

Dagand is part of the Proofs, Programs, and Systems group at IRIF, which focuses on foundational aspects of computer science and their application to software verification and language design.