Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Nathanaël Courant

dblp:197/9578 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2021
0000-0002-8736-3060ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 3 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization
code generation		 0.512021
Verified code generation for the polyhedral model · Proc. ACM Program. Lang. 2021
Compilers and program optimization
polyhedral model		 0.512021
Verified code generation for the polyhedral model · Proc. ACM Program. Lang. 2021
Compilers and program optimization › program transformation
semantics-preserving transformation		 0.512021
Verified code generation for the polyhedral model · Proc. ACM Program. Lang. 2021
Compilers and program optimization
verified compilation		 0.512021
Verified code generation for the polyhedral model · Proc. ACM Program. Lang. 2021

Methods — techniques the papers use, named apart from their topics

coq proof assistant · 0.5
YearPublicationVenuePosition
2021 Verified code generation for the polyhedral model
abstract
The polyhedral model is a high-level intermediate representation for loop nests that supports elegantly a great many loop optimizations. In a compiler, after polyhedral loop optimizations have been performed, it is necessary and difficult to regenerate sequential or parallel loop nests before continuing compilation. This paper reports on the formalization and proof of semantic preservation of such a code generator that produces sequential code from a polyhedral representation. The formalization and proofs are mechanized using the Coq proof assistant.
Nathanaël Courant, Xavier Leroy
 Proc. ACM Program. Lang.1
2020 The Correctness of a Code Generator for a Functional Language
Nathanaël Courant, Antoine Séré, Natarajan Shankar
 VMCAI1
2017 Precise Widening Operators for Proving Termination by Abstract Interpretation
Nathanaël Courant, Caterina Urban
 TACAS (1)1