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 | ||
sav07_lecture_3_skeleton [2007/03/20 18:06] vkuncak |
sav07_lecture_3_skeleton [2007/03/20 18:21] wikiadmin |
||
---|---|---|---|
Line 2: | Line 2: | ||
===== Converting programs (with simple values) to formulas ===== | ===== Converting programs (with simple values) to formulas ===== | ||
+ | |||
Line 11: | Line 12: | ||
* represent programs using guarded command language, e.g. desugaring of 'if' into non-deterministic choice and assume | * represent programs using guarded command language, e.g. desugaring of 'if' into non-deterministic choice and assume | ||
* give meaning to guarded command language statements as relations | * give meaning to guarded command language statements as relations | ||
- | * we can represent relations using set comprehensions; if our program c has two state components, we can represent its meaning R( c ) as | + | * we can represent relations using set comprehensions; if our program c has two state components, we can represent its meaning R( c ) as |
- | <latex> | + | |
- | \{((x_0,y_0),(x,y)) \mid F \} | + | $\{((x_0,y_0),(x,y)) \mid F \}$ |
- | </latex> | + | |
- | where F is some formula that has x,y,x_0,y_0 as free variables. | + | , where F is some formula that has x,y,x_0,y_0 as free variables. |
* this is what I mean by ''simple values'': later we will talk about modeling pointers and arrays, but we will still use this as a starting point. | * this is what I mean by ''simple values'': later we will talk about modeling pointers and arrays, but we will still use this as a starting point. | ||
Line 24: | Line 25: | ||
* efficient | * efficient | ||
* create formulas that we can effectively prove later | * create formulas that we can effectively prove later | ||
+ | |||
What exactly do we prove about the formula R( c ) ? | What exactly do we prove about the formula R( c ) ? | ||
Line 121: | Line 123: | ||
* Specializing PA bounds: http://www.lmcs-online.org/ojs/viewarticle.php?id=43&layout=abstract | * Specializing PA bounds: http://www.lmcs-online.org/ojs/viewarticle.php?id=43&layout=abstract | ||
+ | |||
+ | |||
+ | |||
+ | Test : \\ | ||
+ | \begin{eqnarray*} | ||
+ | \Psi_0 &=& -C_{abcd} Y_0^a m^b Y_1^c m^d e^{-2i\gamma} \\ | ||
+ | \Psi_4 &=& -C_{abcd} Y_1^a \bar{m}^b Y_1^c \bar{m}^d e^{2i\gamma} | ||
+ | \end{eqnarray*} |