Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
sav08:chaotic_iteration_in_abstract_interpretation [2008/05/20 13:32] vkuncak |
sav08:chaotic_iteration_in_abstract_interpretation [2008/05/20 19:34] vkuncak |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Chaotic Iteration in Abstract Interpretation ====== | + | ====== Chaotic Iteration in Abstract Interpretation: How to compute the fixpoint? ====== |
| In [[Abstract Interpretation Recipe]], note that if the set of program points is $p'_1,\ldots,p'_n$, then we are solving the system of eqautions in $n$ variables $g_1,\ldots,g_n$ | In [[Abstract Interpretation Recipe]], note that if the set of program points is $p'_1,\ldots,p'_n$, then we are solving the system of eqautions in $n$ variables $g_1,\ldots,g_n$ | ||
| 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 ===== | ||