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.

Fabian Ruffy

dblp:223/0452 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
4since 2021 · last 2024
0000-0003-1379-7277ORCID · corroborated

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

Computer networks · 5 · 2 first-author · 3 since 2021Software engineering, systems software and programming languages · 2 · 1 first-author · 1 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.

Software engineering, system software, and programming languages
2 papers
Software testing · 78% Compilers and program optimization · 22%
Computer networks
2 papers
Software-defined and programmable networks · 62% Network management and operations · 38%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%

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

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks
programmable data plane
1.122023
P4Testgen: An Extensible Test Oracle For P4-16 · SIGCOMM 2023
Gauntlet: Finding Bugs in Compilers for Programmable Packet Processing · OSDI 2020
Software testing
compiler testing
1.122023
NNSmith: Generating Diverse and Valid Test Cases for Deep Learning Compilers · ASPLOS (2) 2023
Gauntlet: Finding Bugs in Compilers for Programmable Packet Processing · OSDI 2020
Network management and operations
network verification
0.712023
P4Testgen: An Extensible Test Oracle For P4-16 · SIGCOMM 2023
Compilers and program optimization
deep learning compiler
0.712023
NNSmith: Generating Diverse and Valid Test Cases for Deep Learning Compilers · ASPLOS (2) 2023
Software testing
differential testing
0.712023
NNSmith: Generating Diverse and Valid Test Cases for Deep Learning Compilers · ASPLOS (2) 2023
Software testing
fuzzing
0.712023
NNSmith: Generating Diverse and Valid Test Cases for Deep Learning Compilers · ASPLOS (2) 2023

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

gradient-based search · 1.3fuzz testing · 1.3differential testing · 1.3taint tracking · 0.7concolic execution · 0.7
YearPublicationVenuePosition
2024 Incremental Specialization of Network Programs
abstract
Programmable network devices process packets using limited time and space. Consequently, much effort has been spent making network programs run as efficiently as possible. One promising line of work focuses on specializing the implementation of a network program to a particular---presumed constant---control-plane configuration. However, while some parts of the control plane configurations are constant for long periods of time, others change frequently, and in bursts (e.g., due to routing table updates).
Fabian Ruffy, Zhanghan Wang, Gianni Antichi, Aurojit Panda, Anirudh Sivaraman
HotNets1
2023 NNSmith: Generating Diverse and Valid Test Cases for Deep Learning Compilers
abstract
Deep-learning (DL) compilers such as TVM and TensorRT are increasingly being used to optimize deep neural network (DNN) models to meet performance, resource utilization and other requirements. Bugs in these compilers can result in models whose semantics differ from the original ones, producing incorrect results that corrupt the correctness of downstream applications. However, finding bugs in these compilers is challenging due to their complexity. In this work, we propose a new fuzz testing approach for finding bugs in deep-learning compilers. Our core approach consists of (i) generating diverse yet valid DNN test models that can exercise a large part of the compiler's transformation logic using light-weight operator specifications; (ii) performing gradient-based search to find model inputs that avoid any floating-point exceptional values during model execution, reducing the chance of missed bugs or false alarms; and (iii) using differential testing to identify bugs. We implemented this approach in NNSmith which has found 72 new bugs for TVM, TensorRT, ONNXRuntime, and PyTorch to date. Of these 58 have been confirmed and 51 have been fixed by their respective project maintainers.
Jiawei Liu 0004, Jinkun Lin, Fabian Ruffy, Cheng Tan 0005, Jinyang Li 0001, Aurojit Panda, Lingming Zhang 0001
ASPLOS (2)3
2023 P4Testgen: An Extensible Test Oracle For P4-16
abstract
We present P4Testgen, a test oracle for the P416 language. P4Testgen supports automatic test generation for any P4 target and is designed to be extensible to many P4 targets. It models the complete semantics of the target's packet-processing pipeline including the P4 language, architectures and externs, and target-specific extensions. To handle non-deterministic behaviors and complex externs (e.g., checksums and hash functions), P4Testgen uses taint tracking and concolic execution. It also provides path selection strategies that reduce the number of tests required to achieve full coverage.
Fabian Ruffy, Jed Liu, Prathima Kotikalapudi, Vojtech Havel, Hanneli Tavante, Rob Sherwood, Vladyslav Dubina, Vladimir S. Peschanenko, Anirudh Sivaraman, Nate Foster
SIGCOMM1
2021 Snicket: Query-Driven Distributed Tracing
abstract
Increasing application complexity has caused applications to be refactored into smaller components known as microservices that communicate with each other using RPCs. Distributed tracing has emerged as an important debugging tool for such microservice-based applications. Distributed tracing follows the journey of a user request from its starting point at the application's front-end, through RPC calls made by the front-end to different microservices recursively, all the way until a response is constructed and sent back to the user. To reduce storage costs, distributed tracing systems sample traces before collecting them for subsequent querying, affecting the accuracy of queries on the collected traces.
Jessica Berg, Fabian Ruffy, Khanh Nguyen 0001, Nicholas Yang, Anirudh Sivaraman, Ravi Netravali, Srinivas Narayana
HotNets2
2020 Gauntlet: Finding Bugs in Compilers for Programmable Packet Processing
Fabian Ruffy, Tao Wang 0088, Anirudh Sivaraman
OSDI1
2018 VNF chain allocation and management at data center scale
abstract
Recent advances in network function virtualization have prompted the research community to consider data-center-scale deployments. However, existing tools, such as E2 and SOL, limit VNF chain allocation to rack-scale and provide limited support for management of allocated chains.
Nodir Kodirov, Sam Bayless, Fabian Ruffy, Ivan Beschastnikh, Holger H. Hoos, Alan J. Hu
ANCS3
2018 VNF chain abstraction for cloud service providers
abstract
We propose VNF chain abstraction to decouple a tenant's view of the VNF chain from the cloud provider's implementation. We motivate the benefits of such an abstraction for the cloud provider as well as the tenants, and outline the challenges a cloud provider needs to address to make the chain abstraction practical. We describe the design requirements and report on our initial prototype.
Nodir Kodirov, Sam Bayless, Fabian Ruffy, Ivan Beschastnikh, Holger H. Hoos, Alan J. Hu
ANCS3