Thomas Durieux

Thomas Durieux

Auto-generated profile, based on publicly available information

Thomas Durieux

Delft University of Technology, Delft, Netherlands

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 April 2016 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
Jifeng XuanJifeng Xuan
Jifeng Xuan
MMMatias Martinez
Matias Martinez
FDFavio DeMarco
Favio DeMarco
MCMaxime Clement
Maxime Clement
SMSebastian Lamelas Marcote
Sebastian Lamelas Marcote
MMMartin Monperrus
Martin Monperrus
We propose Nopol, an approach to automatic repair of buggy conditional statements (i.e., if-then-else statements). This approach takes a buggy program as well as a test suite as input and generates a patch with a conditional expression as output. The test suite is required to contain passing test cases to model the expected behavior of the program and at least one failing test case that reveals the bug to be repaired. The process of Nopol consists of three major phases. First, Nopol employs angelic fix localization to identify expected values of a condition during the test execution. Second, runtime trace collection is used to collect variables and their actual values, including primitive data types and objected-oriented features (e.g., nullness checks), to serve as building blocks for patch generation. Third, Nopol encodes these collected data into an instance of a Satisfiability Modulo Theory (SMT) problem; then a feasible solution to the SMT instance is translated back into a code patch. We evaluate Nopol on 22 real-world bugs (16 bugs with buggy if conditions and six bugs with missing preconditions) on two large open-source projects, namely Apache Commons Math and Apache Commons Lang. Empirical analysis on these bugs shows that our approach can effectively fix bugs with buggy if conditions and missing preconditions. We illustrate the capabilities and limitations of Nopol using case studies of real bug fixes.

25 October 2016 in Empirical Software Engineering
Verified
Journal Article
Closed access
PDF file
MMMatias Martinez
Matias Martinez
TDThomas Durieux
Thomas Durieux
RSRomain Sommerard
Romain Sommerard
Jifeng XuanJifeng Xuan
Jifeng Xuan
MMMartin Monperrus
Martin Monperrus

14 April 2024
Verified
Conference Paper
Open access
JSJune Sallou
June Sallou
TDThomas Durieux
Thomas Durieux
APAnnibale Panichella
Annibale Panichella
Large Language Models (LLMs) have gained considerable traction within the Software Engineering (SE) community, impacting various SE tasks from code completion to test generation, from program repair to code summarization. Despite their promise, researchers must still be careful as numerous intricate factors can influence the outcomes of experiments involving LLMs. This paper initiates an open discussion on potential threats to the validity of LLM-based research including issues such as closed-source models, possible data leakage between LLM training data and research evaluation, and the reproducibility of LLM-based findings. In response, this paper proposes a set of guidelines tailored for SE researchers and Language Model (LM) providers to mitigate these concerns. The implications of the guidelines are illustrated using existing good practices followed by LLM providers and a practical example for SE researchers in the context of test case generation.

12 August 2019
Verified
Conference Paper
Open access
TDThomas Durieux
Thomas Durieux
FMFernanda Madeiral
Fernanda Madeiral
MMMatias Martinez
Matias Martinez
RARui Abreu
Rui Abreu

1 March 2018
Verified
Conference Paper
Closed access
VSVictor Sobreira
Victor Sobreira
TDThomas Durieux
Thomas Durieux
FMFernanda Madeiral
Fernanda Madeiral
MMMartin Monperrus
Martin Monperrus
MMMarcelo de Almeida Maia
Marcelo de Almeida Maia
Well-designed and publicly available datasets of bugs are an invaluable asset to advance research fields such as fault localization and program repair as they allow directly and fairly comparison between competing techniques and also the replication of experiments. These datasets need to be deeply understood by researchers: the answer for questions like "which bugs can my technique handle?" and "for which bugs is my technique effective?" depends on the comprehension of properties related to bugs and their patches. However, such properties are usually not included in the datasets, and there is still no widely adopted methodology for characterizing bugs and patches. In this work, we deeply study 395 patches of the Defects4J dataset. Quantitative properties (patch size and spreading) were automatically extracted, whereas qualitative ones (repair actions and patterns) were manually extracted using a thematic analysis-based approach. We found that 1) the median size of Defects4J patches is four lines, and almost 30% of the patches contain only addition of lines; 2) 92% of the patches change only one file, and 38% has no spreading at all; 3) the top-3 most applied repair actions are addition of method calls, conditionals, and assignments, occurring in 77% of the patches; and 4) nine repair patterns were found for 95% of the patches, where the most prevalent, appearing in 43% of the patches, is on conditional blocks. These results are useful for researchers to perform advanced analysis on their techniques' results based on Defects4J. Moreover, our set of properties can be used to characterize and compare different bug datasets.

8 April 2021 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
HYHe Ye
He Ye
JGJian Gu
Jian Gu
MMMatias Martinez
Matias Martinez
TDThomas Durieux
Thomas Durieux
MMMartin Monperrus
Martin Monperrus
Automatic program repair (APR) aims to reduce the cost of manually fixing software defects. However, APR suffers from generating a multitude of overfitting patches, those patches that fail to correctly repair the defect beyond making the tests pass. This paper presents a novel overfitting patch detection system called ODS to assess the correctness of APR patches. ODS first statically compares a patched program and a buggy program in order to extract code features at the abstract syntax tree (AST) level, for the single programming language Java. Then, ODS uses supervised learning with the captured code features and patch correctness labels to automatically learn a probabilistic model. The learned ODS model can then finally be applied to classify new and unseen program repair patches. We conduct a large-scale experiment to evaluate the effectiveness of ODS on patch correctness classification based on 10,302 patches from Defects4J, Bugs.jar and Bears benchmarks. The empirical evaluation shows that ODS is able to correctly classify 71.9 percent of program repair patches from 26 projects, which improves the state-of-the-art. ODS is applicable in practice and can be employed as a post-processing procedure to classify the patches generated by different APR systems.