Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
sav08:forward_symbolic_execution [2009/03/11 10:48] vkuncak |
sav08:forward_symbolic_execution [2009/03/11 14:35] vkuncak |
||
|---|---|---|---|
| Line 42: | Line 42: | ||
| Special case: if initial condition specifies values of variables, then we know which branch to enter. | Special case: if initial condition specifies values of variables, then we know which branch to enter. | ||
| + | |||
| ===== Symbolic Execution Rules ===== | ===== Symbolic Execution Rules ===== | ||
| Line 74: | Line 75: | ||
| assume(F) | assume(F) | ||
| change state: | change state: | ||
| - | P := P & F | + | P := P & F[x<-e_x, y<-e_y] |
| === Havoc === | === Havoc === | ||
| Line 153: | Line 154: | ||
| ===== References ===== | ===== References ===== | ||
| - | * [[http://doi.acm.org/10.1145/360248.360252|Symbolic execution and program testing]] by James C. King | + | * [[http://doi.acm.org/10.1145/360248.360252|Symbolic execution and program testing]] by James C. King ({{sav08:king76symbolicexecution.pdf|pdf}}) |
| * Lori Clarke and Debra Richardson: Symbolic Evaluation Methods for Program Analysis, in Program Flow Analysis: Theory and Applications, Prentice-Hall 1981. | * Lori Clarke and Debra Richardson: Symbolic Evaluation Methods for Program Analysis, in Program Flow Analysis: Theory and Applications, Prentice-Hall 1981. | ||
| * [[http://www.cs.utexas.edu/users/sandip/publications/symbolic-lpar/main.html|Verification Condition Generation via Theorem Proving]] | * [[http://www.cs.utexas.edu/users/sandip/publications/symbolic-lpar/main.html|Verification Condition Generation via Theorem Proving]] | ||
| * [[http://osl.cs.uiuc.edu/~ksen/cute/|CUTE Tool]] | * [[http://osl.cs.uiuc.edu/~ksen/cute/|CUTE Tool]] | ||