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

Angelica Aparecida Moreira

dblp:119/0296 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0000-0001-5256-2054ORCID · reported

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

Software engineering, systems software and programming languages · 3 · 1 first-author · 3 since 2021Systems, architecture and hardware · 1 · 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.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Performance modeling and evaluation · 60% Cloud and datacenter computing · 40%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
1.012026
Wax: Optimizing Data Center Applications With Stale Profile · ASPLOS (2) 2026
Performance modeling and evaluation › performance tuning
profile-guided optimization
1.012026
Wax: Optimizing Data Center Applications With Stale Profile · ASPLOS (2) 2026
Compilers and program optimization
binary optimization
0.512021
VESPA: static profiling for binary optimization · Proc. ACM Program. Lang. 2021
Performance modeling and evaluation
profiling
0.512021
VESPA: static profiling for binary optimization · Proc. ACM Program. Lang. 2021
Compilers and program optimization › dynamic optimization
profile-guided optimization
0.112021
VESPA: static profiling for binary optimization · Proc. ACM Program. Lang. 2021

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

static analysis · 1.0stale profile analysis · 1.0regression model · 1.0
YearPublicationVenuePosition
2026 Wax: Optimizing Data Center Applications With Stale Profile
Tawhid Bhuiyan, Sumya Hoque, Angelica Aparecida Moreira, Tanvir Ahmed Khan 0001
ASPLOS (2)3
2026 Automatic Propagation of Profile Information through the Optimization Pipeline
abstract
Profile-guided optimization (PGO) is a well-established technique for improving program performance, being integrated into major compilers such as GCC, LLVM/Clang, and Microsoft Visual C++. PGO collects information about a program’s execution and uses it to guide optimizations such as inlining, and code layout. However, these very transformations alter the program’s control flow, rendering the collected profiles stale or inaccurate. To deal with this problem, this paper investigates how to reuse profile data after optimization without re-executing the program. We study two complementary strategies: prediction, which estimates likely hot code paths in the optimized program, and projection, which transfers profile information from the original control-flow graph to its transformed version. We evaluate several techniques for reconstructing profile data, including a large language model (LLM)–based approach using GPT-4o, and a lightweight method that compares opcode histograms of code regions recursively to identify structural similarities. Our results show that the histogram-based method is not only simpler but also consistently more accurate than both the LLM-based approach and prior prediction and projection techniques, including those implemented in LLVM and the BOLT binary optimizer.
Elisa Fröhlich, Angelica Aparecida Moreira, Fernando Magno Quintão Pereira
Proc. ACM Program. Lang.2
2021 VESPA: static profiling for binary optimization
abstract
Over the past few years, there has been a surge in the popularity of binary optimizers such as BOLT, Propeller, Janus and HALO. These tools use dynamic profiling information to make optimization decisions. Although effective, gathering runtime data presents developers with inconveniences such as unrepresentative inputs, the need to accommodate software modifications, and longer build times. In this paper, we revisit the static profiling technique proposed by Calder et al. in the late 90’s, and investigate its application to drive binary optimizations, in the context of the BOLT binary optimizer, as a replacement for dynamic profiling. A few core modifications to Calder et al.’s original proposal, consisting of new program features and a new regression model, are sufficient to enable some of the gains obtained through runtime profiling. An evaluation of BOLT powered by our static profiler on four large benchmarks (clang, GCC, MySQL and PostgreSQL) yields binaries that are 5.47 % faster than the executables produced by clang -O3.
Angelica Aparecida Moreira, Guilherme Ottoni, Fernando Magno Quintão Pereira
Proc. ACM Program. Lang.1