|
|
|
|
|
|
by tom_mellior
3318 days ago
|
|
|
Decidability doesn't necessarily imply the absence of "optimization deficiencies". Many program analyses make approximations not (only) because of undecidability but simply due to complexity issues. Even in decidable languages it's trivial to write programs with an exponential number of code paths, which forces analyzers to make approximations. |
|
|