week 9 -slicing and debugging

Question 1

What is a slice

Answer 1

slice - smallest subset of program that contains all statements that directly or indirctly influence the value or behaviour of a variable at a given point

Question 2

Inverse denominator

Answer 2

IDen(n): nodes that appear on all paths from n to program termination.

Question 3

Nearest inverse denominator

Answer 3

NIDen(n): the closest node to n among the nodes that appear on all paths from n to program termination.

Question 4

Influenced

Answer 4

Nodes that appear on at least one path from n to NIDen(n)

Question 5

delta debugging

Answer 5

Start with a failing test case C.
Divide C into n parts
𝐶1,𝐶2,…,𝐶𝑛

If there exists a part Cᵢ such that C \ Cᵢ still fails, remove Cᵢ and repeat with C \ Cᵢ.
If no such part exists, increase n (use smaller parts) and repeat.
Stop when no part can be removed without losing the failure; the result is a minimal failing test case.

Question 6

What is debugging

Answer 6

Debugging is the process of identifying, analyzing, and fixing defects or issues in a program.

Question 7

Debugging Process (TRAFFIC Method):

Answer 7

1. Track: Identify and understand the issue.
2. Reproduce: Ensure the bug can be consistently recreated.
3. Automate and Simplify: Minimize the test case to its simplest form.
4. Find: Locate the origin of the problem (where the defect starts).
5. Focus: Pinpoint the infected state or variables.
6. Isolate: Determine what causes the infection (chain of events).
7. Correct: Fix the issue and validate the solution