Testing Technology Glossary-E

• Edge. In a directed graph, the oriented connection between two nodes.
• End-to-end testing. Test activity aimed at proving the correct implementation of a required function at a level where the entire hardware/software chain involved in the execution of the function is available.
• Entry logical branch. An entry logical branch is one which has no predecessors, a situation which can occur only at the entrance (i.e., invocation point) of a module.
• Entry node. In a program directed graph, a node which has more than one out-way and zero in-ways. An entry node has an in-degree of zero and a non-zero out-degree.
• Environment Clause. A clause in the SMARTS ATS file that defines local environment variables that can be used as variables in the activation and evaluation clauses.
• Error. A difference between program behavior and specification that renders the program results unacceptable. See Defect.
• Essential edges. The set of paths that first include each edge which is on only one of the original set of paths.
• Essential logical branch. A logical branch of a program that exists on only one path. Hence, execution of an essential logical branch is required to obtain complete segment (branch) coverage.
• Essential paths. The set of paths that include one essential edge, that is an edge that lies on no other path.
• Evaluation clause. A clause in the SMARTS' ATS file that specifies how to assess the correctness of a test.
• Event synchronization. The process by which a playback (e.g. from CAPBAK/X or CAPBAK/MSW) is forced to wait until an menu opening is completed.
• Exception report. A METRIC report which identifies source code procedures that exceed a user-defined metric threshold.
• EXDIFF. The extended differencing system, a component of STW/Regression. EXDIFF compares two files and reports the difference between them, and it ignores difference that lie within a user-defined masked area.
• Executable statement. A statement in a module which is executable in the sense that it produces object code instructions. A non-executable statement is not the opposite: it may be a declaration. Only comments can be left out without affective program behaviour.
• Execution verifier. A system to analyze the execution-time behavior of a test object in terms of the level of testing coverage attained.
• Exit logical branch. An exit logical branch is one for which there are no successor logical branches. This occurs only when the consequence of the logical branch is an exit from the module.
• Exit node. In a directed graph, a node which has more than one in-way, but has zero out-ways. An exit node has an out-degree of zero and a non-zero in-degree.
• Exit structure. The exit structure of a program directed graph is the set of logical branches which, if executed, lead unalterably to termination of program flow without involving subsequent repetition of any logical branches.
• Explicit predicate. A program predicate whose formula is displayed explicitly in the program text. For example: a single conditional always involves an explicit program predicate. A predicate is implicit when it is not visible in the source code of the program. An example is a program exception, which can occur at any time.