Testing Technology Glossary-C

• 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