:: AMI_6 semantic presentation
theorem Th1: :: AMI_6:1
theorem Th2: :: AMI_6:2
theorem Th3: :: AMI_6:3
theorem Th4: :: AMI_6:4
theorem Th5: :: AMI_6:5
theorem Th6: :: AMI_6:6
Lemma7:
for b1, b2 being set st b1 in dom <*b2*> holds
b1 = 1
Lemma8:
for b1, b2, b3 being set holds
( not b1 in dom <*b2,b3*> or b1 = 1 or b1 = 2 )
Lemma9:
for b1 being InsType of SCM holds
( b1 = 0 or b1 = 1 or b1 = 2 or b1 = 3 or b1 = 4 or b1 = 5 or b1 = 6 or b1 = 7 or b1 = 8 )
theorem Th7: :: AMI_6:7
theorem Th8: :: AMI_6:8
theorem Th9: :: AMI_6:9
theorem Th10: :: AMI_6:10
theorem Th11: :: AMI_6:11
theorem Th12: :: AMI_6:12
theorem Th13: :: AMI_6:13
theorem Th14: :: AMI_6:14
theorem Th15: :: AMI_6:15
theorem Th16: :: AMI_6:16
theorem Th17: :: AMI_6:17
theorem Th18: :: AMI_6:18
theorem Th19: :: AMI_6:19
theorem Th20: :: AMI_6:20
theorem Th21: :: AMI_6:21
theorem Th22: :: AMI_6:22
theorem Th23: :: AMI_6:23
theorem Th24: :: AMI_6:24
theorem Th25: :: AMI_6:25
theorem Th26: :: AMI_6:26
theorem Th27: :: AMI_6:27
theorem Th28: :: AMI_6:28
theorem Th29: :: AMI_6:29
theorem Th30: :: AMI_6:30
theorem Th31: :: AMI_6:31
theorem Th32: :: AMI_6:32
theorem Th33: :: AMI_6:33
theorem Th34: :: AMI_6:34
theorem Th35: :: AMI_6:35
theorem Th36: :: AMI_6:36
theorem Th37: :: AMI_6:37
theorem Th38: :: AMI_6:38
theorem Th39: :: AMI_6:39
Lemma43:
for b1 being Instruction-Location of SCM
for b2 being Instruction of SCM st ( for b3 being State of SCM st IC b3 = b1 & b3 . b1 = b2 holds
(Exec b2,b3) . (IC SCM ) = Next (IC b3) ) holds
NIC b2,b1 = {(Next b1)}
Lemma44:
for b1 being Instruction of SCM st ( for b2 being Instruction-Location of SCM holds NIC b1,b2 = {(Next b2)} ) holds
JUMP b1 is empty
theorem Th40: :: AMI_6:40
theorem Th41: :: AMI_6:41
theorem Th42: :: AMI_6:42
theorem Th43: :: AMI_6:43
theorem Th44: :: AMI_6:44
theorem Th45: :: AMI_6:45
theorem Th46: :: AMI_6:46
theorem Th47: :: AMI_6:47
theorem Th48: :: AMI_6:48
theorem Th49: :: AMI_6:49
theorem Th50: :: AMI_6:50
theorem Th51: :: AMI_6:51
theorem Th52: :: AMI_6:52
theorem Th53: :: AMI_6:53
theorem Th54: :: AMI_6:54
theorem Th55: :: AMI_6:55
theorem Th56: :: AMI_6:56
registration
let c1,
c2 be
Data-Location ;
cluster a1 := a2 -> non
jump-only sequential ;
coherence
( not c1 := c2 is jump-only & c1 := c2 is sequential )
cluster AddTo a1,
a2 -> non
jump-only sequential ;
coherence
( not AddTo c1,c2 is jump-only & AddTo c1,c2 is sequential )
cluster SubFrom a1,
a2 -> non
jump-only sequential ;
coherence
( not SubFrom c1,c2 is jump-only & SubFrom c1,c2 is sequential )
cluster MultBy a1,
a2 -> non
jump-only sequential ;
coherence
( not MultBy c1,c2 is jump-only & MultBy c1,c2 is sequential )
cluster Divide a1,
a2 -> non
jump-only sequential ;
coherence
( not Divide c1,c2 is jump-only & Divide c1,c2 is sequential )
end;
theorem Th57: :: AMI_6:57
theorem Th58: :: AMI_6:58
theorem Th59: :: AMI_6:59