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

Alice Dethise

dblp:204/9493 · also Arnaud Dethise · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
3since 2021 · last 2024
0000-0002-4606-0178ORCID · verified

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

Computer networks · 2 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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
2 papers
Hardware security and side channels · 36% Systems and software security · 36% Security and privacy of machine learning · 28%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%
Computer networks
1 paper
Network management and operations · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
GPUs and heterogeneous computing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
0.812024
Continuous Exact Explanations of Neural Networks · ICDM 2024
Machine learning › Trustworthy machine learning › interpretability
neural network interpretation
0.812024
Continuous Exact Explanations of Neural Networks · ICDM 2024
Systems and software security › trusted computing
software attestation
0.712023
SAGE: Software-based Attestation for GPU Execution · USENIX ATC 2023
Hardware security and side channels
trusted execution environments
0.712023
SAGE: Software-based Attestation for GPU Execution · USENIX ATC 2023
Network management and operations
network verification
0.512021
Analyzing Learning-Based Networked Systems with Formal Verification · INFOCOM 2021
Security and privacy of machine learning
adversarial robustness
0.512021
Analyzing Learning-Based Networked Systems with Formal Verification · INFOCOM 2021
GPUs and heterogeneous computing
GPU computing
0.212023
SAGE: Software-based Attestation for GPU Execution · USENIX ATC 2023

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

neural network verification · 1.0formal verification · 1.0piecewise-linear encoding · 0.8linear programming · 0.8
YearPublicationVenuePosition
2024 Continuous Exact Explanations of Neural Networks
abstract
Accurate explanations of how a trained neural network (NN) behaves are desirable for a wide range of labor-intensive activities, including troubleshooting, validation, and understanding performance issues or identifying biases. We address the problem of explaining feedforward piecewise NNs (such as CNNs with Relu) by breaking them down into their linear components. Automatic encoding of the NN structure into linear program constraints is used to extract continuous exact explanations, which help interpret model behavior over continuous regions, provide model descriptions that convey the importance of input features and answer model queries that analyze the feature contributions under user-defined constraints. Our examples show that we can extract explanations for NNs with a moderate number of layers without relying on approximations. We demonstrate that the high-level explanations can help understand the outputs of NNs and the comparative importance of features by observing the linear models. We also show how explaining continuous inputs prevents certain attacks that have been proposed against existing explainers.
Alice Dethise, Marco Canini
ICDM1
2023 SAGE: Software-based Attestation for GPU Execution
Andrei Ivanov, Benjamin Rothenberger, Alice Dethise, Marco Canini, Torsten Hoefler, Adrian Perrig
USENIX ATC3
2021 Analyzing Learning-Based Networked Systems with Formal Verification
abstract
As more applications of (deep) neural networks emerge in the computer networking domain, the correctness and predictability of a neural agent's behavior for corner case inputs are becoming crucial. Enabling the formal analysis of agents with nontrivial properties, we bridge between specifying intended high-level behavior and expressing low-level statements directly encoded into an efficient verification framework. Our results support that within minutes, one can establish the resilience of a neural network to adversarial attacks on its inputs, as well as formally prove properties that were previously relying on educated guesses. Finally, we also show how formal verification can help create an accurate visual representation of an agent behavior to perform visual inspection and improve its trustworthiness.
Alice Dethise, Marco Canini, Nina Narodytska
INFOCOM1
2018 Prelude: Ensuring Inter-Domain Loop-Freedom in SDN-Enabled Networks
abstract
Software-Defined eXchanges (SDXes) promise to improve the interdomain routing ecosystem through SDN deployment. Yet, the naïve deployment of SDN on the Internet raises concerns about the correctness of the interdomain data-plane. By allowing operators to deflect traffic from default BGP routes, SDN policies can create permanent forwarding loops that are not visible to the control-plane.
Alice Dethise, Marco Chiesa, Marco Canini
APNet1