| COM | sci_inv_rw_1 | ---- NonInterference Theorems for Idle ------------------- |
| THM | idle_ni_m3 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( q:P. idle(action_m3{} s;q)   idle(s;q)) |
| THM | idle_ni_m4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( q:P. idle(action_m4{} s;q)   idle(s;q)) |
| THM | idle_ni_p1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. idle(action_p1{}(p) s;q)   idle(s;q)) |
| THM | idle_ni_p2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. idle(action_p2{}(p) s;q)   idle(s;q)) |
| THM | idle_ni_p3 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. idle(action_p3{}(p) s;q)   idle(s;q)) |
| THM | idle_ni_p4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. idle(action_p4{}(p) s;q)   idle(s;q)) |
| THM | idle_ni_p5 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. idle(action_p5{}(p) s;q)   idle(s;q)) |
| THM | idle_ni_p6 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. idle(action_p6{}(p) s;q)   idle(s;q)) |
| THM | idle_ni_p7 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. idle(action_p7{}(p) s;q)   idle(s;q)) |
| THM | idle_ni_p8 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. idle(action_p8{}(p) s;q)   idle(s;q)) |
| THM | idle_ni_p9 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. idle(action_p9{}(p) s;q)   idle(s;q)) |
| THM | idle_ni_p10 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. idle(action_p10{}(p) s;q)   idle(s;q)) |
| THM | idle_ni_p11 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. idle(action_p11{}(p) s;q)   idle(s;q)) |
| THM | idle_ni_p12 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. idle(action_p12{}(p) s;q)   idle(s;q)) |
| THM | idle_ni_p13 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(p = q)  (idle(action_p13{}(p) s;q)   idle(s;q))) |
| THM | idle_ni_p14 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. idle(action_p14{}(p) s;q)   idle(s;q)) |
| THM | idle_ni_p15 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(p = q)  (idle(action_p15{}(p) s;q)   idle(s;q))) |
| THM | idle_ni_p16 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(p = q)  (idle(action_p16{}(p) s;q)   idle(s;q))) |
| THM | idle_ni_p17 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. idle(action_p17{}(p) s;q)   idle(s;q)) |
| ML | sci_idle_ni_simpset | map ((simpset_add `sci_idle_ni`) o lemma_simp)
``idle_ni_m3 idle_ni_m4
idle_ni_p1 idle_ni_p2 idle_ni_p3 idle_ni_p4
idle_ni_p5 idle_ni_p6 idle_ni_p7
idle_ni_p8 idle_ni_p9 idle_ni_p10 idle_ni_p11 idle_ni_p12
idle_ni_p14 idle_ni_p17`` ;;
map (simpset_add `sci_idle_ni`)
[lemma_cond_simp `idle_ni_p13` [Trivial ORELSE DiffBufferPids];
lemma_cond_simp `idle_ni_p15` [Trivial ORELSE DiffBufferPids];
lemma_cond_simp `idle_ni_p16` [Trivial ORELSE DiffBufferPids]
] ;; |
| COM | sci_inv_rw_2 | ---- NonInterference Theorems for Entering --------------- |
| THM | entering_ni_m3 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( q:P. entering(action_m3{} s;q)   entering(s;q)) |
| THM | entering_ni_m4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( q:P. entering(action_m4{} s;q)   entering(s;q)) |
| THM | entering_ni_p1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. entering(action_p1{}(p) s;q)   entering(s;q)) |
| THM | entering_ni_p2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. entering(action_p2{}(p) s;q)   entering(s;q)) |
| THM | entering_ni_p3 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(p = q)  (entering(action_p3{}(p) s;q)   entering(s;q))) |
| THM | entering_ni_p4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(p = q)  (entering(action_p4{}(p) s;q)   entering(s;q))) |
| THM | entering_ni_p5 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. entering(action_p5{}(p) s;q)   entering(s;q)) |
| THM | entering_ni_p6 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(p = q)  (entering(action_p6{}(p) s;q)   entering(s;q))) |
| THM | entering_ni_p7 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. entering(action_p7{}(p) s;q)   entering(s;q)) |
| THM | entering_ni_p8 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. entering(action_p8{}(p) s;q)   entering(s;q)) |
| THM | entering_ni_p9 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. entering(action_p9{}(p) s;q)   entering(s;q)) |
| THM | entering_ni_p10 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. entering(action_p10{}(p) s;q)   entering(s;q)) |
| THM | entering_ni_p11 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. entering(action_p11{}(p) s;q)   entering(s;q)) |
| THM | entering_ni_p12 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. entering(action_p12{}(p) s;q)   entering(s;q)) |
| THM | entering_ni_p13 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. entering(action_p13{}(p) s;q)   entering(s;q)) |
| THM | entering_ni_p14 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. entering(action_p14{}(p) s;q)   entering(s;q)) |
| THM | entering_ni_p15 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. entering(action_p15{}(p) s;q)   entering(s;q)) |
| THM | entering_ni_p16 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. entering(action_p16{}(p) s;q)   entering(s;q)) |
| THM | entering_ni_p17 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. entering(action_p17{}(p) s;q)   entering(s;q)) |
| ML | sci_entering_ni_simpset | map ((simpset_add `sci_entering_ni`) o lemma_simp)
``entering_ni_m3 entering_ni_m4
entering_ni_p1 entering_ni_p2 entering_ni_p5 entering_ni_p7
entering_ni_p8 entering_ni_p9 entering_ni_p10 entering_ni_p11
entering_ni_p12 entering_ni_p13 entering_ni_p14 entering_ni_p15
entering_ni_p16 entering_ni_p17`` ;;
map (simpset_add `sci_entering_ni`)
[lemma_cond_simp `entering_ni_p3` [Trivial ORELSE DiffBufferPids];
lemma_cond_simp `entering_ni_p4` [Trivial ORELSE DiffBufferPids];
lemma_cond_simp `entering_ni_p6` [Trivial ORELSE DiffBufferPids]
] ;; |
| COM | sci_inv_rw_3 | ---- NonInterference Theorems for Leaving ---------------- |
| THM | leaving_ni_m1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( q:P. leaving(action_m1{} s;q)   leaving(s;q)) |
| THM | leaving_ni_m2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( q:P. leaving(action_m2{} s;q)   leaving(s;q)) |
| THM | leaving_ni_m4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( q:P. leaving(action_m4{} s;q)   leaving(s;q)) |
| THM | leaving_ni_p1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. leaving(action_p1{}(p) s;q)   leaving(s;q)) |
| THM | leaving_ni_p2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. leaving(action_p2{}(p) s;q)   leaving(s;q)) |
| THM | leaving_ni_p3 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. leaving(action_p3{}(p) s;q)   leaving(s;q)) |
| THM | leaving_ni_p4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. leaving(action_p4{}(p) s;q)   leaving(s;q)) |
| THM | leaving_ni_p5 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(p = q)  (leaving(action_p5{}(p) s;q)   leaving(s;q))) |
| THM | leaving_ni_p6 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. leaving(action_p6{}(p) s;q)   leaving(s;q)) |
| THM | leaving_ni_p7 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. leaving(action_p7{}(p) s;q)   leaving(s;q)) |
| THM | leaving_ni_p8 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. leaving(action_p8{}(p) s;q)   leaving(s;q)) |
| THM | leaving_ni_p9 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. leaving(action_p9{}(p) s;q)   leaving(s;q)) |
| THM | leaving_ni_p10 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(cs-q_ = invalid{})
 (leaving(action_p10{}(p) s;q)   leaving(s;q))) |
| THM | leaving_ni_p11 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(cs-q_ = invalid{})
 (leaving(action_p11{}(p) s;q)   leaving(s;q))) |
| THM | leaving_ni_p12 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. leaving(action_p12{}(p) s;q)   leaving(s;q)) |
| THM | leaving_ni_p13 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(p = q)  (leaving(action_p13{}(p) s;q)   leaving(s;q))) |
| THM | leaving_ni_p15 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(p = q)  (leaving(action_p15{}(p) s;q)   leaving(s;q))) |
| THM | leaving_ni_p16 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(p = q)  (leaving(action_p16{}(p) s;q)   leaving(s;q))) |
| THM | leaving_ni_p17 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. leaving(action_p17{}(p) s;q)   leaving(s;q)) |
| ML | sci_leaving_ni_simpset | map ((simpset_add `sci_leaving_ni`) o lemma_simp)
``leaving_ni_m1 leaving_ni_m2 leaving_ni_m4
leaving_ni_p1 leaving_ni_p2 leaving_ni_p3 leaving_ni_p4
leaving_ni_p6 leaving_ni_p7 leaving_ni_p8 leaving_ni_p9
leaving_ni_p12 leaving_ni_p17`` ;;
map (simpset_add `sci_leaving_ni`)
[lemma_cond_simp `leaving_ni_p5` [Trivial ORELSE DiffBufferPids];
lemma_cond_simp `leaving_ni_p10` [IdSimpCond];
lemma_cond_simp `leaving_ni_p11` [IdSimpCond];
lemma_cond_simp `leaving_ni_p13` [Trivial ORELSE DiffBufferPids];
lemma_cond_simp `leaving_ni_p15` [Trivial ORELSE DiffBufferPids];
lemma_cond_simp `leaving_ni_p16` [Trivial ORELSE DiffBufferPids]
] ;; |
| COM | sci_inv_rw_4 | ---- NonInterference Theorems for Visiting --------------- |
| THM | visiting_ni_m1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( q:P. visiting(action_m1{} s;q)   visiting(s;q)) |
| THM | visiting_ni_m2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( q:P. visiting(action_m2{} s;q)   visiting(s;q)) |
| THM | visiting_ni_m4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( q:P. visiting(action_m4{} s;q)   visiting(s;q)) |
| THM | visiting_ni_p1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. visiting(action_p1{}(p) s;q)   visiting(s;q)) |
| THM | visiting_ni_p2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. visiting(action_p2{}(p) s;q)   visiting(s;q)) |
| THM | visiting_ni_p3 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(p = q)  (visiting(action_p3{}(p) s;q)   visiting(s;q))) |
| THM | visiting_ni_p4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(p = q)  (visiting(action_p4{}(p) s;q)   visiting(s;q))) |
| THM | visiting_ni_p5 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(p = q)  (visiting(action_p5{}(p) s;q)   visiting(s;q))) |
| THM | visiting_ni_p6 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(p = q)  (visiting(action_p6{}(p) s;q)   visiting(s;q))) |
| THM | visiting_ni_p7 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. visiting(action_p7{}(p) s;q)   visiting(s;q)) |
| THM | visiting_ni_p8 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. visiting(action_p8{}(p) s;q)   visiting(s;q)) |
| THM | visiting_ni_p9 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. visiting(action_p9{}(p) s;q)   visiting(s;q)) |
| THM | visiting_ni_p10 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(cs-q_ = invalid{})
 (visiting(action_p10{}(p) s;q)   visiting(s;q))) |
| THM | visiting_ni_p11 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(cs-q_ = invalid{})
 (visiting(action_p11{}(p) s;q)   visiting(s;q))) |
| THM | visiting_ni_p12 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. visiting(action_p12{}(p) s;q)   visiting(s;q)) |
| THM | visiting_ni_p13 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. visiting(action_p13{}(p) s;q)   visiting(s;q)) |
| THM | visiting_ni_p15 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. visiting(action_p15{}(p) s;q)   visiting(s;q)) |
| THM | visiting_ni_p16 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(p = q)  (visiting(action_p16{}(p) s;q)   visiting(s;q))) |
| THM | visiting_ni_p17 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. visiting(action_p17{}(p) s;q)   visiting(s;q)) |
| ML | sci_visiting_ni_simpset | map ((simpset_add `sci_visiting_ni`) o lemma_simp)
``visiting_ni_m1 visiting_ni_m2 visiting_ni_m4
visiting_ni_p1 visiting_ni_p2 visiting_ni_p7 visiting_ni_p8
visiting_ni_p9 visiting_ni_p12 visiting_ni_p13
visiting_ni_p15 visiting_ni_p17`` ;;
map (simpset_add `sci_visiting_ni`)
[lemma_cond_simp `visiting_ni_p3` [Trivial ORELSE DiffBufferPids];
lemma_cond_simp `visiting_ni_p4` [Trivial ORELSE DiffBufferPids];
lemma_cond_simp `visiting_ni_p5` [Trivial ORELSE DiffBufferPids];
lemma_cond_simp `visiting_ni_p6` [Trivial ORELSE DiffBufferPids];
lemma_cond_simp `visiting_ni_p10` [IdSimpCond];
lemma_cond_simp `visiting_ni_p11` [IdSimpCond];
lemma_cond_simp `visiting_ni_p16` [Trivial ORELSE DiffBufferPids]
] ;; |
| COM | sci_inv_rw_5 | ---- NonInterference Theorems for Rank ------------------- |
| THM | rank_ni_m4 | n: . s:state. q:P.
in_exec{}(sci_program{}(n); s)  rank(action_m4{} s;q) = rank(s;q) |
| THM | rank_ni_p1 | n: . s:state. p:P. q:PId.
in_exec{}(sci_program{}(n); s)
 rank(action_p1{}(p) s;q) = rank(s;q) |
| THM | rank_ni_p2 | n: . s:state. p:P. q:PId.
in_exec{}(sci_program{}(n); s)
 rank(action_p2{}(p) s;q) = rank(s;q) |
| THM | rank_ni_p3 | n: . s:state. p:P. q:PId.
in_exec{}(sci_program{}(n); s)
 rank(action_p3{}(p) s;q) = rank(s;q) |
| THM | rank_ni_p4 | n: . s:state. p:P. q:PId.
in_exec{}(sci_program{}(n); s)
 rank(action_p4{}(p) s;q) = rank(s;q) |
| THM | rank_ni_p6 | n: . s:state. p:P. q:PId.
in_exec{}(sci_program{}(n); s)
 rank(action_p6{}(p) s;q) = rank(s;q) |
| THM | rank_ni_p7 | n: . s:state. p:P. q:PId.
in_exec{}(sci_program{}(n); s)
 rank(action_p7{}(p) s;q) = rank(s;q) |
| THM | rank_ni_p8 | n: . s:state. p:P. q:PId.
in_exec{}(sci_program{}(n); s)
 rank(action_p8{}(p) s;q) = rank(s;q) |
| THM | rank_ni_p9 | n: . s:state. p:P. q:PId.
in_exec{}(sci_program{}(n); s)
 rank(action_p9{}(p) s;q) = rank(s;q) |
| THM | rank_ni_p10 | n: . s:state. p:P. q:PId.
in_exec{}(sci_program{}(n); s)
 (cs-p_ = invalid{})
 rank(action_p10{}(p) s;q) = rank(s;q) |
| THM | rank_ni_p11 | n: . s:state. p:P. q:PId.
in_exec{}(sci_program{}(n); s)
 (cs-p_ = invalid{})
 rank(action_p11{}(p) s;q) = rank(s;q) |
| THM | rank_ni_p12 | n: . s:state. p:P. q:PId.
in_exec{}(sci_program{}(n); s)
 rank(action_p12{}(p) s;q) = rank(s;q) |
| THM | rank_ni_p13 | n: . s:state. p:P. q:PId.
in_exec{}(sci_program{}(n); s)
 rank(action_p13{}(p) s;q) = rank(s;q) |
| THM | rank_ni_p15 | n: . s:state. p:P. q:PId.
in_exec{}(sci_program{}(n); s)
 rank(action_p15{}(p) s;q) = rank(s;q) |
| THM | rank_ni_p17 | n: . s:state. p:P. q:PId.
in_exec{}(sci_program{}(n); s)
 rank(action_p17{}(p) s;q) = rank(s;q) |
| ML | sci_rank_ni_simpset | map ((simpset_add `sci_rank_ni`) o lemma_simp)
``rank_ni_m4 rank_ni_p1 rank_ni_p2 rank_ni_p3
rank_ni_p4 rank_ni_p6
rank_ni_p7 rank_ni_p8 rank_ni_p9 rank_ni_p12
rank_ni_p13 rank_ni_p15 rank_ni_p17`` ;;
map (simpset_add `sci_rank_ni`)
[lemma_cond_simp `rank_ni_p10` [IdSimpCond];
lemma_cond_simp `rank_ni_p11` [IdSimpCond]
] ;; |
| COM | sci_inv_rw_6 | ---- NonInterference Theorems for hasrank ---------------- |
| THM | hasrank_ni_m4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( q:P. hasrank(action_m4{} s;q)   hasrank(s;q)) |
| THM | hasrank_ni_p1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. hasrank(action_p1{}(p) s;q)   hasrank(s;q)) |
| THM | hasrank_ni_p2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. hasrank(action_p2{}(p) s;q)   hasrank(s;q)) |
| THM | hasrank_ni_p3 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. hasrank(action_p3{}(p) s;q)   hasrank(s;q)) |
| THM | hasrank_ni_p4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. hasrank(action_p4{}(p) s;q)   hasrank(s;q)) |
| THM | hasrank_ni_p6 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. hasrank(action_p6{}(p) s;q)   hasrank(s;q)) |
| THM | hasrank_ni_p7 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. hasrank(action_p7{}(p) s;q)   hasrank(s;q)) |
| THM | hasrank_ni_p8 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. hasrank(action_p8{}(p) s;q)   hasrank(s;q)) |
| THM | hasrank_ni_p9 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. hasrank(action_p9{}(p) s;q)   hasrank(s;q)) |
| THM | hasrank_ni_p10 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(cs-p_ = invalid{})
 (hasrank(action_p10{}(p) s;q)   hasrank(s;q))) |
| THM | hasrank_ni_p11 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(cs-p_ = invalid{})
 (hasrank(action_p11{}(p) s;q)   hasrank(s;q))) |
| THM | hasrank_ni_p12 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. hasrank(action_p12{}(p) s;q)   hasrank(s;q)) |
| THM | hasrank_ni_p13 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. hasrank(action_p13{}(p) s;q)   hasrank(s;q)) |
| THM | hasrank_ni_p15 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. hasrank(action_p15{}(p) s;q)   hasrank(s;q)) |
| THM | hasrank_ni_p17 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. hasrank(action_p17{}(p) s;q)   hasrank(s;q)) |
| ML | sci_hasrank_ni_simpset | map ((simpset_add `sci_hasrank_ni`) o lemma_simp)
``hasrank_ni_m4 hasrank_ni_p1 hasrank_ni_p2 hasrank_ni_p3
hasrank_ni_p4 hasrank_ni_p6
hasrank_ni_p7 hasrank_ni_p8 hasrank_ni_p9 hasrank_ni_p12
hasrank_ni_p13 hasrank_ni_p15 hasrank_ni_p17`` ;;
map (simpset_add `sci_hasrank_ni`)
[lemma_cond_simp `hasrank_ni_p10` [IdSimpCond];
lemma_cond_simp `hasrank_ni_p11` [IdSimpCond]
] ;; |
| COM | sci_inv_rw_7 | ---- NonInterference Theorems for maxrank ---------------- |
| THM | maxrank_ni_m4 | n: . s:state. q:P.
in_exec{}(sci_program{}(n); s)
 (maxrank(n;action_m4{} s;q)   maxrank(n;s;q)) |
| THM | maxrank_ni_p1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. maxrank(n;action_p1{}(p) s;q)   maxrank(n;s;q)) |
| THM | maxrank_ni_p2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. maxrank(n;action_p2{}(p) s;q)   maxrank(n;s;q)) |
| THM | maxrank_ni_p3 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. maxrank(n;action_p3{}(p) s;q)   maxrank(n;s;q)) |
| THM | maxrank_ni_p4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. maxrank(n;action_p4{}(p) s;q)   maxrank(n;s;q)) |
| THM | maxrank_ni_p6 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. maxrank(n;action_p6{}(p) s;q)   maxrank(n;s;q)) |
| THM | maxrank_ni_p7 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. maxrank(n;action_p7{}(p) s;q)   maxrank(n;s;q)) |
| THM | maxrank_ni_p8 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. maxrank(n;action_p8{}(p) s;q)   maxrank(n;s;q)) |
| THM | maxrank_ni_p9 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId. maxrank(n;action_p9{}(p) s;q)   maxrank(n;s;q)) |
| THM | maxrank_ni_p10 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(cs-p_ = invalid{})
 (maxrank(n;action_p10{}(p) s;q)   maxrank(n;s;q))) |
| THM | maxrank_ni_p11 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(cs-p_ = invalid{})
 (maxrank(n;action_p11{}(p) s;q)   maxrank(n;s;q))) |
| THM | maxrank_ni_p12 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
maxrank(n;action_p12{}(p) s;q)   maxrank(n;s;q)) |
| THM | maxrank_ni_p13 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
maxrank(n;action_p13{}(p) s;q)   maxrank(n;s;q)) |
| THM | maxrank_ni_p15 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
maxrank(n;action_p15{}(p) s;q)   maxrank(n;s;q)) |
| THM | maxrank_ni_p17 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
maxrank(n;action_p17{}(p) s;q)   maxrank(n;s;q)) |
| ML | sci_rank_ni1_simpset1 | map ((simpset_add `sci_rank_ni1`) o lemma_simp)
``maxrank_ni_m4 maxrank_ni_p1 maxrank_ni_p2 maxrank_ni_p3
maxrank_ni_p4 maxrank_ni_p6
maxrank_ni_p7 maxrank_ni_p8 maxrank_ni_p9 maxrank_ni_p12
maxrank_ni_p13 maxrank_ni_p15 maxrank_ni_p17`` ;;
map (simpset_add `sci_rank_ni1`)
[lemma_cond_simp `maxrank_ni_p10` [IdSimpCond];
lemma_cond_simp `maxrank_ni_p11` [IdSimpCond]
] ;; |
| COM | sci_inv_rw_8 | ---- NonInterference Theorems for maxrank_visiting ------- |
| THM | maxrank_visiting_ni_m4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( q:P
maxrank_visiting(n;action_m4{} s;q)
  maxrank_visiting(n;s;q)) |
| THM | maxrank_visiting_ni_p1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
maxrank_visiting(n;action_p1{}(p) s;q)
  maxrank_visiting(n;s;q)) |
| THM | maxrank_visiting_ni_p2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
maxrank_visiting(n;action_p2{}(p) s;q)
  maxrank_visiting(n;s;q)) |
| THM | maxrank_visiting_ni_p7 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
maxrank_visiting(n;action_p7{}(p) s;q)
  maxrank_visiting(n;s;q)) |
| THM | maxrank_visiting_ni_p8 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
maxrank_visiting(n;action_p8{}(p) s;q)
  maxrank_visiting(n;s;q)) |
| THM | maxrank_visiting_ni_p9 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
maxrank_visiting(n;action_p9{}(p) s;q)
  maxrank_visiting(n;s;q)) |
| THM | maxrank_visiting_ni_p10 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(cs-p_ = invalid{})
 (maxrank_visiting(n;action_p10{}(p) s;q)
  maxrank_visiting(n;s;q))) |
| THM | maxrank_visiting_ni_p11 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
(cs-p_ = invalid{})
 (maxrank_visiting(n;action_p11{}(p) s;q)
  maxrank_visiting(n;s;q))) |
| THM | maxrank_visiting_ni_p12 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
maxrank_visiting(n;action_p12{}(p) s;q)
  maxrank_visiting(n;s;q)) |
| THM | maxrank_visiting_ni_p13 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
maxrank_visiting(n;action_p13{}(p) s;q)
  maxrank_visiting(n;s;q)) |
| THM | maxrank_visiting_ni_p15 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
maxrank_visiting(n;action_p15{}(p) s;q)
  maxrank_visiting(n;s;q)) |
| THM | maxrank_visiting_ni_p17 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 ( p:P. q:PId.
maxrank_visiting(n;action_p17{}(p) s;q)
  maxrank_visiting(n;s;q)) |
| ML | sci_rank_ni1_simpset2 | map ((simpset_add `sci_rank_ni1`) o lemma_simp)
``maxrank_visiting_ni_m4 maxrank_visiting_ni_p1 maxrank_visiting_ni_
p2
maxrank_visiting_ni_p7 maxrank_visiting_ni_p8 maxrank_visiting_ni_
p9
maxrank_visiting_ni_p12
maxrank_visiting_ni_p13 maxrank_visiting_ni_p15 maxrank_visiting_n
i_p17`` ;;
map (simpset_add `sci_rank_ni1`)
[lemma_cond_simp `maxrank_visiting_ni_p10` [IdSimpCond];
lemma_cond_simp `maxrank_visiting_ni_p11` [IdSimpCond]
] ;; |
| COM | sci_inv_rw_9 | ---- NonInterference Theorems for smallrank -------------- |
| COM | sci_inv_rw_10 | ---- NonInterference Theorems for maxrank_staying -------- |
| COM | sci_inv_rw_11 | ---- NonInterference Theorems for maxrank_active --------- |