SQA an der TU Kaiserslautern | Karteikarten & Zusammenfassungen

Lernmaterialien für SQA an der TU Kaiserslautern

Greife auf kostenlose Karteikarten, Zusammenfassungen, Übungsaufgaben und Altklausuren für deinen SQA Kurs an der TU Kaiserslautern zu.

TESTE DEIN WISSEN

Control Flow Testing

Modified condition/decision coverage

Lösung anzeigen
TESTE DEIN WISSEN

- requires test cases which demonstrate that every condition can influence the logical value of the overall decision independently of the other conditions
- The application of this method is required by the standard RTCA DO- 178C for flight critical software (level A)
- Basically the method aims at a test as extensive as possible with justifiable test costs

  • The relation between the number of conditions and the required test cases is linear
  •  For the test of a decision with n conditions at least n+1 test cases are required. The maximum number of test cases is 2n

- A complete modified condition/decision coverage causes a branch coverage on the object code level

- But: Not every branch coverage test on the object code level causes a complete modified condition/decision coverage

Lösung ausblenden
TESTE DEIN WISSEN

Data Flow Testing

All uses-test

Lösung anzeigen
TESTE DEIN WISSEN

All c-uses-test + All p-uses-test

Lösung ausblenden
TESTE DEIN WISSEN

Simple Condition Coverage

Lösung anzeigen
TESTE DEIN WISSEN

test of all simple conditions concerning true and false

Lösung ausblenden
TESTE DEIN WISSEN

Control Flow Testing

Minimal Multiple Condition Coverage

Lösung anzeigen
TESTE DEIN WISSEN

- Alle Bestandteile müssen einmal True oder false angenommen haben. 
- Demands that besides the simple conditions and the decision also all composite conditions are tested against true and false
- As decisions can be hierarchically structured it is useful to consider this structure during testing
- This condition coverage technique takes into account the structure of decisions in a better way than the methods presented above, as all nesting levels of a compound
decision are equally considered

Lösung ausblenden
TESTE DEIN WISSEN

Control Flow Testing

Multiple Condition Coverage

Lösung anzeigen
TESTE DEIN WISSEN

- The multiple condition coverage requires the test of all value combinations of the conditions

Lösung ausblenden
TESTE DEIN WISSEN

Control Flow Testing

Path Coverage


Lösung anzeigen
TESTE DEIN WISSEN

- Requires the execution of all different paths of the program to be tested


  • A path p is a sequence of nodes (i, n1,.., nm, j) in the control flow graph with the start node i and the end node j
Lösung ausblenden
TESTE DEIN WISSEN

Control Flow Testing

Structured Path Test and Boundary Interior Path Test

Lösung anzeigen
TESTE DEIN WISSEN
  • distinguishes only paths that execute a loop not more than k times. This avoids the explosion of the number of paths caused by loops
  • The structured path test with k=2 is called boundary interior coverage
  • The boundary interior coverage differentiates the three cases:
    • no loop execution
    • one loop execution
    •  at least two loop executions
      • (This is especially useful due to the possible interactions between variables before, in and after the loop)
Lösung ausblenden
TESTE DEIN WISSEN

Data Flow anomaly

Lösung anzeigen
TESTE DEIN WISSEN

x is defined: d (defined)

  • The variable x is assigned a value (e.g. x = 5;)

x is referenced: r (referenced)

  • The value of the variable x is read in a computation or in a decision, i.e., the value of x does not change (e.g. y = x + 1; or if (x > 0) ...)

x is undefined: u (undefined)

  • The value of the variable x is deleted (e.g., deletion of local variables within a function or procedure at its termination). At program start all variables are undefined

x is not used: e (empty)

  • The instruction of the node under consideration does not influence the variable x. x is not defined, referenced or undefined


Annomalien: 


type ur; 

  • the reference of a variable with undefined, random value

type dd

  • The first definition has no effect, as the value is always overwritten by the second definition. The data flow anomaly is of the

type du

  • The value assigned by the definition is not used, as it is immediately deleted afterwards. This data flow anomaly is of the 



Lösung ausblenden
TESTE DEIN WISSEN

Data Flow Testing

The all defs-criterion demands

Lösung anzeigen
TESTE DEIN WISSEN

That every definition (all defs) of a variable is used at least once in a computation or a predicate. The objective of an assignment to a variable is that this value is used somewhere once again. The tests have to be chosen in such a way that this is tested at least once for every assignment to every variable

Lösung ausblenden
TESTE DEIN WISSEN

Data Flow Testing

All p-uses-test

Lösung anzeigen
TESTE DEIN WISSEN

P-use: predicate use – the variable is used when making a decision (e.g. if b > 6).  


The all p-uses-test requires that every p-use that exists with respect to each definition is taken into account during testing

Lösung ausblenden
TESTE DEIN WISSEN

Data Flow Testing 

All c-uses-test

Lösung anzeigen
TESTE DEIN WISSEN

C-use: computation use – the variable is used in a computation (for example, b = 3 + d – with respect to the variable d).


The all c-uses-test requires that every c-use that exists with respect to each definition is taken into account during testing

Lösung ausblenden
TESTE DEIN WISSEN

Data Flow Testing

All c-uses / some p-uses-test resp. all p-uses / some c-uses-test

Lösung anzeigen
TESTE DEIN WISSEN

If no c-uses resp. p-uses exist for some variable definitions, it is required that at least one p-use resp. c-use is tested

Lösung ausblenden
  • 25887 Karteikarten
  • 703 Studierende
  • 76 Lernmaterialien

Beispielhafte Karteikarten für deinen SQA Kurs an der TU Kaiserslautern - von Kommilitonen auf StudySmarter erstellt!

Q:

Control Flow Testing

Modified condition/decision coverage

A:

- requires test cases which demonstrate that every condition can influence the logical value of the overall decision independently of the other conditions
- The application of this method is required by the standard RTCA DO- 178C for flight critical software (level A)
- Basically the method aims at a test as extensive as possible with justifiable test costs

  • The relation between the number of conditions and the required test cases is linear
  •  For the test of a decision with n conditions at least n+1 test cases are required. The maximum number of test cases is 2n

- A complete modified condition/decision coverage causes a branch coverage on the object code level

- But: Not every branch coverage test on the object code level causes a complete modified condition/decision coverage

Q:

Data Flow Testing

All uses-test

A:

All c-uses-test + All p-uses-test

Q:

Simple Condition Coverage

A:

test of all simple conditions concerning true and false

Q:

Control Flow Testing

Minimal Multiple Condition Coverage

A:

- Alle Bestandteile müssen einmal True oder false angenommen haben. 
- Demands that besides the simple conditions and the decision also all composite conditions are tested against true and false
- As decisions can be hierarchically structured it is useful to consider this structure during testing
- This condition coverage technique takes into account the structure of decisions in a better way than the methods presented above, as all nesting levels of a compound
decision are equally considered

Q:

Control Flow Testing

Multiple Condition Coverage

A:

- The multiple condition coverage requires the test of all value combinations of the conditions

Mehr Karteikarten anzeigen
Q:

Control Flow Testing

Path Coverage


A:

- Requires the execution of all different paths of the program to be tested


  • A path p is a sequence of nodes (i, n1,.., nm, j) in the control flow graph with the start node i and the end node j
Q:

Control Flow Testing

Structured Path Test and Boundary Interior Path Test

A:
  • distinguishes only paths that execute a loop not more than k times. This avoids the explosion of the number of paths caused by loops
  • The structured path test with k=2 is called boundary interior coverage
  • The boundary interior coverage differentiates the three cases:
    • no loop execution
    • one loop execution
    •  at least two loop executions
      • (This is especially useful due to the possible interactions between variables before, in and after the loop)
Q:

Data Flow anomaly

A:

x is defined: d (defined)

  • The variable x is assigned a value (e.g. x = 5;)

x is referenced: r (referenced)

  • The value of the variable x is read in a computation or in a decision, i.e., the value of x does not change (e.g. y = x + 1; or if (x > 0) ...)

x is undefined: u (undefined)

  • The value of the variable x is deleted (e.g., deletion of local variables within a function or procedure at its termination). At program start all variables are undefined

x is not used: e (empty)

  • The instruction of the node under consideration does not influence the variable x. x is not defined, referenced or undefined


Annomalien: 


type ur; 

  • the reference of a variable with undefined, random value

type dd

  • The first definition has no effect, as the value is always overwritten by the second definition. The data flow anomaly is of the

type du

  • The value assigned by the definition is not used, as it is immediately deleted afterwards. This data flow anomaly is of the 



Q:

Data Flow Testing

The all defs-criterion demands

A:

That every definition (all defs) of a variable is used at least once in a computation or a predicate. The objective of an assignment to a variable is that this value is used somewhere once again. The tests have to be chosen in such a way that this is tested at least once for every assignment to every variable

Q:

Data Flow Testing

All p-uses-test

A:

P-use: predicate use – the variable is used when making a decision (e.g. if b > 6).  


The all p-uses-test requires that every p-use that exists with respect to each definition is taken into account during testing

Q:

Data Flow Testing 

All c-uses-test

A:

C-use: computation use – the variable is used in a computation (for example, b = 3 + d – with respect to the variable d).


The all c-uses-test requires that every c-use that exists with respect to each definition is taken into account during testing

Q:

Data Flow Testing

All c-uses / some p-uses-test resp. all p-uses / some c-uses-test

A:

If no c-uses resp. p-uses exist for some variable definitions, it is required that at least one p-use resp. c-use is tested

SQA

Erstelle und finde Lernmaterialien auf StudySmarter.

Greife kostenlos auf tausende geteilte Karteikarten, Zusammenfassungen, Altklausuren und mehr zu.

Jetzt loslegen

Das sind die beliebtesten SQA Kurse im gesamten StudySmarter Universum

SP

Universität Wien

Zum Kurs
SQL

Filmuniversität Babelsberg

Zum Kurs
SAP

TU München

Zum Kurs

Die all-in-one Lernapp für Studierende

Greife auf Millionen geteilter Lernmaterialien der StudySmarter Community zu
Kostenlos anmelden SQA
Erstelle Karteikarten und Zusammenfassungen mit den StudySmarter Tools
Kostenlos loslegen SQA