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

Eric Camellini

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

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

Security and privacy · 1

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
Systems and software security · 100%
Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 100%

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

TopicWeightPapersLastEvidence papers
Systems and software security › vulnerability management › patch management
security patch identification
0.412020
SPIDER: Enabling Fast Patch Propagation In Related Software Repositories · SP 2020
Systems and software security
vulnerability management
0.412020
SPIDER: Enabling Fast Patch Propagation In Related Software Repositories · SP 2020
Software maintenance and evolution › software updates
patch management
0.412020
SPIDER: Enabling Fast Patch Propagation In Related Software Repositories · SP 2020
Software maintenance and evolution
software ecosystems
0.112020
SPIDER: Enabling Fast Patch Propagation In Related Software Repositories · SP 2020

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

source code analysis · 0.9patch analysis · 0.9
YearPublicationVenuePosition
2020 SPIDER: Enabling Fast Patch Propagation In Related Software Repositories
abstract
Despite the effort of software maintainers, patches to open-source repositories are propagated from the main codebase to all the related projects (e.g., forks) with a significant delay. Previous work shows that this is true also for security patches, which represents a critical problem. Vulnerability databases, such as the CVE database, were born to speed-up the application of critical patches; however, patches associated with CVE entries (i.e., CVE patches) are still applied with a delay, and some security fixes lack the corresponding CVE entries. Because of this, project maintainers could miss security patches when upgrading software.In this paper, we are the first to define safe patches (sps). An sp is a patch that does not disrupt the intended functionality of the program (on valid inputs), meaning that it can be applied with no testing; we argue that most security fixes fall into this category. Furthermore, we show a technique to identify sps, and implement SPIDER1, a tool based on such a technique that works by analyzing the source code of the original and patched versions of a file. We performed a large-scale evaluation on 341,767 patches from 32 large and popular source code repositories as well as on 809 CVE patches. Results show that SPIDER was able to identify 67,408 sps and that most of the CVE patches are sps. In addition, SPIDER identified 2,278 patches that fix vulnerabilities lacking a CVE; 229 of these are still unpatched in different vendor kernels, which can be considered as potential unfixed vulnerabilities.
Aravind Machiry, Nilo Redini, Eric Camellini, Christopher Krügel, Giovanni Vigna
SP3