Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Next revision Both sides next revision | ||
sav07_lecture_21 [2009/05/27 01:48] vkuncak |
sav07_lecture_21 [2009/05/27 09:51] vkuncak |
||
---|---|---|---|
Line 1: | Line 1: | ||
====== Lecture 21: More on interprocedural analysis ====== | ====== Lecture 21: More on interprocedural analysis ====== | ||
+ | |||
+ | The idea is to avoid having to specify contracts for all procedures | ||
+ | * abstract interpretation for general case (precision depends on the example) | ||
+ | * decidability results: no approximation, but works for restricted classes of programs (which can be obtained by abstract interpretation) | ||
=== Analysis of regular properties of finite-state programs with stack (push down systems) === | === Analysis of regular properties of finite-state programs with stack (push down systems) === |