Combining dynamic slicing and mutation operators for ESL correction

Repinski, Urmas; Hantson, Hanno; Jenihhin, Maksim; Raik, Jaan; Ubar, Raimund; Guglielmo, Giuseppe Di; Pravadelli, Graziano; Fummi, Franco

doi:10.1109/ets.2012.6233020

Cited by 19 publications

(8 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mutations. The mutations used in AllRepair (and accordingly in FL-AllRepair) is a subset of the mutations used in [37]. We define two mutation levels, where level 1 contains only a subset of the mutations available in level 2.…”

Section: Resultsmentioning

confidence: 99%

“…In the literature there is also a wide range of techniques for automated program repair using formal methods [4,10,19,22,29,32,33,42]. Both [11] and [37] also use fault localization followed by applying mutations for repair. But, unlike this work, fault localization is applied only for the original program.…”

Section: Related Workmentioning

confidence: 99%

“…But, unlike this work, fault localization is applied only for the original program. Also, neither the Tarantula fault localization used in [11] nor the dynamic slicing used in [37] carries the guarantee of being a must fault localization. The tool MUT-APR [3] fixes binary operator faults in C programs, but only targets faults that require one line modification.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Must Fault Localization for Program Repair

Rothenberg

Grumberg

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This work is concerned with fault localization for automated program repair. We define a novel concept of a must location set. Intuitively, such a set includes at least one program location from every repair for a bug. Thus, it is impossible to fix the bug without changing at least one location from this set. A fault localization technique is considered a must algorithm if it returns a must location set for every buggy program and every bug in the program. We show that some traditional fault localization techniques are not must. We observe that the notion of must fault localization depends on the chosen repair scheme, which identifies the changes that can be applied to program statements as part of a repair. We develop a new algorithm for fault localization and prove that it is must with respect to commonly used schemes in automated program repair. We incorporate the new fault localization technique into an existing mutation-based program repair algorithm. We exploit it in order to prune the search space when a buggy mutated program has been generated. Our experiments show that must fault localization is able to significantly speed-up the repair process, without losing any of the potential repairs.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Must Fault Localization for Program Repair

Rothenberg

Grumberg

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…From another perspective, this is a particular case of rewriting this expression as x >= 2, which ends up being covered by the operator RelationalOperatorReplacement. The detection of these new patterns has implications regarding mutation-based repair techniques [20,21,22,23,24,25]. The candidate fixes for a faulty program are produced by applying mutation operators to suspicious parts of the source code.…”

Section: B Dataset Analysismentioning

confidence: 99%

On Understanding Contextual Changes of Failures

Ribeiro

Abreu

Saraiva

2021

2021 IEEE 21st International Conference on Software Quality, Reliability and Security (QRS)

View full text Add to dashboard Cite

Recent studies show that many real-world software faults are due to slight modifications (mutations) to the program. Thus, analyzing transformations made by a developer and associating them with well-known mutation operators can help pinpoint and repair the root cause of failures. This paper proposes a mutation operator inference technique: given the original program and one of its subsequent forms, it infers which mutation operators would transform the original and produce such a version. Moreover, we implemented this technique as a tool called Morpheus, which analyzes faulty Java programs. We have also validated both the technique and tool by analyzing a repository with 1753 modifications for 20 different programs, successfully inferring mutation operators 78% of times. Furthermore, we also show that several program versions result from not just a single mutation operator but multiple ones. In the end, we resort to real-world case studies to demonstrate the advantages of this approach regarding program repair.

show abstract

“…Dynamic slicing technique is used in [19], [20]. The former uses dynamic slicing for statistical bug localization in RTL.…”

Section: Related Workmentioning

confidence: 99%

Accelerating Transient Fault Injection Campaigns by using Dynamic HDL Slicing

Bagbaba

Jenihhin

Raik

et al. 2019

2019 IEEE Nordic Circuits and Systems Conference (NORCAS): NORCHIP and International Symposium of System-on-Chip (SoC)

Self Cite

View full text Add to dashboard Cite

Along with the complexity of electronic systems for safety-critical applications, the cost of safety mechanisms evaluation by fault injection simulation is rapidly going up. To reduce these efforts, we propose a fault injection methodology where Hardware Description Language (HDL) code slicing is exploited to accelerate transient fault injection campaigns by pruning fault lists and reducing the number of the injections. In particular, the dynamic HDL slicing technique provides for a critical fault list and allows avoiding injections at non-critical time-steps. Experimental results on an industrial core show that the proposed methodology can successfully reduce the number of injections by up to 10 percent and speed-up the fault injection campaigns.

show abstract

Combining dynamic slicing and mutation operators for ESL correction

Cited by 19 publications

References 19 publications

Must Fault Localization for Program Repair

Must Fault Localization for Program Repair

On Understanding Contextual Changes of Failures

Accelerating Transient Fault Injection Campaigns by using Dynamic HDL Slicing

Contact Info

Product

Resources

About