DeepTest:
Automated Testing of
Deep-Neural-Network-driven
Autonomous Cars
Yuchi Tian, Kexin Pei, Suman Jana, Baishakhi Ray
Presentation by Breandan Considine
Slide 2
Slide 2 text
How do you test an
arbitrary program?
P
x1 P(x )
1
Slide 3
Slide 3 text
P
x1
P(x )
1
O(x )
1
=
✓
O
Slide 4
Slide 4 text
P P(x )
2
O(x )
2
=
✓
x2
O
Slide 5
Slide 5 text
P P(x )
3
O(x )
3
=
x3
O
Slide 6
Slide 6 text
O
P P(x )
3
O(x )
3
=
x3
Slide 7
Slide 7 text
Metamorphic Relations
P
P(g(x ))
i
xi
P
g(x )
i
P(x )
i
=, =, ⊂, ⊊, ...
Slide 8
Slide 8 text
Metamorphic Relations
S(A, B) : Returns shortest path from A to B
Slide 9
Slide 9 text
What are some necessary properties off?
f(A, B) = f(B, A)
x ∈ S(A, B), S(A, x) + S(x, B) = S(A, B)
z ∈ G ∖ S(A, B), ∣S(A, B)∣ ≤ ∣S(A, z) + S(z, B)∣
x ∈ S(A, B), ∣S(A, x)∣ < ∣S(A, B)∣
x ∈ S(A, B), S(A, x) ⊂ S(A, B)
Slide 10
Slide 10 text
Metamorphic Relations
S
S(B, A)
A, B
S
B, A
S(A, B)
=
Slide 11
Slide 11 text
Metamorphic Relations
S
S(B, A)
A, B
S
B, A
S(A, B)
=