-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtests.py
More file actions
429 lines (375 loc) · 18.3 KB
/
Copy pathtests.py
File metadata and controls
429 lines (375 loc) · 18.3 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
from scenarios import *
from maximal_mechanisms import *
import unittest
from three_credentials import *
from utils import generate_all_binary_tuples
class TestScenarios(unittest.TestCase):
def test_all_scenarios(self):
all_scenarios = generate_all_scenarios(2)
self.assertEqual(len(all_scenarios), 16)
for s in all_scenarios:
self.assertEqual(len(s.credential_states), 2)
# Check that the scenarios are unique
self.assertEqual(len(set(all_scenarios)), 16)
all_scenarios = generate_all_scenarios(3)
self.assertEqual(len(all_scenarios), 64)
for s in all_scenarios:
self.assertEqual(len(s.credential_states), 3)
class WorseOrEqual(unittest.TestCase) :
def test_credential_states(self):
# first is theft
self.assertTrue(worse_or_equal(St.THEFT, St.LEAKED))
self.assertTrue(worse_or_equal(St.THEFT, St.THEFT))
self.assertTrue(worse_or_equal(St.THEFT, St.LOST))
self.assertTrue(worse_or_equal(St.THEFT, St.SAFE))
# first is lost
self.assertFalse(worse_or_equal(St.LOST, St.THEFT))
self.assertFalse(worse_or_equal(St.LOST, St.LEAKED))
self.assertTrue(worse_or_equal(St.LOST, St.LOST))
self.assertTrue(worse_or_equal(St.LOST, St.SAFE))
self.assertFalse(worse_or_equal(St.LEAKED, St.THEFT))
self.assertTrue(worse_or_equal(St.LEAKED, St.LEAKED))
self.assertFalse(worse_or_equal(St.LEAKED, St.LOST))
self.assertTrue(worse_or_equal(St.LEAKED, St.SAFE))
self.assertFalse(worse_or_equal(St.SAFE, St.THEFT))
self.assertFalse(worse_or_equal(St.SAFE, St.LEAKED))
self.assertFalse(worse_or_equal(St.SAFE, St.LOST))
self.assertTrue(worse_or_equal(St.SAFE, St.SAFE))
def test_worse_scenarios(self):
better_scenario = Scenario([St.SAFE, St.SAFE, St.THEFT])
worse_scenarios = [
Scenario([St.SAFE, St.LEAKED, St.THEFT]),
Scenario([St.SAFE, St.LOST, St.THEFT]),
Scenario([St.SAFE, St.THEFT, St.THEFT]),
Scenario([St.LEAKED, St.SAFE, St.THEFT]),
Scenario([St.LEAKED, St.LOST, St.THEFT]),
]
for scenario in worse_scenarios:
self.assertTrue(scenario.worse_or_equal(better_scenario))
self.assertFalse(better_scenario.worse_or_equal(scenario))
def test_unclear_scenarios(self):
scenario1 = Scenario([St.SAFE, St.SAFE, St.THEFT])
unclear_scenarios = [
Scenario([St.SAFE, St.LEAKED, St.SAFE]),
Scenario([St.SAFE, St.LOST, St.LEAKED]),
Scenario([St.SAFE, St.THEFT, St.LOST]),
Scenario([St.LEAKED, St.SAFE, St.SAFE]),
Scenario([St.LEAKED, St.LOST, St.SAFE]),
]
for scenario in unclear_scenarios:
self.assertFalse(scenario.worse_or_equal(scenario1))
self.assertFalse(scenario1.worse_or_equal(scenario))
# Complement must be worse or equal
scenario2 = complement(scenario1)
self.assertFalse(scenario2.worse_or_equal(scenario1))
self.assertFalse(scenario1.worse_or_equal(scenario2))
def test_compatible_scenarios(self):
s1 = Scenario([St.SAFE, St.SAFE, St.THEFT])
s2 = Scenario([St.LOST, St.LEAKED, St.SAFE])
self.assertTrue(complement(s2).worse_or_equal(s1))
self.assertFalse(can_coexist_in_profile(s1, s2))
# Corner case: same scenario
self.assertTrue(can_coexist_in_profile(s1, s1))
s1 = Scenario([St.LEAKED, St.SAFE, St.THEFT])
s2 = Scenario([St.SAFE, St.THEFT, St.SAFE])
self.assertTrue(complement(s2).worse_or_equal(s1))
self.assertFalse(can_coexist_in_profile(s1, s2))
class TestScenarios(unittest.TestCase):
def test_is_complement(self):
s1 = Scenario([St.THEFT, St.LEAKED, St.SAFE])
s2 = Scenario([St.SAFE, St.LEAKED, St.THEFT])
self.assertTrue(s1.is_complement(s2))
def test_complement(self):
s1 = Scenario([St.THEFT, St.SAFE, St.SAFE])
s2 = Scenario([St.SAFE, St.LEAKED, St.LOST])
c1 = complement(s1)
c2 = complement(s2)
self.assertEqual(c1.credential_states, [St.SAFE, St.THEFT, St.THEFT])
self.assertEqual(c2.credential_states, [St.THEFT, St.LEAKED, St.LOST])
def test_generate_all_scenarios(self):
all_scenarios = generate_all_scenarios(2)
self.assertEqual(len(all_scenarios), 16)
for s in all_scenarios:
self.assertEqual(len(s.credential_states), 2)
all_scenarios = generate_all_scenarios(3)
self.assertEqual(len(all_scenarios), 64)
for s in all_scenarios:
self.assertEqual(len(s.credential_states), 3)
def test_is_special(self):
s1 = Scenario([St.THEFT, St.LEAKED, St.SAFE])
s2 = Scenario([St.SAFE, St.LEAKED, St.THEFT])
s3 = Scenario([St.LEAKED, St.THEFT, St.SAFE])
s4 = Scenario([St.SAFE, St.SAFE, St.SAFE])
self.assertTrue(is_special(s1))
self.assertTrue(is_special(s2))
self.assertTrue(is_special(s3))
self.assertFalse(is_special(s4))
class TestProfiles(unittest.TestCase):
def test_equivalence_simple(self):
p1 = Profile([Scenario([St.SAFE, St.SAFE, St.THEFT])])
p2 = Profile([Scenario([St.SAFE, St.SAFE, St.THEFT])])
p3 = Profile([Scenario([St.THEFT, St.SAFE, St.SAFE])])
p4 = Profile([Scenario([St.SAFE, St.THEFT, St.SAFE])])
# Generate some negative scenarios
n1 = Profile([Scenario([St.SAFE, St.SAFE, St.LOST])])
n2 = Profile([Scenario([St.SAFE, St.LEAKED, St.THEFT])])
n3 = Profile([Scenario([St.THEFT, St.THEFT, St.LEAKED])])
self.assertEqual(p1, p2)
self.assertEqual(p1, p3)
self.assertEqual(p1, p4)
self.assertNotEqual(p1, n1)
self.assertNotEqual(p1, n2)
self.assertNotEqual(p1, n3)
# Now test the profile equivalence between bigger profiles (> 3 scenarios)
p5 = Profile([
Scenario([St.SAFE, St.SAFE, St.THEFT]),
Scenario([St.LEAKED, St.SAFE, St.THEFT]),
Scenario([St.SAFE, St.LOST, St.THEFT])
])
# Let p6 be a permutation of p5 (swap 1->2, 2->3, 3->1)
p6 = Profile([
Scenario([St.THEFT, St.SAFE, St.SAFE]),
Scenario([St.THEFT, St.LEAKED, St.SAFE]),
Scenario([St.THEFT, St.SAFE, St.LOST])
])
n4 = Profile([
Scenario([St.SAFE, St.SAFE, St.LOST]),
Scenario([St.LEAKED, St.SAFE, St.THEFT]),
Scenario([St.SAFE, St.LOST, St.THEFT])
])
self.assertEqual(p5, p6)
self.assertNotEqual(p5, n4)
class TestWellDefinedRules(unittest.TestCase):
def test_priority_mechanism_is_rule_well_defined(self):
# Test cases for PriorityMechanism
pm = PriorityMechanism([0, 1, 2], False)
self.assertTrue(pm.is_rule_well_defined())
# Next line throws an exception, so catch it
try:
pm = PriorityMechanism([2, 4, 1, 3], True)
except Exception as e:
self.assertEqual(str(e), "Rule ([2, 4, 1, 3]) is not well defined")
class TestPriorityMechanisms(unittest.TestCase):
def test_priority(self):
# decider_one
s1 = Scenario([St.SAFE, St.SAFE, St.THEFT, St.THEFT])
s2 = Scenario([St.SAFE, St.LOST, St.SAFE, St.THEFT])
s3 = Scenario([St.THEFT, St.SAFE, St.LEAKED, St.SAFE])
# decider_two
s4 = Scenario([St.LEAKED, St.SAFE, St.THEFT, St.THEFT])
# decider_three
s5 = Scenario([St.LOST, St.LEAKED, St.SAFE, St.THEFT])
# PRE case
s6 = Scenario([St.LOST, St.LOST, St.SAFE, St.THEFT])
m = PriorityMechanism([0, 1, 2, 3], False)
self.assertTrue(m.succeeds(s1))
self.assertTrue(m.succeeds(s2))
self.assertFalse(m.succeeds(s3))
self.assertTrue(m.succeeds(s4))
self.assertTrue(m.succeeds(s5))
self.assertTrue(m.succeeds(s6))
def test_profile_two_creds(self):
m = PriorityMechanism([0, 1], False)
profile = m.profile
self.assertEqual(len(profile), 6)
self.assertEqual(set(profile), set([
Scenario([St.SAFE, St.SAFE]),
Scenario([St.SAFE, St.LEAKED]),
Scenario([St.SAFE, St.LOST]),
Scenario([St.SAFE, St.THEFT]),
Scenario([St.LEAKED, St.SAFE]),
Scenario([St.LOST, St.SAFE]),
]))
m = PriorityMechanism([1, 0], False)
profile = m.profile
self.assertEqual(len(profile), 6)
self.assertEqual(set(profile), set([
Scenario([St.SAFE, St.SAFE]),
Scenario([St.LEAKED, St.SAFE]),
Scenario([St.LOST, St.SAFE]),
Scenario([St.THEFT, St.SAFE]),
Scenario([St.SAFE, St.LEAKED]),
Scenario([St.SAFE, St.LOST]),
]))
def test_profile_three_creds(self):
m = PriorityMechanism([0, 1, 2], False)
profile = m.profile
self.assertEqual(len(profile), 28) # (4^3 - 2^3) / 2 = 28
self.assertEqual(set(profile), set([
# All 16 scenarios where the first credential is safe
Scenario([St.SAFE, St.SAFE, St.SAFE]),
Scenario([St.SAFE, St.SAFE, St.LEAKED]),
Scenario([St.SAFE, St.SAFE, St.LOST]),
Scenario([St.SAFE, St.SAFE, St.THEFT]),
Scenario([St.SAFE, St.LEAKED, St.SAFE]),
Scenario([St.SAFE, St.LEAKED, St.LEAKED]),
Scenario([St.SAFE, St.LEAKED, St.LOST]),
Scenario([St.SAFE, St.LEAKED, St.THEFT]),
Scenario([St.SAFE, St.LOST, St.SAFE]),
Scenario([St.SAFE, St.LOST, St.LEAKED]),
Scenario([St.SAFE, St.LOST, St.LOST]),
Scenario([St.SAFE, St.LOST, St.THEFT]),
Scenario([St.SAFE, St.THEFT, St.SAFE]),
Scenario([St.SAFE, St.THEFT, St.LEAKED]),
Scenario([St.SAFE, St.THEFT, St.LOST]),
Scenario([St.SAFE, St.THEFT, St.THEFT]),
# All 4 scenarios where the first credential is leaked but second is safe
Scenario([St.LEAKED, St.SAFE, St.SAFE]),
Scenario([St.LEAKED, St.SAFE, St.LEAKED]),
Scenario([St.LEAKED, St.SAFE, St.LOST]),
Scenario([St.LEAKED, St.SAFE, St.THEFT]),
# All 4 scenarios where the first credential is lost but second is safe
Scenario([St.LOST, St.SAFE, St.SAFE]),
Scenario([St.LOST, St.SAFE, St.LEAKED]),
Scenario([St.LOST, St.SAFE, St.LOST]),
Scenario([St.LOST, St.SAFE, St.THEFT]),
# first two credentials are leaked / lost, third is safe
Scenario([St.LEAKED, St.LEAKED, St.SAFE]),
Scenario([St.LEAKED, St.LOST, St.SAFE]),
Scenario([St.LOST, St.LEAKED, St.SAFE]),
Scenario([St.LOST, St.LOST, St.SAFE]),
]))
def test_compare_different_priority_mechanisms(self):
# Test the profile equivalence between even bigger profiles
self.assertEqual(PriorityMechanism([0, 1], False).profile,
PriorityMechanism([1, 0], False).profile)
for exception in [True, False]:
for rule in [[0, 1, 2], [1, 0, 2], [2, 0, 1], [0, 2, 1], [1, 2, 0], [2, 1, 0]]:
self.assertEqual(PriorityMechanism([0, 1, 2], exception).profile,
PriorityMechanism(rule, exception).profile)
self.assertNotEqual(PriorityMechanism([0, 1, 2], False).profile,
PriorityMechanism([0, 1, 2], True).profile)
class TestPREMechanisms(unittest.TestCase):
def test_priority_with_exception(self):
# decider_one
s1 = Scenario([St.SAFE, St.SAFE, St.THEFT, St.THEFT])
s2 = Scenario([St.SAFE, St.LOST, St.SAFE, St.THEFT])
s3 = Scenario([St.THEFT, St.SAFE, St.LEAKED, St.SAFE])
# decider_two
s4 = Scenario([St.LEAKED, St.SAFE, St.THEFT, St.THEFT])
# decider_three
s5 = Scenario([St.LOST, St.LEAKED, St.SAFE, St.THEFT])
m = PriorityMechanism([0, 1, 2, 3], True)
self.assertTrue(m.succeeds(s1))
self.assertTrue(m.succeeds(s2))
self.assertFalse(m.succeeds(s3))
self.assertTrue(m.succeeds(s4))
self.assertTrue(m.succeeds(s5))
s6 = Scenario([St.LOST, St.LOST, St.SAFE, St.THEFT])
self.assertFalse(m.succeeds(s6))
class TestTieBreaks(unittest.TestCase):
def test_generate_tie_break_inputs(self):
# one credential
all_possible_inputs = generate_tie_break_inputs([0])
self.assertEqual(all_possible_inputs, [])
# two credentials
all_possible_inputs = generate_tie_break_inputs([0, 1])
self.assertEqual(all_possible_inputs, [([0], [1])])
all_possible_inputs = generate_tie_break_inputs([1, 2])
self.assertEqual(all_possible_inputs, [([1], [2])])
# three credentials
all_possible_inputs = generate_tie_break_inputs([0, 1, 2])
self.assertEqual(all_possible_inputs, [
([0], [1]), ([0], [2]), ([1], [2]), ([0, 1], [0, 2]), ([0, 1], [1, 2]), ([0, 2], [1, 2])
])
class TestMajorityMechanisms(unittest.TestCase):
def test_majority_two_creds(self):
t = lambda x, y: uniform_priority_tie_breaker(x, y, [0, 1])
m = MajorityMechanism(2, t, [0, 1])
p = m.profile
self.assertEqual(len(p), 6)
self.assertEqual(set(p), set([
Scenario([St.SAFE, St.SAFE]),
Scenario([St.SAFE, St.LEAKED]),
Scenario([St.SAFE, St.LOST]),
Scenario([St.SAFE, St.THEFT]),
Scenario([St.LEAKED, St.SAFE]),
Scenario([St.LOST, St.SAFE]),
]))
def test_majority_three_creds(self):
t = lambda x, y: uniform_priority_tie_breaker(x, y, [0, 1, 2])
m = MajorityMechanism(3, t, [0, 1, 2])
p = m.profile
self.assertEqual(len(p), 28)
self.assertEqual(set(p), set([
# All 10 scenarios where 2-of-3 credentials are safe
Scenario([St.SAFE, St.SAFE, St.SAFE]),
Scenario([St.SAFE, St.SAFE, St.LEAKED]),
Scenario([St.SAFE, St.SAFE, St.LOST]),
Scenario([St.SAFE, St.SAFE, St.THEFT]),
Scenario([St.SAFE, St.LEAKED, St.SAFE]),
Scenario([St.SAFE, St.LOST, St.SAFE]),
Scenario([St.SAFE, St.THEFT, St.SAFE]),
Scenario([St.LEAKED, St.SAFE, St.SAFE]),
Scenario([St.LOST, St.SAFE, St.SAFE]),
Scenario([St.THEFT, St.SAFE, St.SAFE]),
# All 12 scenarios where one is safe, rest two are not stolen
Scenario([St.SAFE, St.LEAKED, St.LEAKED]),
Scenario([St.SAFE, St.LOST, St.LEAKED]),
Scenario([St.SAFE, St.LEAKED, St.LOST]),
Scenario([St.SAFE, St.LOST, St.LOST]),
Scenario([St.LEAKED, St.SAFE, St.LEAKED]),
Scenario([St.LOST, St.SAFE, St.LEAKED]),
Scenario([St.LEAKED, St.SAFE, St.LOST]),
Scenario([St.LOST, St.SAFE, St.LOST]),
Scenario([St.LEAKED, St.LEAKED, St.SAFE]),
Scenario([St.LOST, St.LEAKED, St.SAFE]),
Scenario([St.LEAKED, St.LOST, St.SAFE]),
Scenario([St.LOST, St.LOST, St.SAFE]),
# All 6 scenarios where one is stolen, one is safe, but the tie breaker is needed
Scenario([St.SAFE, St.THEFT, St.LEAKED]),
Scenario([St.SAFE, St.THEFT, St.LOST]),
Scenario([St.SAFE, St.LEAKED, St.THEFT]),
Scenario([St.SAFE, St.LOST, St.THEFT]),
Scenario([St.LEAKED, St.SAFE, St.THEFT]),
Scenario([St.LOST, St.SAFE, St.THEFT]),
]))
def test_diff_tie_breaks(self):
all_3cred_majority_mechanisms = get_all_majority_mechanisms()
for M in all_3cred_majority_mechanisms:
self.assertEqual(len(M.profile), 28)
all_tie_breaks = generate_all_binary_tuples(6)
for tb in all_tie_breaks:
m = MajorityMechanism(3, lambda x, y: tie_breaker_function_3creds(x, y, tb), tb)
p = m.profile
self.assertEqual(len(p), 28)
m1 = MajorityMechanism(3, lambda x, y: tie_breaker_function_3creds(x, y, all_tie_breaks[0]), all_tie_breaks[0])
m2 = MajorityMechanism(3, lambda x, y: tie_breaker_function_3creds(x, y, all_tie_breaks[1]), all_tie_breaks[1])
# Succeeds
self.assertNotEqual(m1.profile, m2.profile)
# Fails
self.assertNotEqual(all_3cred_majority_mechanisms[0].profile, all_3cred_majority_mechanisms[1].profile)
# # Priority tie-breaks
# # All permutations of vectors of length 3 with elements 0, 1, 2
# perms = [[0, 1, 2], [0, 2, 1], [1, 0, 2], [1, 2, 0], [2, 0, 1], [2, 1, 0]]
# for priority in perms:
# m = MajorityMechanism(3, lambda x, y: uniform_priority_tie_breaker(x, y, priority))
# p = m.profile
# self.assertEqual(len(p), 28)
# # Different priority tie-breaks for 1-length and 2-length vectors
# for priority1 in perms:
# for priority2 in perms:
# priority = [priority1, priority2]
# m = MajorityMechanism(3, lambda x, y: different_priority_tie_breaker(x, y, priority))
# self.assertEqual(len(m.profile), 28)
class TestThreeCredentialCompleteSets(unittest.TestCase):
def test_all_3cred_profiles(self):
all_maximal_mechanisms = get_all_3cred_mechanisms()
all_priority_mechanisms = get_all_priority_mechanisms()
all_majority_mechanisms = get_all_majority_mechanisms()
self.assertEqual(len(all_priority_mechanisms), 12)
self.assertEqual(len(all_majority_mechanisms), 64)
self.assertEqual(len(all_maximal_mechanisms), 76)
for M in all_maximal_mechanisms:
self.assertEqual(len(M.profile), 28)
def test_complete_maximal_set(self):
unique_mechanisms = get_complete_maximal_set()
self.assertEqual(len(unique_mechanisms), 14)
# Check that two of the fourteen have priority in their labels
priority_mechanisms = [m for m in unique_mechanisms if "priority" in m.label()]
self.assertEqual(len(priority_mechanisms), 2)
# Check if remaining have majority in their labels
majority_mechanisms = [m for m in unique_mechanisms if "majority" in m.label()]
self.assertEqual(len(majority_mechanisms), 12)
if __name__ == '__main__':
unittest.main()