|
|
|
|
|
|
by zeckalpha
3938 days ago
|
|
|
That sounds like an optimization pass of a compiler. I'm not convinced it's meaningfully different. My background is linguistics, so perhaps I'm biased to see everything as a compiler. However, automata theory generally provides a similar perspective. |
|
|
It is because the problems and algorithms involved are completely different. An optimizer might address some of those problems in the generated code; it may be a solver for some of those problems (e.g. register allocation, which is one kind of a scheduling -- i.e. resource allocation -- problem), but it is not itself a solution to scheduling and coherence problems.
As evidence, I'd offer the fact that the verification of online programs requires temporal logic (which is strictly more powerful than, say, session types) -- Esterel itself is based on temporal logic, and TLA+ uses temporal logic to verify algorithms used in online programs -- while, AFAIK, no temporal logic is required to verify a compiler. That their verification requires different logic shows that they solve a qualitatively different problem.