User Interface Design Testing Technique Interface design focuses

User Interface Design & Testing Technique

Interface design focuses on three areas of concern: (1) the design of inter-faces between software components, (2) the design of interfaces between the software and other nonhuman producers and consumers of information (i. e. , other external entities), and (3) the design of the interface between a human (i. e. , the user) and the computer. In this chapter we focus exclusively on the third interface design category— user interface design.

USER INTERFACE DESIGN n INTERFACE DESIGN ACTIVITIES Establish the goals 5 and intentions for each task. n Map each goal and intention to a sequence of specific actions. n Specify the action sequence of tasks and subtasks, also called a user scenario, as it will be executed at the interface level. n

USER INTERFACE DESIGN n INTERFACE DESIGN ACTIVITIES Indicate the state of the system; that is, what does the interface look like at the time that a user scenario is performed? n Define control mechanisms; that is, the objects and actions available to the user to alter the system state. n Show control mechanisms affect the state of the system. n

USER INTERFACE DESIGN n INTERFACE DESIGN ACTIVITIES n Indicate how the user interprets the state of the system from information provided through the interface.

USER INTERFACE DESIGN n DESIGN EVALUATION n After the design model has been completed, a first-level prototype is created. The prototype is evaluated by the user, who provides the designer with direct comments about the efficacy of the interface. In addition, if formal evaluation techniques are used (e. g. , questionnaires, rating sheets), the

SOFTWTECHNIQUESA RE TEST n SOFTWARE TESTING FUNDAMENTALS n Software engineers are by their nature constructive people. Testing requires that the developer discard preconceived notions of the "correctness" of software just developed and overcome a conflict of interest that occurs when errors are

n Testing Objectives n states a number of rules that can serve well as testing objectives: 1. Testing is a process of executing a program with the intent of finding an error. 2. A good test case is one that has a high probability of finding an as-yetundiscovered error. 3. A successful test is one that uncovers an as-yet-undiscovered

n Testing Principles 1. All tests should be traceable to customer requirements. 2. Tests should be planned long before testing begins. 3. The Pareto principle applies to software testing. 4. Testing should begin “in the small” and progress toward testing “in the large. ”

n Testing Principles n Exhaustive testing is not possible.

n Testability n Software testability is simply how easily [a computer program] can be tested. Since testing is so profoundly difficult, it pays to know what can be done to streamline it. Some-times programmers are willing to do things that will help the testing process and a check-list of possible design points, features, etc. , can be useful in negotiating with them.

n TEST CASE DESIGN n Any engineered product (and most other things) can be tested in one of two ways: (1) Knowing the specified function that a product has been designed to perform, tests can be conducted that demonstrate each function is fully operational while at the same time searching for errors in each function; (2) knowing the internal workings of a product, tests can be conducted to ensure that "all gears mesh, " that is, internal operations are performed according to specifications and all internal components have been adequately exercised. The first test approach is called blackbox testing and the second, white-box testing.

n White-box testing of software is predicated on close examination of procedural detail. Logical paths through the software tested by providing test cases that exer-cise specific sets of conditions and/or loops. The "status of the program" may be examined at various points to determine if the expected or asserted status corre-sponds to the

n WHITE-BOX TESTING n glass-box testing n (1) guar-antee that all independent paths within a module have been exercised at least once, (2) exercise all logical decisions on their true and false sides, (3) execute all loops at their boundaries and within their operational bounds, and (4) exercise internal data structures to ensure their

WHITE-BOX TESTING Logic errors and incorrect assumptions are inversely proportional to the probability that a program path will be executed. n We often believe that a logical path is not likely to be executed when, in fact, it may be executed on a regular basis. n Typographical errors are random. n

BASIS PATH TESTING n 1 Flow Graph Notation n a simple notation for the represen-tation of control flow, called a flow graph (or program graph) must be introduced.

BASIS PATH TESTING n When compound conditions are encountered in a procedural design, the genera -tion of a flow graph becomes slightly more complicated. A compound condition occurs when one or more Boolean operators (logical OR, AND, NOR) is present in a

BASIS PATH TESTING n 2 Cyclomatic Complexity n a software metric that provides a quantitative measure of the logical complexity of a program. – the value computed for cyclomatic complexity defines the number of inde -pendent paths in the basis set of a program and provides us with an upper bound for the number of tests that must be conducted to ensure that

Cyclamate complexity graph, an independent path must move along at least one edge that has not been traversed before the path 1: 1 -11 is path 2: 1 -2 -3 -4 -5 -10 -1 -1 defined. For example, a set of path 3: 1 -2 -3 -6 -8 -9 -10 -1 independent paths the flow path 4: for 1 -2 -3 -6 -7 -9 -10 -1 Note that each new path introduces a new edge. The path graph illustrated n 1 -2 -3 -4 -5 -10 -1 -2 -3 -6 -8 -9 -10 -1 -

Cyclamate complexity 1. 2. The number of regions of the flow graph correspond to the cyclomatic com-plexity. yclomatic complexity, V(G), for =E-N+2 a flow. V(G) graph, G, is defined as where E is the number of flow graph edges, N is the numb

Cyclamate complexity 3. Cyclamate complexity, V(G), for a flow graph, G, is also V(G) = P + 1 defined as where P is the number of predicate nodes contained in the flow graph G.

Cyclamate complexity Ex. Referring once more to the flow graph in Figure 17. 2 B, the cyclomatic complexity can be computed using each of the algorithms just noted: 1. The flow graph has four regions. 2. V(G) = 11 edges -9 nodes + 2 = 4. 3. V(G) = 3 predicate nodes ANS+ 1 = 4.

CONTROL STRUCTURE TESTING n 1 Condition Testing n Condition testing is a test case design method that exercises the logical conditions contained in a program module. A simple condition is a Boolean variable or a rela-tional expression, possibly preceded with one NOT (¬)

CONTROL STRUCTURE TESTING n 2 Data Flow Testing n One simple data flow testing strategy is to require that every DU chain be covered at least once. We refer to this strategy as the DU testing strategy. It has been shown that DU testing does not

CONTROL STRUCTURE TESTING n 3 Loop Testing

SPECIALIZED n TESTING FOR SPECIALIZED ENVIRONMENTS, ARCHITECTURES, AND APPLICATIONS n In unique guidelines and approaches to testing are sometimes war-ranted. In this section we consider testing guidelines for specialized environments, architectures, and

SPECIALIZED n 1 Testing GUIs n components provided as part of GUI development environments, the creation of the user interface has become less time consuming and more precise. But, at the same time, the complexity of GUIs has grown, leading to more difficulty in the design and execution of test cases.

SPECIALIZED n 2 Testing of Client/Server Architectures n Client/server (C/S) architectures represent a significant challenge for software testers. The distributed nature of

SPECIALIZED n 3 Testing Documentation and Help Facilities n The term software testing conjures images of large numbers of test cases prepared to exercise computer programs and the data that they manipulate.

SPECIALIZED n 4 Testing for Real-Time Systems n The time-dependent, asynchronous nature of many real-time applications adds a new and potentially difficult element to the testing mix—

SUMMARY n Task testing. n The first step in the testing of real -time software is to test each task independently. That is, white-box and black-box tests are designed and executed for each task. Each task is executed independently during these tests. Task testing uncovers errors in logic and function but not timing or

SUMMARY n Behavioral testing. n Using system models created with CASE tools, it is pos-sible to simulate the behavior of a realtime system and examine its behavior as a consequence of external events. These analysis activities can serve as the basis for the design of test cases that are conducted when the real-time

SUMMARY n Intertask testing. n Once errors in individual tasks and in system behavior have been isolated, testing shifts to time-related errors. Asynchronous tasks that are known to communicate with one another are tested with different data rates and processing load to determine if intertask