81 search results - page 17 / 17 » On the verification of polynomial system solvers |
TRIER
2002
13 years 4 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...