Acceptance test. Formal tests conducted to determine whether or not a system satisfies its acceptance criteria and to enable the customer to determine whether or not to accept a system. This particular kind of testing is performed with the STW/Regression suite of tools. 
Action statement. A non-decision statement in a program that results in executable code. 
Activation clause. A clause in the SMARTS' ATS file which is comprised of the activation keyword and a sequence of system commands to be performed during test execution. 
Ada. The DoD standard programming language. 
Ancestor node. A node in a STW/Coverage directed graph that lies on some path (i.e., sequence of logical branches) that leads to the specified node. 
apg. All Paths Generator. A TCAT-PATH facility that generates equivalence classes that include all program paths from a directed graph. 
Arc. In a directed graph, the oriented connection between two nodes. This is also referred to as an edge. 
Archive file. A file generated from STW/Coverage's cover, scover or ctcover utility containing test trace information in reduced form. 
ASCII synchronization. The process by which a playback (e.g. from CAPBAK/X) holds back execution until a character string is located. 
ATS. A SMARTS user-designed description file which references a test suite. Test cases are referenced in a hierarchically organized structure and can be supplemented with activation commands comparison arguments, pass/fail evaluation criteria, and system commands. When SMARTS is run on either a X Window or UNIX system, the ATS is written in SMARTS' Description Language (which is similar to C language syntax). The ATS file is written in SMARTS C-Interpreter Language when SMARTS is run on a MS Windows system. 
AUT. Application-under-test. 
Automated Test Script. See ATS. 
Automatic flow control. When CAPBAK/UNIX is being run in terminal emulation record mode, a record of the manual flow control is stored in the keysave file and response file.When CAPBAK/UNIX is transmitting keys in playback mode the flow control is maintained by using the information saved in these files. 
Automated Test Script. See ATS. 
Automatic flow control. When CAPBAK/UNIX is being run in terminal emulation record mode, a record of the manual flow control is stored in the keysave file and response file.When CAPBAK/UNIX is transmitting keys in playback mode the flow control is maintained by using the information saved in these files. 

Acceptance test. Formal tests conducted to determine whether or not a system satisfies its acceptance criteria and to enable the customer to determine whether or not to accept a system. This particular kind of testing is performed with the STW/Regression suite of tools. 
Action statement. A non-decision statement in a program that results in executable code. 
Activation clause. A clause in the SMARTS' ATS file which is comprised of the activation keyword and a sequence of system commands to be performed during test execution. 
Ada. The DoD standard programming language. 
Ancestor node. A node in a STW/Coverage directed graph that lies on some path (i.e., sequence of logical branches) that leads to the specified node. 
apg. All Paths Generator. A TCAT-PATH facility that generates equivalence classes that include all program paths from a directed graph. 
Arc. In a directed graph, the oriented connection between two nodes. This is also referred to as an edge. 
Archive file. A file generated from STW/Coverage's cover, scover or ctcover utility containing test trace information in reduced form. 
ASCII synchronization. The process by which a playback (e.g. from CAPBAK/X) holds back execution until a character string is located. 
ATS. A SMARTS user-designed description file which references a test suite. Test cases are referenced in a hierarchically organized structure and can be supplemented with activation commands comparison arguments, pass/fail evaluation criteria, and system commands. When SMARTS is run on either a X Window or UNIX system, the ATS is written in SMARTS' Description Language (which is similar to C language syntax). The ATS file is written in SMARTS C-Interpreter Language when SMARTS is run on a MS Windows system. 
AUT. Application-under-test. 
Automated Test Script. See ATS. 
Automatic flow control. When CAPBAK/UNIX is being run in terminal emulation record mode, a record of the manual flow control is stored in the keysave file and response file.When CAPBAK/UNIX is transmitting keys in playback mode the flow control is maintained by using the information saved in these files. 
Automated Test Script. See ATS. 
Automatic flow control. When CAPBAK/UNIX is being run in terminal emulation record mode, a record of the manual flow control is stored in the keysave file and response file.When CAPBAK/UNIX is transmitting keys in playback mode the flow control is maintained by using the information saved in these files. 

Acceptance test. Formal tests conducted to determine whether or not a system satisfies its acceptance criteria and to enable the customer to determine whether or not to accept a system. This particular kind of testing is performed with the STW/Regression suite of tools. 
Action statement. A non-decision statement in a program that results in executable code. 
Activation clause. A clause in the SMARTS' ATS file which is comprised of the activation keyword and a sequence of system commands to be performed during test execution. 
Ada. The DoD standard programming language. 
Ancestor node. A node in a STW/Coverage directed graph that lies on some path (i.e., sequence of logical branches) that leads to the specified node. 
apg. All Paths Generator. A TCAT-PATH facility that generates equivalence classes that include all program paths from a directed graph. 
Arc. In a directed graph, the oriented connection between two nodes. This is also referred to as an edge. 
Archive file. A file generated from STW/Coverage's cover, scover or ctcover utility containing test trace information in reduced form. 
ASCII synchronization. The process by which a playback (e.g. from CAPBAK/X) holds back execution until a character string is located. 
ATS. A SMARTS user-designed description file which references a test suite. Test cases are referenced in a hierarchically organized structure and can be supplemented with activation commands comparison arguments, pass/fail evaluation criteria, and system commands. When SMARTS is run on either a X Window or UNIX system, the ATS is written in SMARTS' Description Language (which is similar to C language syntax). The ATS file is written in SMARTS C-Interpreter Language when SMARTS is run on a MS Windows system. 
AUT. Application-under-test. 
Automated Test Script. See ATS. 
Automatic flow control. When CAPBAK/UNIX is being run in terminal emulation record mode, a record of the manual flow control is stored in the keysave file and response file.When CAPBAK/UNIX is transmitting keys in playback mode the flow control is maintained by using the information saved in these files. 
Automated Test Script. See ATS. 
Automatic flow control. When CAPBAK/UNIX is being run in terminal emulation record mode, a record of the manual flow control is stored in the keysave file and response file.When CAPBAK/UNIX is transmitting keys in playback mode the flow control is maintained by using the information saved in these files. 

Back-to-back testing. For software subject to parallel implementation, back-to-back testing is the execution of a test on the similar implementations and comparing the results. 
Basis paths. The set of non-iterative paths. 
Black-Box testing. A test method where the tester views the program as a black box, that is the test is completely unconcerned about the internal behavior and structure of the program. Rather the tester is only interested in finding circumstances in which the program does not behave according to its specifications. Test data are derived solely from the specifications without taking advantage of knowledge of the internal structure of the program. Black-box testing is performed with the STW/Regression suite of tools. 
Bottom-up testing. Testing starts with lower level units. Driver units must be created for units not yet completed, each time a new higher level unit is added to those already tested. Again a set of units may be added to the software system at the time, and for enhancements the software system may be complete before the bottom up tests starts. The test plan must reflect the approach, though. The STW/Coverage suite of tools supports this type of testing. 
Built-in testing. Any hardware or software device which is part of an equipment, subsystem of system and which is used for the purpose of testing that equipment, subsystem or system. 
Byte mask. A differencing mask used by EXDIFF that specifies to disregard differences based on byte counts. 

Back-to-back testing. For software subject to parallel implementation, back-to-back testing is the execution of a test on the similar implementations and comparing the results. 
Basis paths. The set of non-iterative paths. 
Black-Box testing. A test method where the tester views the program as a black box, that is the test is completely unconcerned about the internal behavior and structure of the program. Rather the tester is only interested in finding circumstances in which the program does not behave according to its specifications. Test data are derived solely from the specifications without taking advantage of knowledge of the internal structure of the program. Black-box testing is performed with the STW/Regression suite of tools. 
Bottom-up testing. Testing starts with lower level units. Driver units must be created for units not yet completed, each time a new higher level unit is added to those already tested. Again a set of units may be added to the software system at the time, and for enhancements the software system may be complete before the bottom up tests starts. The test plan must reflect the approach, though. The STW/Coverage suite of tools supports this type of testing. 
Built-in testing. Any hardware or software device which is part of an equipment, subsystem of system and which is used for the purpose of testing that equipment, subsystem or system. 
Byte mask. A differencing mask used by EXDIFF that specifies to disregard differences based on byte counts. 

Back-to-back testing. For software subject to parallel implementation, back-to-back testing is the execution of a test on the similar implementations and comparing the results. 
Basis paths. The set of non-iterative paths. 
Black-Box testing. A test method where the tester views the program as a black box, that is the test is completely unconcerned about the internal behavior and structure of the program. Rather the tester is only interested in finding circumstances in which the program does not behave according to its specifications. Test data are derived solely from the specifications without taking advantage of knowledge of the internal structure of the program. Black-box testing is performed with the STW/Regression suite of tools. 
Bottom-up testing. Testing starts with lower level units. Driver units must be created for units not yet completed, each time a new higher level unit is added to those already tested. Again a set of units may be added to the software system at the time, and for enhancements the software system may be complete before the bottom up tests starts. The test plan must reflect the approach, though. The STW/Coverage suite of tools supports this type of testing. 
Built-in testing. Any hardware or software device which is part of an equipment, subsystem of system and which is used for the purpose of testing that equipment, subsystem or system. 
Byte mask. A differencing mask used by EXDIFF that specifies to disregard differences based on byte counts. 

C. The programming language C. ANSI standard and K&R C are normally grouped as one language. Certain extensions supported by popular C compilers are also included as normal C. 
C++. The C++ object oriented programming language. The current standard is ANSI C++ and/or AT&T C++. Both are supported by TCAT/C++. 
C0 coverage. The percentage of the total number of statements in a module that are exercised, divided by the total number of statements present in the module. 
C1 coverage. The percentage of logical branches exercised in a test as compared with the total number of logical branches known in a program. 
Call graph. The function call tree capability of S-TCAT. This utility show caller-callee relationship of a program. It helps the user to determine which function calls need to be tested further. 
Call pair. A connection between two functions in which one function "calls" (references) the other function. 
Coding rule. A rule that specifies a particular way in which a program is to be expressed. 
Coding style. A general measure of the programming nature of a system; abstractly, the way the programming language is used in a real system. 
Combinational flow. Combinational flow is represented by a sequence of logical branches with the property that no logical branch is repeated within the flow. 
Command mode. This mode of execution of keysave files allows the user to program the keysave file in order to do conditional execution based on system calls. The other mode of execution is Data Mode. Command mode is supported by CAPBAK/X, and CAPBAK/UNIX. 
Complexity. A relative measurement of the ``degree of internal complexity'' of a software system, expressed possibly in terms of some algorithmic complexity measure. 
Complexity report. This METRIC report lists all a source code program's encountered procedures and lists Software Science metrics (which are concerned with the "size" of software) and Cyclomatic Complexity measures (which are concerned with the flow of control within the program's code). This report is also referred to as a Full report. 
Component. A part of a software system smaller than the entire system but larger than an element. 
Conditional playback. Certain STW components incorporate a language that provides for logical operations to control behavior during test execution. E.g. a SMARTS test can involve use of the if or while constructs, as can a CAPBAK script. See also Playback programming. 
Configuration file. A file used to declare start-up time parameter values. Usually suffixed as *.rc. 
Connected directed graph. A directed graph is connected if there is at least one path from every entry node to every exit node. 
Control statement. A statement that involves some predicate operation. For example: an if statement or a while statement. 
correctness proof. A mathematical process which demonstrates the consistency between a set of assertions about a program and the properties of the program, when executed in a known environment. 
Coverage testing. Coverage testing is concerned with the degree to which test cases exercise or cover the logic (source code) of the software module or unit. It is also a measure of coverage of code lines, code branches and code branch combinations. 
Cross-reference. An indication, for a selected symbol, of where instances of that symbol lie in a software system. 
Ct coverage. The percentage of independently executable sub-trees of the hierarchical decomposition tree of a program that has been exercised, in terms of all of the possible sub-trees that can be executed for that program. 
Cumulative coverage. The test coverage attained by a set of several test runs. 
Cumulative report. This TCAT or S-TCAT report charts branch and/or call-pair coverage for the current test cumulatively, and for each module in the total system. 
Cycle. A sequence of logical branches that forms a closed loop, so that at least one node is repeated. 
Cyclomatic number. A number which assesses program complexity according to a program's flow of control. A program's flow of control is based on the number and arrangement of decision statements within the code. The cyclomatic number of a flow graph can be calculated as follows 

C. The programming language C. ANSI standard and K&R C are normally grouped as one language. Certain extensions supported by popular C compilers are also included as normal C. 
C++. The C++ object oriented programming language. The current standard is ANSI C++ and/or AT&T C++. Both are supported by TCAT/C++. 
C0 coverage. The percentage of the total number of statements in a module that are exercised, divided by the total number of statements present in the module. 
C1 coverage. The percentage of logical branches exercised in a test as compared with the total number of logical branches known in a program. 
Call graph. The function call tree capability of S-TCAT. This utility show caller-callee relationship of a program. It helps the user to determine which function calls need to be tested further. 
Call pair. A connection between two functions in which one function "calls" (references) the other function. 
Coding rule. A rule that specifies a particular way in which a program is to be expressed. 
Coding style. A general measure of the programming nature of a system; abstractly, the way the programming language is used in a real system. 
Combinational flow. Combinational flow is represented by a sequence of logical branches with the property that no logical branch is repeated within the flow. 
Command mode. This mode of execution of keysave files allows the user to program the keysave file in order to do conditional execution based on system calls. The other mode of execution is Data Mode. Command mode is supported by CAPBAK/X, and CAPBAK/UNIX. 
Complexity. A relative measurement of the ``degree of internal complexity'' of a software system, expressed possibly in terms of some algorithmic complexity measure. 
Complexity report. This METRIC report lists all a source code program's encountered procedures and lists Software Science metrics (which are concerned with the "size" of software) and Cyclomatic Complexity measures (which are concerned with the flow of control within the program's code). This report is also referred to as a Full report. 
Component. A part of a software system smaller than the entire system but larger than an element. 
Conditional playback. Certain STW components incorporate a language that provides for logical operations to control behavior during test execution. E.g. a SMARTS test can involve use of the if or while constructs, as can a CAPBAK script. See also Playback programming. 
Configuration file. A file used to declare start-up time parameter values. Usually suffixed as *.rc. 
Connected directed graph. A directed graph is connected if there is at least one path from every entry node to every exit node. 
Control statement. A statement that involves some predicate operation. For example: an if statement or a while statement. 
correctness proof. A mathematical process which demonstrates the consistency between a set of assertions about a program and the properties of the program, when executed in a known environment. 
Coverage testing. Coverage testing is concerned with the degree to which test cases exercise or cover the logic (source code) of the software module or unit. It is also a measure of coverage of code lines, code branches and code branch combinations. 
Cross-reference. An indication, for a selected symbol, of where instances of that symbol lie in a software system. 
Ct coverage. The percentage of independently executable sub-trees of the hierarchical decomposition tree of a program that has been exercised, in terms of all of the possible sub-trees that can be executed for that program. 
Cumulative coverage. The test coverage attained by a set of several test runs. 
Cumulative report. This TCAT or S-TCAT report charts branch and/or call-pair coverage for the current test cumulatively, and for each module in the total system. 
Cycle. A sequence of logical branches that forms a closed loop, so that at least one node is repeated. 
Cyclomatic number. A number which assesses program complexity according to a program's flow of control. A program's flow of control is based on the number and arrangement of decision statements within the code. The cyclomatic number of a flow graph can be calculated as follows 

Data Mode. In this mode of execution of keysave files, text is interpreted as saved keystrokes to be played back along with timing information which is inclosed in brackets. The Data mode is supported by CAPBAK/X and CAPBAK/UNIX. 
DD-path. See Logical branch. 
De-instrumentation. When certain parts of your code have already been tested, you can use TCAT's and S-TCAT's de-instrumentations utilities to exclude those parts from instrumentation. For large programs, this can save time. 
Debug. After testing has identified a defect, one "debugs" the software by making certain changes that repair the defect. 
Decision node. A node in the program directed graph which corresponds to a decision statement within the program. 
Decision statement. A decision statement in a module is one in which an evaluation of some predicate is made, which (potentially) affects the subsequent execution behavior of the module. 
Decision-to-decision path. See Logical branch. 
Decisional depth. The number of decisions that must take on a particular value prior to arriving at a specified logical branch. "The decisional depth for this logical branch is..." 
Defect. Any difference between program specifications and actual program behavior of any kind, whether critical or not. What is reported as causing any kind of software problem. 
Deficiency. See Defect. 
Delay multiplier. The multiplier used to expand or contract playback rates. 
Directed graph. A directed graph consists of a set of nodes which are interconnected with oriented arcs. An arbitrary directed graph may have many entry nodes and many exit nodes. A program directed graph has only one entry and one exit node. 
Dynamic analysis. A process of systematically demonstrating properties of programs by a series of constructed executions. The STW/Coverage suite of tools performs dynamic analysis. 
Dynamic call-tree display. An organic diagram showing modules and their call-pair structure, where the call-pairs are "animated" based on behavior of the instrumented program being tested. 
Dynamic directed graph display. An organic diagram showing the connection between logical branches in a program, where the logical branches are "animated" based on behavior of the instrumented program being tested. 


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.

Filter. A stage in a software process that attempts to identify defects so they can be removed. 
Filter Efficiency. The percentage of state-detectable defects vs. the actual average number of defects detected. Typical filter efficiencies range from 10% (not often of much practical use) to 90% (nothing is perfect)> 
Flow control. When a terminal emulation program establishes communications with a mainframe application, it establishes flow control to prevent characters being lost. In some cases the mainframe application (or cluster controller) locks out the keyboard. This prevents the user from typing ahead; however, when CAPBAK is being used to record terminal sessions, the user is expected to wait for a response from the mainframe. The user, thus, imposes manual flow control to prevent data from being lost in cases where the keyboard is not locked. When CAPBAK is being run in terminal emulation mode, a record of the manual flow control is stored in the keysave and response files. When CAPBAK is transmitting keys in playback, flow control is maintained by using the information saved in these files. See also Automatic flow control. 
Flow graph. The oriented diagram, composed with nodes and edges with arrows, the shows the flow of control in a program. Also called a flow chart or a directed graph. 
Formal parameter. For an invocable element of program text, the set of variable names which are assigned value or meaning outside of the program text. 
Full report. A METRIC report which indicates a set of metrics for each of the modules in a given source file. See also Complexity report. 
Function call. A reference by one program to another through the use of an independent procedure-call or functional-call method. Each function call is the ``tail'' of a caller-callee call-pair. 
Function Keys. During a recording session with CAPBAK/X or CAPBAK/MSW, you can issue commands via function keys (i.e. your F1 to F10 keyboard function keys). During a recording session, you can use the function keys to bring up the Hotkey window (see Hotkeywindow), add comments to the keysave file, select an image or window for or the entire screen, pause, resume or terminate the session. CAPBAK/X also has additional function keys that allow you to synchronize on a character string or extract characters froman image or the entire screen. During playback, function keys can be used to slow or to quicken the speed of playback, to insert or to append new keysave records into a keysave file, to pause, to resume or to terminate a playback session. 
Functional specifications. A set of behavioral and performance requirements which, in aggregate, determine the functional properties of a software system. 
Functional test cases. A set of test case data sets for software which are derived from structural test cases. 


Image synchronization. The process by which a playback (e.g. from CAPBAK/X and CAPBAK/MSW) holds back execution until the image or window is redrawn or found. 
In-degree. In a directed graph, the number of in-ways for a node. 
Incompatible logical branch. Two segments in one program are said to be incompatible if there is no logically feasible execution of the program which will permit both of them to be executed in the same test. See also Essential logical branch. 
Independent logical branch pair. A pair of logical branches is (sequentially) independent when there are no assignment actions along the first branch. This changes any of the variables used in the predicate of the second statement. 
Infeasible path. A logical branch sequence is logically impossible if there is no collection of setting of the input space relative to the first branch in the sequence, which permits the sequence to execute. 
Inspection/review. A process of systematically studying and inspecting programs in order to identify certain types of errors, usually accomplished by human rather than mechanical means. 
Instrumentation. The first step in analyzing test coverage, is to instrument the source code. Instrumentation modifies the source code so that special markers are positioned at every logical branch or call-pair or path. Later, during program execution of the instrumented source code, these markers will be tracked and counted to provide data for coverage reports. 
Integration Testing. Exposes faults during the process of integration of software components or software units and it is specifically aimed at exposing faults in their interactions. The integration approach could be either bottom-up (using drivers), top-down (using stubs) or a mixture of the two. The bottom up is the recommended approach. 
Interface. The informational boundary between two software systems, software system components, elements, or modules. 
Invocation point. The invocation point of a module is normally the first statement in the module. 
Invocation structure. The tree-like hierarchy that contains a link for invocation of one module by another within a software system. 
Iteration level. The level of iteration relative to the invocation of a module. A zero-level iteration characterizes flows with no iteration. A one-level iteration characterizes program flow which involves repetition of a zero-level flow. 

Image synchronization. The process by which a playback (e.g. from CAPBAK/X and CAPBAK/MSW) holds back execution until the image or window is redrawn or found. 
In-degree. In a directed graph, the number of in-ways for a node. 
Incompatible logical branch. Two segments in one program are said to be incompatible if there is no logically feasible execution of the program which will permit both of them to be executed in the same test. See also Essential logical branch. 
Independent logical branch pair. A pair of logical branches is (sequentially) independent when there are no assignment actions along the first branch. This changes any of the variables used in the predicate of the second statement. 
Infeasible path. A logical branch sequence is logically impossible if there is no collection of setting of the input space relative to the first branch in the sequence, which permits the sequence to execute. 
Inspection/review. A process of systematically studying and inspecting programs in order to identify certain types of errors, usually accomplished by human rather than mechanical means. 
Instrumentation. The first step in analyzing test coverage, is to instrument the source code. Instrumentation modifies the source code so that special markers are positioned at every logical branch or call-pair or path. Later, during program execution of the instrumented source code, these markers will be tracked and counted to provide data for coverage reports. 
Integration Testing. Exposes faults during the process of integration of software components or software units and it is specifically aimed at exposing faults in their interactions. The integration approach could be either bottom-up (using drivers), top-down (using stubs) or a mixture of the two. The bottom up is the recommended approach. 
Interface. The informational boundary between two software systems, software system components, elements, or modules. 
Invocation point. The invocation point of a module is normally the first statement in the module. 
Invocation structure. The tree-like hierarchy that contains a link for invocation of one module by another within a software system. 
Iteration level. The level of iteration relative to the invocation of a module. A zero-level iteration characterizes flows with no iteration. A one-level iteration characterizes program flow which involves repetition of a zero-level flow. 

Image synchronization. The process by which a playback (e.g. from CAPBAK/X and CAPBAK/MSW) holds back execution until the image or window is redrawn or found. 
In-degree. In a directed graph, the number of in-ways for a node. 
Incompatible logical branch. Two segments in one program are said to be incompatible if there is no logically feasible execution of the program which will permit both of them to be executed in the same test. See also Essential logical branch. 
Independent logical branch pair. A pair of logical branches is (sequentially) independent when there are no assignment actions along the first branch. This changes any of the variables used in the predicate of the second statement. 
Infeasible path. A logical branch sequence is logically impossible if there is no collection of setting of the input space relative to the first branch in the sequence, which permits the sequence to execute. 
Inspection/review. A process of systematically studying and inspecting programs in order to identify certain types of errors, usually accomplished by human rather than mechanical means. 
Instrumentation. The first step in analyzing test coverage, is to instrument the source code. Instrumentation modifies the source code so that special markers are positioned at every logical branch or call-pair or path. Later, during program execution of the instrumented source code, these markers will be tracked and counted to provide data for coverage reports. 
Integration Testing. Exposes faults during the process of integration of software components or software units and it is specifically aimed at exposing faults in their interactions. The integration approach could be either bottom-up (using drivers), top-down (using stubs) or a mixture of the two. The bottom up is the recommended approach. 
Interface. The informational boundary between two software systems, software system components, elements, or modules. 
Invocation point. The invocation point of a module is normally the first statement in the module. 
Invocation structure. The tree-like hierarchy that contains a link for invocation of one module by another within a software system. 
Iteration level. The level of iteration relative to the invocation of a module. A zero-level iteration characterizes flows with no iteration. A one-level iteration characterizes program flow which involves repetition of a zero-level flow. 

Image synchronization. The process by which a playback (e.g. from CAPBAK/X and CAPBAK/MSW) holds back execution until the image or window is redrawn or found. 
In-degree. In a directed graph, the number of in-ways for a node. 
Incompatible logical branch. Two segments in one program are said to be incompatible if there is no logically feasible execution of the program which will permit both of them to be executed in the same test. See also Essential logical branch. 
Independent logical branch pair. A pair of logical branches is (sequentially) independent when there are no assignment actions along the first branch. This changes any of the variables used in the predicate of the second statement. 
Infeasible path. A logical branch sequence is logically impossible if there is no collection of setting of the input space relative to the first branch in the sequence, which permits the sequence to execute. 
Inspection/review. A process of systematically studying and inspecting programs in order to identify certain types of errors, usually accomplished by human rather than mechanical means. 
Instrumentation. The first step in analyzing test coverage, is to instrument the source code. Instrumentation modifies the source code so that special markers are positioned at every logical branch or call-pair or path. Later, during program execution of the instrumented source code, these markers will be tracked and counted to provide data for coverage reports. 
Integration Testing. Exposes faults during the process of integration of software components or software units and it is specifically aimed at exposing faults in their interactions. The integration approach could be either bottom-up (using drivers), top-down (using stubs) or a mixture of the two. The bottom up is the recommended approach. 
Interface. The informational boundary between two software systems, software system components, elements, or modules. 
Invocation point. The invocation point of a module is normally the first statement in the module. 
Invocation structure. The tree-like hierarchy that contains a link for invocation of one module by another within a software system. 
Iteration level. The level of iteration relative to the invocation of a module. A zero-level iteration characterizes flows with no iteration. A one-level iteration characterizes program flow which involves repetition of a zero-level flow. 

Image synchronization. The process by which a playback (e.g. from CAPBAK/X and CAPBAK/MSW) holds back execution until the image or window is redrawn or found. 
In-degree. In a directed graph, the number of in-ways for a node. 
Incompatible logical branch. Two segments in one program are said to be incompatible if there is no logically feasible execution of the program which will permit both of them to be executed in the same test. See also Essential logical branch. 
Independent logical branch pair. A pair of logical branches is (sequentially) independent when there are no assignment actions along the first branch. This changes any of the variables used in the predicate of the second statement. 
Infeasible path. A logical branch sequence is logically impossible if there is no collection of setting of the input space relative to the first branch in the sequence, which permits the sequence to execute. 
Inspection/review. A process of systematically studying and inspecting programs in order to identify certain types of errors, usually accomplished by human rather than mechanical means. 
Instrumentation. The first step in analyzing test coverage, is to instrument the source code. Instrumentation modifies the source code so that special markers are positioned at every logical branch or call-pair or path. Later, during program execution of the instrumented source code, these markers will be tracked and counted to provide data for coverage reports. 
Integration Testing. Exposes faults during the process of integration of software components or software units and it is specifically aimed at exposing faults in their interactions. The integration approach could be either bottom-up (using drivers), top-down (using stubs) or a mixture of the two. The bottom up is the recommended approach. 
Interface. The informational boundary between two software systems, software system components, elements, or modules. 
Invocation point. The invocation point of a module is normally the first statement in the module. 
Invocation structure. The tree-like hierarchy that contains a link for invocation of one module by another within a software system. 
Iteration level. The level of iteration relative to the invocation of a module. A zero-level iteration characterizes flows with no iteration. A one-level iteration characterizes program flow which involves repetition of a zero-level flow. 

Image synchronization. The process by which a playback (e.g. from CAPBAK/X and CAPBAK/MSW) holds back execution until the image or window is redrawn or found. 
In-degree. In a directed graph, the number of in-ways for a node. 
Incompatible logical branch. Two segments in one program are said to be incompatible if there is no logically feasible execution of the program which will permit both of them to be executed in the same test. See also Essential logical branch. 
Independent logical branch pair. A pair of logical branches is (sequentially) independent when there are no assignment actions along the first branch. This changes any of the variables used in the predicate of the second statement. 
Infeasible path. A logical branch sequence is logically impossible if there is no collection of setting of the input space relative to the first branch in the sequence, which permits the sequence to execute. 
Inspection/review. A process of systematically studying and inspecting programs in order to identify certain types of errors, usually accomplished by human rather than mechanical means. 
Instrumentation. The first step in analyzing test coverage, is to instrument the source code. Instrumentation modifies the source code so that special markers are positioned at every logical branch or call-pair or path. Later, during program execution of the instrumented source code, these markers will be tracked and counted to provide data for coverage reports. 
Integration Testing. Exposes faults during the process of integration of software components or software units and it is specifically aimed at exposing faults in their interactions. The integration approach could be either bottom-up (using drivers), top-down (using stubs) or a mixture of the two. The bottom up is the recommended approach. 
Interface. The informational boundary between two software systems, software system components, elements, or modules. 
Invocation point. The invocation point of a module is normally the first statement in the module. 
Invocation structure. The tree-like hierarchy that contains a link for invocation of one module by another within a software system. 
Iteration level. The level of iteration relative to the invocation of a module. A zero-level iteration characterizes flows with no iteration. A one-level iteration characterizes program flow which involves repetition of a zero-level flow. 

Image synchronization. The process by which a playback (e.g. from CAPBAK/X and CAPBAK/MSW) holds back execution until the image or window is redrawn or found. 
In-degree. In a directed graph, the number of in-ways for a node. 
Incompatible logical branch. Two segments in one program are said to be incompatible if there is no logically feasible execution of the program which will permit both of them to be executed in the same test. See also Essential logical branch. 
Independent logical branch pair. A pair of logical branches is (sequentially) independent when there are no assignment actions along the first branch. This changes any of the variables used in the predicate of the second statement. 
Infeasible path. A logical branch sequence is logically impossible if there is no collection of setting of the input space relative to the first branch in the sequence, which permits the sequence to execute. 
Inspection/review. A process of systematically studying and inspecting programs in order to identify certain types of errors, usually accomplished by human rather than mechanical means. 
Instrumentation. The first step in analyzing test coverage, is to instrument the source code. Instrumentation modifies the source code so that special markers are positioned at every logical branch or call-pair or path. Later, during program execution of the instrumented source code, these markers will be tracked and counted to provide data for coverage reports. 
Integration Testing. Exposes faults during the process of integration of software components or software units and it is specifically aimed at exposing faults in their interactions. The integration approach could be either bottom-up (using drivers), top-down (using stubs) or a mixture of the two. The bottom up is the recommended approach. 
Interface. The informational boundary between two software systems, software system components, elements, or modules. 
Invocation point. The invocation point of a module is normally the first statement in the module. 
Invocation structure. The tree-like hierarchy that contains a link for invocation of one module by another within a software system. 
Iteration level. The level of iteration relative to the invocation of a module. A zero-level iteration characterizes flows with no iteration. A one-level iteration characterizes program flow which involves repetition of a zero-level flow. 

Image synchronization. The process by which a playback (e.g. from CAPBAK/X and CAPBAK/MSW) holds back execution until the image or window is redrawn or found. 
In-degree. In a directed graph, the number of in-ways for a node. 
Incompatible logical branch. Two segments in one program are said to be incompatible if there is no logically feasible execution of the program which will permit both of them to be executed in the same test. See also Essential logical branch. 
Independent logical branch pair. A pair of logical branches is (sequentially) independent when there are no assignment actions along the first branch. This changes any of the variables used in the predicate of the second statement. 
Infeasible path. A logical branch sequence is logically impossible if there is no collection of setting of the input space relative to the first branch in the sequence, which permits the sequence to execute. 
Inspection/review. A process of systematically studying and inspecting programs in order to identify certain types of errors, usually accomplished by human rather than mechanical means. 
Instrumentation. The first step in analyzing test coverage, is to instrument the source code. Instrumentation modifies the source code so that special markers are positioned at every logical branch or call-pair or path. Later, during program execution of the instrumented source code, these markers will be tracked and counted to provide data for coverage reports. 
Integration Testing. Exposes faults during the process of integration of software components or software units and it is specifically aimed at exposing faults in their interactions. The integration approach could be either bottom-up (using drivers), top-down (using stubs) or a mixture of the two. The bottom up is the recommended approach. 
Interface. The informational boundary between two software systems, software system components, elements, or modules. 
Invocation point. The invocation point of a module is normally the first statement in the module. 
Invocation structure. The tree-like hierarchy that contains a link for invocation of one module by another within a software system. 
Iteration level. The level of iteration relative to the invocation of a module. A zero-level iteration characterizes flows with no iteration. A one-level iteration characterizes program flow which involves repetition of a zero-level flow. 
