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

Tobias Landsberg

dblp:325/7925 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0002-9792-7667ORCID · reported

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

Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Software 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
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
compilation caching
0.912025
IRHash: Efficient Multi-Language Compiler Caching by IR-Level Hashing · USENIX ATC 2025
Compilers and program optimization
intermediate representation
0.312025
IRHash: Efficient Multi-Language Compiler Caching by IR-Level Hashing · USENIX ATC 2025

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

IR-level hashing · 0.9
YearPublicationVenuePosition
2025 IRHash: Efficient Multi-Language Compiler Caching by IR-Level Hashing
Tobias Landsberg, Johannes Grunenberg, Christian Dietrich 0001, Daniel Lohmann
USENIX ATC1
2022 TASTING: Reuse Test-case Execution by Global AST Hashing
abstract
We describe TASTING, an approach for efficiently selecting and reusing regression-test executions across program changes, branches, and variants in continuous integration settings. Instead of detecting changes between two variants of the software-under-test, TASTING recursively composes hashes of the defining elements with all their dependencies on AST-level at compile time into a semantic fingerprint of the test and its execution environment. This fingerprint is easy to store and remains stable across changes if the test’s run-time behavior is not affected. Thereby, we can reuse test results across the history, multiple branches, and static compile-time variants. We applied TASTING to three open-source projects (Zephyr, OpenSSL, FFmpeg). Over their development history, we can omit between 10 percent (FFmpeg) and 95 percent (Zephyr) of all test executions at a moderate increase in build time. Furthermore, TASTING enables even higher savings across multiple checkouts (e.g., forks, bra nches, clones) and static software variants. Over the first changes to 131 OpenSSL forks, TASTING avoids 56 percent redundant test executions; for the Zephyr test matrix (64 variants), we reduce the number of test executions by 94 percent.
Tobias Landsberg, Christian Dietrich 0001, Daniel Lohmann
ICSOFT1