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

Tanvi Wagle

dblp:286/8162 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

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

Computer networks · 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.

Software engineering, system software, and programming languages
1 paper
Operating systems · 62% Program analysis · 19% Program verification · 19%
Computer networks
1 paper
Software-defined and programmable networks · 100%

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

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks
programmable data plane
0.512021
Synthesizing safe and efficient kernel extensions for packet processing · SIGCOMM 2021
Operating systems › extensible operating systems › kernel extensibility
kernel extensions
0.512021
Synthesizing safe and efficient kernel extensions for packet processing · SIGCOMM 2021
Program verification
safety verification
0.112021
Synthesizing safe and efficient kernel extensions for packet processing · SIGCOMM 2021
Program analysis
static analysis
0.112021
Synthesizing safe and efficient kernel extensions for packet processing · SIGCOMM 2021

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

static analysis · 1.0program synthesis · 1.0
YearPublicationVenuePosition
2021 Synthesizing safe and efficient kernel extensions for packet processing
abstract
Extended Berkeley Packet Filter (BPF) has emerged as a powerful method to extend packet-processing functionality in the Linux operating system. BPF allows users to write code in high-level languages (like C or Rust) and execute them at specific hooks in the kernel, such as the network device driver. To ensure safe execution of a user-developed BPF program in kernel context, Linux uses an in-kernel static checker. The checker allows a program to execute only if it can prove that the program is crash-free, always accesses memory within safe bounds, and avoids leaking kernel data.
Qiongwen Xu, Michael D. Wong, Tanvi Wagle, Srinivas Narayana, Anirudh Sivaraman
SIGCOMM3