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.

Thomas Gassmann

dblp:415/4074 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0009-5249-2610ORCID · 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.

Network and information security
1 paper
Cryptographic protocols and secure computation · 100%
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
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
1.012026
Evaluating Compiler Optimization Impacts on zkVM Performance · ASPLOS (2) 2026
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
zero-knowledge virtual machine
1.012026
Evaluating Compiler Optimization Impacts on zkVM Performance · ASPLOS (2) 2026
Compilers and program optimization
compiler optimization
1.012026
Evaluating Compiler Optimization Impacts on zkVM Performance · ASPLOS (2) 2026
Cryptographic protocols and secure computation
verifiable computation
0.312026
Evaluating Compiler Optimization Impacts on zkVM Performance · ASPLOS (2) 2026

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

compiler optimization evaluation · 2.0
YearPublicationVenuePosition
2026 Evaluating Compiler Optimization Impacts on zkVM Performance
abstract
Zero-knowledge proofs (ZKPs) are the cornerstone of programmable cryptography. They enable (1) privacy-preserving and verifiable computation across blockchains, and (2) an expanding range of off-chain applications such as credential schemes. Zero-knowledge virtual machines (zkVMs) lower the barrier by turning ZKPs into a drop-in backend for standard compilation pipelines. This lets developers write proof-generating programs in conventional languages (e.g., Rust or C++) instead of hand-crafting arithmetic circuits. However, these VMs inherit compiler infrastructures tuned for traditional architectures rather than for proof systems. In particular, standard compiler optimizations assume features that are absent in zkVMs, including cache locality, branch prediction, or instruction-level parallelism. Therefore, their impact on proof generation is questionable.
Thomas Gassmann, Stefanos Chaliasos, Thodoris Sotiropoulos, Zhendong Su 0001
ASPLOS (2)1