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

Antonin Reitz

dblp:372/2543 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
0009-0003-2823-9670ORCID · reported

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

Software engineering, systems software and programming languages · 1 · 1 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
Operating systems · 67% Program verification · 33%
Network and information security
1 paper
Systems and software security · 100%

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

TopicWeightPapersLastEvidence papers
Operating systems › resource management › memory management
dynamic memory allocation
0.812024
StarMalloc: Verifying a Modern, Hardened Memory Allocator · Proc. ACM Program. Lang. 2024
Operating systems › resource management
memory management
0.812024
StarMalloc: Verifying a Modern, Hardened Memory Allocator · Proc. ACM Program. Lang. 2024
Program verification › program logic
separation logic
0.812024
StarMalloc: Verifying a Modern, Hardened Memory Allocator · Proc. ACM Program. Lang. 2024
Systems and software security
memory safety
0.212024
StarMalloc: Verifying a Modern, Hardened Memory Allocator · Proc. ACM Program. Lang. 2024

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

steel separation logic · 1.5dependent types · 1.5SMT · 1.5
YearPublicationVenuePosition
2024 StarMalloc: Verifying a Modern, Hardened Memory Allocator
abstract
We present StarMalloc, a verified, efficient, security-oriented, and concurrent memory allocator. Using the Steel separation logic framework, we show how to specify and verify a multitude of low-level patterns and delicate security mechanisms, by relying on a combination of dependent types, SMT, and modular abstractions to enable efficient verification. We produce a verified artifact, in C, that implements the entire API surface of an allocator, and as such works as a drop-in replacement for real-world projects, notably the Firefox browser. As part of StarMalloc, we develop several generic datastructures and proof libraries directly reusable in future systems verification projects. We also extend the Steel toolchain to express several low-level idioms that were previously missing. Finally, we show that StarMalloc exhibits competitive performance by evaluating it against 10 state-of-the-art memory allocators, and against a variety of real-world projects, such as Redis, the Lean compiler, and the Z3 SMT solver.
Antonin Reitz, Aymeric Fromherz, Jonathan Protzenko
Proc. ACM Program. Lang.1