Does Testing Help to Reduce the Number of Potentially Faulty Statements in Debugging?

Nica, Mihai; Nica, Simona Alina; Wotawa, Franz

doi:10.1007/978-3-642-15585-7_9

Cited by 12 publications

(10 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the worst case computing even a single solution can be exponential in the size of the constraint system. However, other experiments, e.g., the one published in [33], [30], [32], showed that Minion is not the bottleneck of computation. In particular with Minion constraint systems comprising thousands of variables and constraints can be solved up to a minute.…”

Section: Debugging Approachmentioning

confidence: 97%

See 1 more Smart Citation

On the Use of Constraints in Dynamic Slicing for Program Debugging

Wotawa

2011

2011 IEEE Fourth International Conference on Software Testing, Verification and Validation Workshops

Self Cite

View full text Add to dashboard Cite

During the past decades research in automated debugging has led to several approaches. Some of them are based on structural and some of them on behavioral characteristics of the source code. The quality of the obtained results in terms of computed fault candidates compared to the overall number of statement usually is better when considering the program's behavior or even more sophisticated models representing the structure and the semantics of the program. However, for larger programs such approaches are not feasible and more light-weighted techniques have to be used in order to keep running time as small as possible. In this paper, we introduce an approach that combines dynamic slicing with constraint computation in order to increase the debugging quality while retaining small computational footprint. Using the presented approach it was possible to remove all fault candidates except the correct root cause for a particular program.

show abstract

Section: Debugging Approachmentioning

confidence: 97%

“…We now discuss these steps in detail using the execution trace from Figure 4. Similar conversions for whole programs are used elsewhere, e.g., [30].…”

Section: B Representing Execution Traces As Constraintsmentioning

confidence: 99%

On the Use of Constraints in Dynamic Slicing for Program Debugging

Wotawa

2011

2011 IEEE Fourth International Conference on Software Testing, Verification and Validation Workshops

Self Cite

View full text Add to dashboard Cite

show abstract

“…E.g., in [6] the authors use model based mutation testing in order to derive distinguishing test cases from contract mutations. The authors of [7] propose a method to reduce the number of diagnoses in case of fault localization by obtaining distinguishing test cases from mutants. In [4] the authors use constraint programming for generating distinguishing test cases.…”

Section: Achievementsmentioning

confidence: 99%

On the Improvement of the Mutation Score Using Distinguishing Test Cases

Nica

2011

2011 Fourth IEEE International Conference on Software Testing, Verification and Validation

Self Cite

View full text Add to dashboard Cite

Software testing, i.e., discovering software failures through test case execution, plays a crucial role in the software development process. A high quality software must have a strong test suite. Therefore it is of high importance for a software to evaluate the test suite that is asserting its correctness. Mutation testing is one efficient method to evaluate the process of software testing, i.e., the quality of the test suite.The current research focuses on mutation testing as a metric that can be used not only for establishing a reliable testing process, but also for improving the test case generation process, when the quality of the test suite is proven to be unsatisfactory. More over we aim to come with a solution to the equivalent mutant problem, by combing mutation testing and constraint systems.

show abstract

“…Because of space limitations we illustrate the approach using a small example program and do not introduce the underlying definitions. We refer the interested reader to other publications [1]- [3].…”

Section: Introductionmentioning

confidence: 99%

Open Research Challenges of Localizing Faults in Programs Using Constraints

Wotawa

2012

2012 IEEE Fifth International Conference on Software Testing, Verification and Validation

Self Cite

View full text Add to dashboard Cite

Automated debugging, i.e., localizing faults in programs automatically using a failing test case and the source code, is still and open research topic despite the fact that there have been many different techniques already published. In this paper we focus on constraints for debugging. Constraints cannot only be effectively used for verification and testing, but also provide a foundation for automated fault localization. We briefly discuss the basic idea of constraint based debugging and outline some of the most important challenges.

show abstract

Does Testing Help to Reduce the Number of Potentially Faulty Statements in Debugging?

Cited by 12 publications

References 10 publications

On the Use of Constraints in Dynamic Slicing for Program Debugging

On the Use of Constraints in Dynamic Slicing for Program Debugging

On the Improvement of the Mutation Score Using Distinguishing Test Cases

Open Research Challenges of Localizing Faults in Programs Using Constraints

Contact Info

Product

Resources

About