SEKE 2012 Proceedings - Knowledge Systems Institute

pstop [x>1]
p 1
x
produce[x<
3, y=x+1]
y y
Figure 2. A test model with independent regions
When the regions are interdependent, we first generate
deterministic sequences (sim ilar to Section III-A ) and
transform them into concurrent sequences. For example,
deterministic sequence , , , , , can be transformed into the following non -
deterministic sequence: , .
IV. AUTOMATED GENERATION OF TEST CODE
We generate test code from nondeterministic sequences
based on model-implementation mapping (MIM).
A. MIM
A MIM specification for a test model consists of the following
components [3]:
(1) ID is the identity of the SUT tested against the model.
(2) f o is the object function that maps objects in the test model
to objects in the SUT.
(3) f e is the event (also called method) mapping function that
maps events in the model to operations in the SUT.
(4) f a is the accessor function that maps predicates in the test
model to accessors in the SUT.
(5) l h is the list of hidden predicates in the test model that
produce no test code.
(6) h is the helper code function that defines user -provided
code to be included in the test code.
ID refers to the system under test. The functions f o , f e , f a and
f m map objects, events, and predicates to respective
counterparts in the SUT. Operation for an event or accessor for
a predicate is a block of code that can be executed . The helper
code function allows the user to provide additional code
required to make the generated tests executable.
TABLE I.
x
y
put
p 2
cstop [x>1]
x
get[xM 1[t 2θ 2>M 2 [t nθ n>M n, MIM
(ID, f o, f e, f a, l h, h)
Output: pthread function code named after region (pfcode)
Declare: testInput is a string representing test input code
testOracle is a string representing test oracle code
newLine starts a new line
1. begin
2. pfcode ← “void *”+region+”(void * parm)”
3. pfcode ← pfcode +”{”+ newLine
4. for i=1 to n do
5. if t i is not a hidden event, i.e., t i∉l h
6. let t iθ i = t i (V 1., V k),V j is an actual parameter
7. testInput ← f e(t i (f o(V 1),, f o(V k)));
8. endif
9. testOracle ← “”;
10. for each p(V 1,, V k) in M i do
11. if p∉l h
12. testOralce ←testOracle + f a(p(f o(V 1),, f o(V k)));
13. endif
14. end for
15. pfcode ← pfcode+testInput+testOralce
16. end for
17. pfcode ← pfcode+ newLine +”pthread_exit(0)”
18. pfcode ← pfcode+ newLine +”}”
19. end
A firing sequence is a sequence of nodes ( [t i θ i >M i ) in a
reachability tree. Line 2 creates the signature of the function.
Lines 3 and 18 provide “{}” to enclose the function. Lines 4-16
generates test inputs and oracles from the given firing
349