Week 10 - beyond web testing Flashcards

(10 cards)

1
Q

What is dynamic testing

A

invoking faults and detecting failures through execution of program code on an actual execution platform

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Advantages of dynamci test

A

quick and scalable techniques
natural extension of programming skills

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Disadvantage of dynamic testing

A

No proof of correctness (can’t prove absence of bugs)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

static analysis

A

approximate programme into mathematical structure
use analysis techniques to detect a fixed category of faults
refine approximate by removing false negatives

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is model checking

A

Translate program or spec into a behavioural model on abstract machine

Correctness properties as logical formula ( Timed computational tree logic)

check whetehr behaviour satisfies formula producing counter example if not

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

how model checking works

A

A model checker exhaustively explores all reachable execution paths of a system model and verifies whether a specified logical property holds on every path; if so, the system model satisfies the property.

what it needs:
. Finite state space
. Property expressed in logic ( we will then check propery holds in every state of state space)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Advantages of static analysis

A

scalable and efficient
useful for common faults ( div by 0 , null ptr …)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Disadvantages of static analysis

A

1) Usually for a fixed property
-Not flexible -> as they are usually for a fixed property ( will have to design your own algorithm for new type of fault not in common faults

2) possibility of false negatives
- ( as it overapproximates to ensure
soundness)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

read

A

specify system descriptions in terms of Timed Automata ( concurrent models ) which can send messages to and from each other

Specify properties in terms of Timed Computational Tree Logic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

read

A

Handshake: one sender ↔ one enabled receiver (blocks / deadlocks if none)

Broadcast: one sender → all enabled receivers (message lost if none)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly