Execution
Consider the sequential execution of the list of statements, s(i), and what can now be observed as the computation at statement, j:
- A definition at statement s(i) with i < j is alive at j, if it has a use at a statement s(k) with k ≥ j. The set of alive definitions at statement i is denoted as A(i) and the number of alive definitions as |A(i)|. (A(i) is a simple but powerful concept: theoretical and practical results in space complexity theory, access complexity(I/O complexity), register allocation and cache locality exploitation are based on A(i).)
- A definition at statement s(i) kills all previous definitions (s(k) with k < i) for the same variables.
Read more about this topic: Use-define Chain
Famous quotes containing the word execution:
“My weakness has always been to prefer the large intention of an unskilful artist to the trivial intention of an accomplished one: in other words, I am more interested in the high ideas of a feeble executant than in the high execution of a feeble thinker.”
—Thomas Hardy (1840–1928)
“Those who govern, having much business on their hands, do not generally like to take the trouble of considering and carrying into execution new projects. The best public measures are therefore seldom adopted from previous wisdom, but forced by the occasion.”
—Benjamin Franklin (1706–1790)
“If I were asked to chose between execution and life in prison I would, of course, chose the latter. It’s better to live somehow than not at all.”
—Anton Pavlovich Chekhov (1860–1904)