| 1. |
|
|
| 2. |
- Danglot, Benjamin, et al.
(författare)
-
Correctness attraction : a study of stability of software behavior under runtime perturbation
- 2018
-
Ingår i: Empirical Software Engineering. - : Springer. - 1382-3256 .- 1573-7616. ; 23:4, s. 2086-2119
-
Tidskriftsartikel (refereegranskat)abstract
- Can the execution of software be perturbed without breaking the correctness of the output? In this paper, we devise a protocol to answer this question from a novel perspective. In an experimental study, we observe that many perturbations do not break the correctness in ten subject programs. We call this phenomenon “correctness attraction”. The uniqueness of this protocol is that it considers a systematic exploration of the perturbation space as well as perfect oracles to determine the correctness of the output. To this extent, our findings on the stability of software under execution perturbations have a level of validity that has never been reported before in the scarce related work. A qualitative manual analysis enables us to set up the first taxonomy ever of the reasons behind correctness attraction.
|
|
| 3. |
- Durieux, Thomas, et al.
(författare)
-
Exhaustive Exploration of the Failure-oblivious Computing Search Space
- 2018
-
Ingår i: 2018 IEEE 11TH INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION (ICST). - : IEEE Press. - 9781538650127 ; , s. 139-149
-
Konferensbidrag (refereegranskat)abstract
- High-availability of software systems requires automated handling of crashes in presence of errors. Failure-oblivious computing is one technique that aims to achieve high availability. We note that failure-obliviousness has not been studied in depth yet, and there is very few study that helps understand why failure-oblivious techniques work. In order to make failure-oblivious computing to have an impact in practice, we need to deeply understand failure-oblivious behaviors in software. In this paper, we study, design and perform an experiment that analyzes the size and the diversity of the failure-oblivious behaviors. Our experiment consists of exhaustively computing the search space of 16 field failures of large-scale open-source Java software. The outcome of this experiment is a much better understanding of what really happens when failure-oblivious computing is used, and this opens new promising research directions.
|
|
| 4. |
- Durieux, Thomas, et al.
(författare)
-
Fully Automated HTML and Javascript Rewriting for Constructing a Self-healing Web Proxy
- 2018
-
Ingår i: 2018 29TH IEEE INTERNATIONAL SYMPOSIUM ON SOFTWARE RELIABILITY ENGINEERING (ISSRE). - : IEEE. - 9781538683217 ; , s. 1-12
-
Konferensbidrag (refereegranskat)abstract
- Over the last few years, the complexity of web applications has increased to provide more dynamic web applications to users. The drawback of this complexity is the growing number of errors in the front-end applications. In this paper, we present BikiniProxy, a novel technique to provide self-healing for the web. BikiniProxy is designed as an HTTP proxy that uses five self-healing strategies to rewrite the buggy HTML and Javascript code. We evaluate BikiniProxy with a new benchmark of 555 reproducible Javascript errors of which 31.76% can be automatically self-healed.
|
|
| 5. |
- Martinez, M., et al.
(författare)
-
Ultra-large repair search space with automatically mined templates : The cardumen mode of astor
- 2018
-
Ingår i: 10th International Symposium on Search-Based Software Engineering, SSBSE 2018. - Cham : Springer. - 9783319992402 ; , s. 65-86
-
Konferensbidrag (refereegranskat)abstract
- Astor is a program repair library which has different modes. In this paper, we present the Cardumen mode of Astor, a repair approach based mined templates that has an ultra-large search space. We evaluate the capacity of Cardumen to discover test-suite adequate patches (aka plausible patches) over the 356 real bugs from Defects4J [11]. Cardumen finds 8935 patches over 77 bugs of Defects4J. This is the largest number of automatically synthesized patches ever reported, all patches being available in an open-science repository. Moreover, Cardumen identifies 8 unique patches, that are patches for Defects4J bugs that were never repaired in the whole history of program repair.
|
|
| 6. |
|
|
| 7. |
- Papoudakis, G., et al.
(författare)
-
A generative model for sparse, evolving digraphs
- 2018
-
Ingår i: 6th International Conference on Complex Networks and Their Applications, Complex Networks 2017. - Cham : Springer. - 9783319721491 ; , s. 531-542
-
Konferensbidrag (refereegranskat)abstract
- Generating graphs that are similar to real ones is an open problem, while the similarity notion is quite elusive and hard to formalize. In this paper, we focus on sparse digraphs and propose SDG, an algorithm that aims at generating graphs similar to real ones. Since real graphs are evolving and this evolution is important to study in order to understand the underlying dynamical system, we tackle the problem of generating series of graphs. We propose SEDGE, an algorithm meant to generate series of graphs similar to a real series. SEDGE is an extension of SDG. We consider graphs that are representations of software programs and show experimentally that our approach outperforms other existing approaches. Experiments show the performance of both algorithms.
|
|
| 8. |
- Sobreira, Victor, et al.
(författare)
-
Dissection of a bug dataset : Anatomy of 395 patches from Defects4J
- 2018
-
Ingår i: 25th IEEE International Conference on Software Analysis, Evolution and Reengineering, SANER 2018 - Proceedings. - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 130-140
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 9. |
- Urli, S., et al.
(författare)
-
How to design a program repair bot? : Insights from the repairnator project
- 2018
-
Ingår i: Proceeding ICSE-SEIP '18 Proceedings of the 40th International Conference on Software Engineering: Software Engineering in Practice. - New York, NY, USA : IEEE Computer Society. - 9781450356596 ; , s. 95-104
-
Konferensbidrag (refereegranskat)abstract
- Program repair research has made tremendous progress over the last few years, and software development bots are now being invented to help developers gain productivity. In this paper, we investigate the concept of a "program repair bot" and present Repairnator. The Repairnator bot is an autonomous agent that constantly monitors test failures, reproduces bugs, and runs program repair tools against each reproduced bug. If a patch is found, Repairnator bot reports it to the developers. At the time of writing, Repairnator uses three different program repair systems and has been operating since February 2017. In total, it has studied 11 523 test failures over 1 609 open-source software projects hosted on GitHub, and has generated patches for 15 different bugs. Over months, we hit a number of hard technical challenges and had to make various design and engineering decisions. This gives us a unique experience in this area. In this paper, we reflect upon Repairnator in order to share this knowledge with the automatic program repair community.
|
|
| 10. |
- Vera-Pérez, O. L., et al.
(författare)
-
Descartes : A pitest engine to detect pseudo-tested methods: Tool demonstration
- 2018
-
Ingår i: ASE 2018 - Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering. - New York, NY, USA : Association for Computing Machinery (ACM). ; , s. 908-911
-
Konferensbidrag (refereegranskat)abstract
- Descartes is a tool that implements extreme mutation operators and aims at finding pseudo-tested methods in Java projects. It leverages the efficient transformation and runtime features of PITest. The demonstration compares Descartes with Gregor, the default mutation engine provided by PITest, in a set of real open source projects. It considers the execution time, number of mutants created and the relationship between the mutation scores produced by both engines. It provides some insights on the main features exposed by Descartes.
|
|
