2015 - ACM Fellow For contributions to safe, high-performance functional programming languages and compilers, and to compiler verification.
Xavier Leroy mainly investigates Programming language, Compiler, Proof assistant, Compiler correctness and Formal verification. His studies link Theoretical computer science with Programming language. He focuses mostly in the field of Proof assistant, narrowing it down to matters related to Abstract machine and, in some cases, Interpreter, Virtual machine and Reduction.
His Compiler correctness research is multidisciplinary, relying on both Compiler construction and Code generation. His study in Code generation is interdisciplinary in nature, drawing from both Executable, Interprocedural optimization, Inline expansion, Compile time and Assembly language. His Inline expansion research includes themes of Compilation error, Bootstrapping and Source code.
Programming language, Compiler, Theoretical computer science, Formal verification and Proof assistant are his primary areas of study. His Programming language study frequently draws connections between adjacent fields such as Mathematical proof. His research integrates issues of Executable and Code generation in his study of Compiler.
Coinduction is closely connected to Soundness in his research, which is encompassed under the umbrella topic of Theoretical computer science. The Proof assistant study combines topics in areas such as Semantics and Assembly language. The study incorporates disciplines such as Dead code elimination and Compiler construction in addition to Compiler correctness.
Xavier Leroy mainly focuses on Programming language, Compiler, Separation logic, Mathematical proof and Semantics. His research on Programming language often connects related topics like Session. His work on Compiler correctness as part of general Compiler study is frequently connected to Part iii, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.
His Compiler correctness research incorporates elements of Floating point and Compiler construction. As part of the same scientific family, Xavier Leroy usually focuses on Proof assistant, concentrating on Computation and intersecting with Assembly language, Lustre and Dataflow. Xavier Leroy works mostly in the field of Operational semantics, limiting it down to topics relating to Formal semantics and, in certain cases, Theoretical computer science, as a part of the same area of interest.
Xavier Leroy spends much of his time researching Programming language, Compiler, Semantics, Proof assistant and Mathematical proof. His research related to Computation, Separation logic, Floating point, Optimizing compiler and Formal verification might be considered part of Programming language. His work in Separation logic covers topics such as Operational semantics which are related to areas like Theoretical computer science.
His Recursion and Abstract interpretation study in the realm of Theoretical computer science interacts with subjects such as Compiled language. In Optimizing compiler, he works on issues like Executable, which are connected to Software engineering. His Compiler study combines topics in areas such as Soundness and Documentation.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Formal verification of a realistic compiler
Communications of The ACM (2009)
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
symposium on principles of programming languages (2006)
A Formally Verified Compiler Back-end
Journal of Automated Reasoning (2009)
Manifest types, modules, and separate compilation
symposium on principles of programming languages (1994)
Unboxed objects and polymorphic typing
symposium on principles of programming languages (1992)
A concurrent, generational garbage collector for a multithreaded implementation of ML
Damien Doligez;Xavier Leroy.
symposium on principles of programming languages (1993)
The ZINC experiment : an economical implementation of the ML language
A compiled implementation of strong reduction
Benjamin Grégoire;Xavier Leroy.
international conference on functional programming (2002)
Java Bytecode Verification: Algorithms and Formalizations
Journal of Automated Reasoning (2003)
Mechanized Semantics for the Clight Subset of the C Language
Sandrine Blazy;Xavier Leroy.
Journal of Automated Reasoning (2009)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: