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:chaotic_iteration_in_abstract_interpretation [2008/05/20 13:32] vkuncak |
sav08:chaotic_iteration_in_abstract_interpretation [2008/05/20 18:50] vkuncak |
||
|---|---|---|---|
| Line 72: | Line 72: | ||
| Strongly connected component (SCC) of a directed graph: path between each two nodes of component. | Strongly connected component (SCC) of a directed graph: path between each two nodes of component. | ||
| * compute until fixpoint within each SCC | * compute until fixpoint within each SCC | ||
| + | |||
| + | If we generate control-flow graph from our simple language, what do strongly connected components correspond to? | ||
| ===== References ===== | ===== References ===== | ||