zenon/formal-methods-fstar
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Final

Browse Source
This commit is contained in:
Tobias Eidelpes 2021-06-03 13:54:11 +02:00
parent 7dfc4382c1
commit a40b18f703
1 changed files with 27 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
Project2.fst
View File

@ -93,8 +93,8 @@ let rec wellformed (cs: callstack) =
(* Type for the outcome of a single execution step: either the execution terminated (Stop) as a final state is reached or further execution steps are possible *)
noeq type step_outcome =
| Stop : (cs: callstack) -> step_outcome
| Next : (cs: callstack) -> step_outcome
| Stop : (cs: callstack{wellformed cs}) -> step_outcome
| Next : (cs: callstack{wellformed cs}) -> step_outcome
(* Auxiliary function for applying the effects of terminated states to the underneath execution states *)
val apply_returneffects: (ts: terstate) -> (rs: regstate{isCallState rs}) -> Tot regstate
@ -118,22 +118,22 @@ let step te cs =
if gas < 1 then Next (Ter ExcState ps)
else
match (getOpcode code pc, stack) with
| (ADD, a::b::stack') -> Next (Exec(((gas-1, pc+1, mem, (a+b):: stack'), (actor, input, code), gs)::ps))
| (ADD, a::b::stack') -> Next (Exec(((gas-1, pc+1, mem, (a+b):: stack'), (actor, input, code), gs) :: ps))
| (AND, a::b::stack') -> let c = (if a > 0 && b > 0 then 1 else 0) in
Next (Exec(((gas-1, pc+1, mem, c::stack'), (actor, input, code), gs)::ps))
Next (Exec(((gas-1, pc+1, mem, c::stack'), (actor, input, code), gs) :: ps))
| (LE, a::b::stack') -> let c = (if a <= b then 1 else 0) in
Next (Exec(((gas-1, pc+1, mem, c::stack'), (actor, input, code), gs)::ps))
Next (Exec(((gas-1, pc+1, mem, c::stack'), (actor, input, code), gs) :: ps))
| (PUSH x, stack') -> Next (Exec(((gas-1, pc+1, mem, x::stack'), (actor, input, code), gs)::ps))
| (POP, x::stack') -> Next (Exec(((gas-1, pc+1, mem, stack') (actor, input, code), gs)::ps))
| (POP, x::stack') -> Next (Exec(((gas-1, pc+1, mem, stack'), (actor, input, code), gs) :: ps))
| (MSTORE, p::v::stack') -> Next (Exec(((gas-1, pc+1, update mem p v, stack'), (actor, input, code), gs)::ps))
| (MLOAD, p::stack') -> let v = (mem p) in
Next (Exec(((gas-1, pc+1, mem, v::stack'), (actor, input, code), gs')::ps))
Next (Exec(((gas-1, pc+1, mem, v::stack'), (actor, input, code), gs)::ps))
| (SSTORE, p::v::stack') -> let acc = (let (bal, stor, code) = gs actor in (bal, update stor p v, code)) in
let gs' = update gs actor acc in
Next (Exec(((gas-1, pc+1, mem, stack'), (actor, input, code), gs')::ps))
| (SLOAD, v::stack') -> Next (Exec(((gas-1, pc+1, mem, (let (bal, stor, code) = gs actor in stor v)::stack'), (actor, input, code), gs)::ps))
| (BALANCE, a::stack') -> let (bal, _, _) = (gs a) in
Next (Exec(((gas-1, pc+1, mem, bal::stack'), (actor, input, code), gs')::ps))
Next (Exec(((gas-1, pc+1, mem, bal::stack'), (actor, input, code), gs)::ps))
| (ADDRESS, stack') -> Next (Exec(((gas-1, pc+1, mem, actor::stack'), (actor, input, code), gs)::ps))
| (INPUT, stack') -> Next (Exec(((gas-1, pc+1, mem, input::stack'), (actor, input, code), gs)::ps))
| (GAS, stack') -> Next (Exec(((gas-1, pc+1, mem, gas::stack'), (actor, input, code), gs)::ps))
@ -226,7 +226,11 @@ let rec nsteps_stop n te cs =
if n = 0 then () else nsteps_stop (n-1) te (step_simp te cs)
(* Prove that if a call stack does not change within one step then it must be final. Formulate first the Lemma and then prove it *)
(* val progress: *)
val progress: (te:tenv) -> (cs: callstack{wellformed cs}) ->
Lemma (requires (cs == step_simp te cs))
(ensures (isFinal cs))
let rec progress te cs =
()
(* 3.4: Uniqueness of callstack *)
@ -256,8 +260,7 @@ let rec callstacks_unique n te cs cs' =
val exception_prop: (te:tenv) -> (ps:plaincallstack) ->
Lemma (requires (wellformed (Ter ExcState ps)))
(ensures (nsteps (op_Multiply 2 (length ps)) te (Ter ExcState ps) == (Ter ExcState [])))
let rec exception_prop te ps =
match ps with
let rec exception_prop te ps = match ps with
| [] -> ()
| _ :: ps' -> exception_prop te ps'