NDLI logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Proceedings of the 10th International Workshop on Search-Based Software Testing (SBST '17)
  2. An analysis of the suitability of test-based patch acceptance criteria
Loading...

Please wait, while we are loading the content...

Search based software testing for Android
Inferring automatic test oracles
Searching for behavioural bugs with stateful test oracles in web crawlers
An analysis of the suitability of test-based patch acceptance criteria
An empirical evaluation of mutation and crossover operators for multi-objective uncertainty-wise test minimization
The use of automatic test data generation for genetic improvement in a live system
Java unit testing tool competition: fifth round
EvoSuite at the SBST 2017 tool competition
JTeXpert at the SBST 2017 tool competition
The evolutionary landscape of SBST: a 10 year perspective
Search-based testing and system testing: a marriage in heaven
Is search-based unit test generation research stuck in a local optimum?

Similar Documents

...
Pattern-based generation of test plans for open distributed processing systems

Article

...
An Analysis of Gradual Patch Application: A Better Explanation of Patch Acceptance

Article

...
Critical Analysis on the NHTSA Acceptance Criteria for In-Vehicle Electronic Devices

Article

...
Statistics Based Acceptance Criteria for Vibration Analysis and Maintenance Decision Making on Gearbox Application Test Rig

Article

...
A Critical Assessment of the Usp Dissolution Apparatus Suitability Test Criteria

...
GIS-based multi-criteria analysis for land use suitability assessment in City of Regina

Article

...
An Analysis of Test Items Based on the Criteria of Good Tests

Article

...
Strain-Based Acceptance Criteria for Inelastic Analysis

Article

...
On the Suitability of Vibration Acceptance Criteria of Process Pipework

Article

An analysis of the suitability of test-based patch acceptance criteria

Content Provider ACM Digital Library
Author Cornejo, César Aguirre, Nazareno Frias, Marcelo Godio, Ariel Regis, Germán Brida, Simón Gutiérrez Degiovanni, Renzo Zemín, Luciano
Abstract Program repair techniques attempt to fix programs by looking for patches within a search space of fix candidates. These techniques require a specification of the program to be repaired, used as an acceptance criterion for fix candidates, that often also plays an important role in guiding some search processes. Most tools use tests as specifications, which constitutes a risk, since the incompleteness of tests as specifications may lead one to obtain spurious repairs, that pass all tests but are in fact incorrect. This problem has been identified by various researchers, raising concerns about the validity of program fixes. More thorough studies have been proposed using different sets of tests for fix validation, and resorting to manual inspection, showing that while tools reduce their program fixing rate, they are still able to repair a significant number of cases. In this paper, we perform a different analysis of the suitability of tests as acceptance criteria for automated program fixes, by checking patches produced by automated repair tools using a bug-finding tool, as opposed to previous works that used tests or manual inspections. We develop a number of experiments in which faulty programs from a known benchmark are fed to the program repair tools GenProg, Angelix, AutoFix and Nopol, using test suites of varying quality and extension, including those accompanying the benchmark. We then check the produced patches against formal specifications using a bug-finding tool. Our results show that, in general, automated program repair tools are significantly more likely to accept a spurious program fix than producing an actual one, in the studied scenarios.
Starting Page 14
Ending Page 20
Page Count 7
File Format PDF
ISBN 9781538627891
DOI 10.1109/SBST.2017..12
Language English
Publisher Association for Computing Machinery (ACM)
Publisher Date 2017-05-20
Access Restriction Subscribed
Content Type Text
Resource Type Article
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...