Linear code sequence and jump

Its primary use is with dynamic software analysis to help answer the question "How much testing is enough?".

In a narrower sense, an LCSAJ is a well-defined linear region of a program's code.

The LCSAJ analysis method was devised by Professor Michael Hennell in order to perform quality assessments on the mathematical libraries on which his nuclear physics research at the University of Liverpool depended.

[citation needed] An LCSAJ is a software code path fragment consisting of a sequence of code (a linear code sequence) followed by a control flow Jump, and consists of the following three items:[6] Unlike (maximal) basic blocks, LCSAJs can overlap with each other because a jump (out) may occur in the middle of an LCSAJ, while it isn't allowed in the middle of a basic block.

)According to Jorgensen's 2013 textbook, outside Great Britain and ISTQB literature, the same notion is called DD-path.

[9][dubious – discuss] Coverage analysis metrics are used to gauge how much testing has been achieved.

[citation needed] One practical problem of using TER3 is that many LCSAJs can never be executed due to the conflicting conditions they contain.

For instance, LCSAJ 2 for the above example includes the while statement where the condition (count < ITERATIONS) evaluates to true.