brozek/website
1
0
Fork 0
mirror of https://github.com/Brandon-Rozek/website.git synced 2025-10-10 06:51:13 +00:00
Code Issues Projects Releases Packages Activity

Medium syndication information

Browse source
This commit is contained in:
Brandon Rozek 2023-01-05 14:04:45 -05:00
parent e5a96d735a
commit c5ff5538a6
No known key found for this signature in database
GPG key ID: 26E457DA82C9F480
276 changed files with 371 additions and 80 deletions
Download patch file Download diff file Expand all files Collapse all files

1
content/blog/proving-loop-invariants.md
View file

@ -4,6 +4,7 @@ date: 2022-02-26T19:17:21-05:00
draft: false
tags: ["Formal Methods"]
math: true
medium_enabled: true
---
Loop invariants are one of the more complicated concepts in Hoare Logic. One might say that we can simply unroll the loop, but there are many loops where we don't know the number of iterations in advanced. Therefore, we often consider what is called the loop invariant. These are statements that are true before, during, and after the loop. A useful loop invariant in combination of the negation of the loop condition can also prove some postcondition. Lets look at a multiplication example