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

Christophe Calvès

dblp:43/7012 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
0since 2021 · last 2014
—ORCID · none

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

Theory of computation · 5 · 5 first-authorSystems, architecture and hardware · 2Software engineering, systems software and programming languages · 2 · 1 first-author

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
Empirical software engineering · 49% Software testing · 35% Operating systems · 10%

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

TopicWeightPapersLastEvidence papers
Software testing
fault analysis
0.322014
Faults in Linux 2.6 · ACM Trans. Comput. Syst. 2014
Faults in linux: ten years later · ASPLOS 2011
Empirical software engineering
mining software repositories
0.322014
Faults in Linux 2.6 · ACM Trans. Comput. Syst. 2014
Faults in linux: ten years later · ASPLOS 2011
Empirical software engineering › software fault analysis
bug study
0.112011
Faults in linux: ten years later · ASPLOS 2011
Operating systems › kernel
linux kernel
0.122014
Faults in Linux 2.6 · ACM Trans. Comput. Syst. 2014
Faults in linux: ten years later · ASPLOS 2011
Program analysis
static analysis
0.112014
Faults in Linux 2.6 · ACM Trans. Comput. Syst. 2014

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

static analysis · 0.3
YearPublicationVenuePosition
2014 Faults in Linux 2.6
abstract
In August 2011, Linux entered its third decade. Ten years before, Chou et al. published a study of faults found by applying a static analyzer to Linux versions 1.0 through 2.4.1. A major result of their work was that the drivers directory contained up to 7 times more of certain kinds of faults than other directories. This result inspired numerous efforts on improving the reliability of driver code. Today, Linux is used in a wider range of environments, provides a wider range of services, and has adopted a new development and release model. What has been the impact of these changes on code quality? To answer this question, we have transported Chou et al.’s experiments to all versions of Linux 2.6; released between 2003 and 2011. We find that Linux has more than doubled in size during this period, but the number of faults per line of code has been decreasing. Moreover, the fault rate of drivers is now below that of other directories, such as arch. These results can guide further development and research efforts for the decade to come. To allow updating these results as Linux evolves, we define our experimental protocol and make our checkers available.
Nicolas Palix, Gaël Thomas 0001, Suman Saha 0002, Christophe Calvès, Gilles Muller, Julia Lawall
ACM Trans. Comput. Syst.4
2013 Unifying Nominal Unification
abstract
Nominal unification is proven to be quadratic in time and space. It was so by two different approaches, both inspired by the Paterson-Wegman linear unification algorithm, but dramatically different in the way nominal and first-order constraints are dealt with. To handle nominal constraints, Levy and Villaret introduced the notion of replacing while Calves and Fernandez use permutations and sets of atoms. To deal with structural constraints, the former use multi-equations in a way similar to the Martelli-Montanari algorithm while the later mimic Paterson-Wegman. In this paper we abstract over these two approaches and genralize them into the notion of modality, highlighting the general ideas behind nominal unification. We show that replacings and environments are in fact isomorphic. This isomorphism is of prime importance to prove intricate properties on both sides and a step further to the real complexity of nominal unification.
Christophe Calvès
RTA1
2011 Faults in linux: ten years later
abstract
In 2001, Chou et al. published a study of faults found by applying a static analyzer to Linux versions 1.0 through 2.4.1. A major result of their work was that the drivers directory contained up to 7 times more of certain kinds of faults than other directories. This result inspired a number of development and research efforts on improving the reliability of driver code. Today Linux is used in a much wider range of environments, provides a much wider range of services, and has adopted a new development and release model. What has been the impact of these changes on code quality? Are drivers still a major problem?
Nicolas Palix, Gaël Thomas 0001, Suman Saha 0002, Christophe Calvès, Julia Lawall, Gilles Muller
ASPLOS4
2010 The First-Order Nominal Link
Christophe Calvès, Maribel Fernández
LOPSTR1
2010 Matching and alpha-equivalence check for nominal terms
Christophe Calvès, Maribel Fernández
J. Comput. Syst. Sci.1
2008 Nominal Matching and Alpha-Equivalence
Christophe Calvès, Maribel Fernández
WoLLIC1
2008 A polynomial nominal unification algorithm
Christophe Calvès, Maribel Fernández
Theor. Comput. Sci.1