Skip to content

[hermes] Optimize verification of examples #3230

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
joshlf wants to merge 1 commit into
base: main
Choose a base branch
from
Open

[hermes] Optimize verification of examples #3230

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 24 additions & 4 deletions hermes/examples/abs.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,16 +7,36 @@
/// ensures (h2): (x : Int) < 0 -> (ret : Int) = -x
/// proof (h_progress):
/// unfold abs
/// split <;> intros <;> (try cases h_req) <;> (try have := Aeneas.Std.IScalar.hmin x) <;> (try have := Aeneas.Std.IScalar.hmax x) <;> (try have : (↑(0 : I32) : Int) = 0 := by rfl) <;> (try have h_bound := Aeneas.Std.IScalar.tryMk_eq IScalarTy.I32 (-↑x)) <;> (try split at h_bound) <;> (try simp_all [HNeg.hNeg, Aeneas.Std.IScalar.neg, Aeneas.Std.IScalar.inBounds]) <;> scalar_tac
/// cases h_req
/// have : (↑(0 : I32) : Int) = 0 := by rfl
/// have := Aeneas.Std.IScalar.hmin x
/// have := Aeneas.Std.IScalar.hmax x
/// split
/// Β· have h_bound := Aeneas.Std.IScalar.tryMk_eq IScalarTy.I32 (-↑x)
/// split at h_bound <;> (try simp_all [HNeg.hNeg, Aeneas.Std.IScalar.neg]); (try scalar_tac)
/// Β· simp_all
/// proof (h0):
/// unfold abs at h_returns
/// split at h_returns <;> intros <;> (try cases h_req) <;> (try have := Aeneas.Std.IScalar.hmin x) <;> (try have := Aeneas.Std.IScalar.hmax x) <;> (try have : (↑(0 : I32) : Int) = 0 := by rfl) <;> (try have h_bound := Aeneas.Std.IScalar.tryMk_eq IScalarTy.I32 (-↑x)) <;> (try split at h_bound) <;> (try simp_all [HNeg.hNeg, Aeneas.Std.IScalar.neg, Aeneas.Std.IScalar.inBounds]) <;> scalar_tac
/// have : (↑(0 : I32) : Int) = 0 := by rfl
/// have := Aeneas.Std.IScalar.hmin x
/// have := Aeneas.Std.IScalar.hmax x
/// split at h_returns
/// Β· have h_bound := Aeneas.Std.IScalar.tryMk_eq IScalarTy.I32 (-↑x)
/// split at h_bound <;> (try simp_all [HNeg.hNeg, Aeneas.Std.IScalar.neg]); (try scalar_tac)
/// Β· simp_all
/// proof (h1):
/// unfold abs at h_returns
/// split at h_returns <;> intros <;> (try cases h_req) <;> (try have := Aeneas.Std.IScalar.hmin x) <;> (try have := Aeneas.Std.IScalar.hmax x) <;> (try have : (↑(0 : I32) : Int) = 0 := by rfl) <;> (try have h_bound := Aeneas.Std.IScalar.tryMk_eq IScalarTy.I32 (-↑x)) <;> (try split at h_bound) <;> (try simp_all [HNeg.hNeg, Aeneas.Std.IScalar.neg, Aeneas.Std.IScalar.inBounds]) <;> scalar_tac
/// have : (↑(0 : I32) : Int) = 0 := by rfl
/// split at h_returns <;> simp_all
/// proof (h2):
/// unfold abs at h_returns
/// split at h_returns <;> intros <;> (try cases h_req) <;> (try have := Aeneas.Std.IScalar.hmin x) <;> (try have := Aeneas.Std.IScalar.hmax x) <;> (try have : (↑(0 : I32) : Int) = 0 := by rfl) <;> (try have h_bound := Aeneas.Std.IScalar.tryMk_eq IScalarTy.I32 (-↑x)) <;> (try split at h_bound) <;> (try simp_all [HNeg.hNeg, Aeneas.Std.IScalar.neg, Aeneas.Std.IScalar.inBounds]) <;> scalar_tac
/// have : (↑(0 : I32) : Int) = 0 := by rfl
/// have := Aeneas.Std.IScalar.hmin x
/// have := Aeneas.Std.IScalar.hmax x
/// split at h_returns
/// Β· have h_bound := Aeneas.Std.IScalar.tryMk_eq IScalarTy.I32 (-↑x)
/// split at h_bound <;> (try simp_all [HNeg.hNeg, Aeneas.Std.IScalar.neg])
/// Β· simp_all
/// ```
pub unsafe fn abs(x: i32) -> i32 {
if x < 0 { -x } else { x }
Expand Down
Loading