Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
sav08:summary_of_hoare_logic [2008/03/05 10:53] vkuncak |
sav08:summary_of_hoare_logic [2008/03/05 10:55] vkuncak |
||
|---|---|---|---|
| Line 118: | Line 118: | ||
| In a program of size $n$, what is the ++bound on the number of basic paths?| it can be $2^{O(n)}$++ | In a program of size $n$, what is the ++bound on the number of basic paths?| it can be $2^{O(n)}$++ | ||
| + | |||
| + | ++Choice of annotations?|If we put annotations after if statements, we avoid exponential explosion.++ | ||
| + | |||
| ===== Further reading ===== | ===== Further reading ===== | ||