Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Next revision Both sides next revision | ||
sav08:summary_of_hoare_logic [2008/03/04 22:05] vkuncak |
sav08:summary_of_hoare_logic [2008/03/04 22:10] vkuncak |
||
---|---|---|---|
Line 115: | Line 115: | ||
* generate simple verification conditions | * generate simple verification conditions | ||
* prove each of the simple verification conditions | * prove each of the simple verification conditions | ||
+ | |||
+ | In a program of size $n$, what is the ++bound on the number of basic paths?| it can be $2^{O(n)}$++ | ||
===== Further reading ===== | ===== Further reading ===== |