| |
| | [No title] (Site not responding. Last check: 2007-10-19) |
 | | Formally, can give a dynamic semantics (usually operational), e.g., set of transition rules, for language, which defines safe and unsafe behavior. |
 | | Note: Static checks constrain programming style, since some (dynamically) safe programs are bound to be rejected by (conservative) static checkers. |
 | | What happens when we translate from an abstract machine (like JVM) or other IR to real machine code (optimizing as we go?) Want to guarantee safety (more specifically: that abstractions are respected) at machine code leval, again by static checks. |
| www.cs.pdx.edu /~apt/cs577_2002/lecture17.txt (532 words) |
|