Program Repair Suggestions from Graphical State-Transition Specifications

Wang, Farn; Cheng, Chih-Hong

doi:10.1007/978-3-540-68855-6_12

Cited by 6 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fisher et al [138] also perform repair on a toy formal language. Wang and Cheng [181] state program repair as edit sequences on state machines. Zhang and Ding [195] repair computation tree logic models.…”

Section: Theoretical Software Repairmentioning

confidence: 99%

Automatic Software Repair

2018

View full text Add to dashboard Cite

This article presents a survey on automatic software repair. Automatic software repair consists of automatically finding a solution to software bugs, without human intervention. This article considers all kinds of repair. First, it discusses behavioral repair where test-suites, contracts, models, crashing inputs are taken as oracle. Second, it discusses state repair, also known as runtime repair or runtime recovery, with techniques such as checkpoint and restart, reconfiguration, invariant restoration. The uniqueness of this article is that it spans the research communities that contribute to this body of knowledge: software engineering, dependability, operating systems, programming languages and security. It provides a novel and structured overview of the diversity of bug oracles and repair operators used in the literature.

show abstract

Section: Theoretical Software Repairmentioning

confidence: 99%

Automatic Software Repair

2018

View full text Add to dashboard Cite

show abstract

“…Moreover, it was limited to data structures and did not address a broad range of logical errors. Cheng and Wang represented the program models and its specification as state transition graphs and proposed a heuristic for suggesting low-cost repairs to the programmer [49]. Bradbury et al in 2010 presented an approach to repair concurrency bugs [17].…”

Section: Program Repairmentioning

confidence: 99%

Automated program repair using genetic programming and model checking

2016

View full text Add to dashboard Cite

Automated program repair is still a highly challenging problem mainly due to the reliance of the current techniques on test cases to validate candidate patches. This leads to the increasing unreliability of the final patches since test cases are partial specifications of the software. In the present paper, an automated program repair method is proposed by integrating genetic programming (GP) and model checking (MC). Due to its capabilities to verify the finite state systems, MC is employed as an appropriate criterion for evolving programs to calculate the fitness in GP. The application of MC for the fitness evaluation, which is novel in the context of program repair, addresses an important gap in the current heuristic approaches to the program repair. Being focused on fault detection based on the desired aspects, it enables the programmers to detect faults according to the definition of properties. Creating a general method, this characteristic can be effectively customized for different domains of application and the corresponding faults. Apart from various types of faults, the proposed method is capable of handling concurrency bugs which are not the case in many general repair methods. To evaluate the proposed method, it was implemented as a tool, named JBF, to repair Java programs. To meet the objectives of the study, some experiments were conducted in which certain programs with known bugs were automatically repaired by the JBF tool. The obtained results are encouraging and remarkably promising.

show abstract

“…Another line of research on program repair treats the repair as a search problem and applies innovative evolutionary algorithms [3], behavioral programming techniques [37] or other informal heuristics [52,1,53].…”

Section: Related Workmentioning

confidence: 99%

Abstract Model Repair

Chatzieleftheriou¹,

Bonakdarpour²,

Katsaros³

et al. 2015

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. Given a Kripke structure M and CTL formula φ, where M does not satisfy φ, the problem of Model Repair is to obtain a new model M such that M satisfies φ. Moreover, the changes made to M to derive M should be minimum with respect to all such M . As in model checking, state explosion can make it virtually impossible to carry out model repair on models with infinite or even large state spaces. In this paper, we present a framework for model repair that uses abstraction refinement to tackle state explosion. Our framework aims to repair Kripke Structure models based on a Kripke Modal Transition System abstraction and a 3-valued semantics for CTL. We introduce an abstract-model-repair algorithm for which we prove soundness and semi-completeness, and we study its complexity class. Moreover, a prototype implementation is presented to illustrate the practical utility of abstract-model-repair on an Automatic Door Opener system model and a model of the Andrew File System 1 protocol.

show abstract

Program Repair Suggestions from Graphical State-Transition Specifications

Cited by 6 publications

References 13 publications

Automatic Software Repair

Automatic Software Repair

Automated program repair using genetic programming and model checking

Abstract Model Repair

Contact Info

Product

Resources

About