Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
sav08:analyses_based_on_formulas [2008/05/21 10:21] vkuncak |
sav08:analyses_based_on_formulas [2009/04/08 01:19] vkuncak |
||
|---|---|---|---|
| Line 5: | Line 5: | ||
| ===== Fixpoint Approach ===== | ===== Fixpoint Approach ===== | ||
| - | Let the domain be the set of formulas, ordered by implication | + | Let the domain be the set of quantifier-free formulas of first-order logic, ordered by implication |
| Is this a partial order? ++|We would need to do a quotient construction to obtain it.++ | Is this a partial order? ++|We would need to do a quotient construction to obtain it.++ | ||
| Line 14: | Line 14: | ||
| \] | \] | ||
| In general, a logic that can represent exact limits needs to express the conditions such as "there exists a sequence of statements that produces the given state". | In general, a logic that can represent exact limits needs to express the conditions such as "there exists a sequence of statements that produces the given state". | ||
| + | |||
| ==== Approximation ==== | ==== Approximation ==== | ||
| Line 39: | Line 40: | ||
| To make it less syntactic: deduce some consequences of the conjunction (taken from a finite set). | To make it less syntactic: deduce some consequences of the conjunction (taken from a finite set). | ||
| + | |||
| + | === References === | ||
| + | |||
| + | * [[http://citeseer.ist.psu.edu/244634.html|Safety Checking of Machine Code]] described induction iteration method (wp instead of sp) | ||
| + | * analysis based on sets in the Hob analysis system | ||
| ===== Constraint-Based Approach ===== | ===== Constraint-Based Approach ===== | ||