From: | "Joachim Durchholz" <joachim_d@gmx.de> |
Newsgroups: | comp.compilers |
Date: | 20 Dec 2001 00:29:48 -0500 |
Organization: | Compilers Central |
References: | 01-12-027 01-12-058 |
Keywords: | tools, theory |
Posted-Date: | 20 Dec 2001 00:29:48 EST |
Sarath Kumar <sarath_kumar@mentorg.com> wrote:
>
> Generalizing the problem refers to the problem of finding the
> semantic equivalence of two programs. Is this possible??
No. It's not decidable.
If this were possible, one could wrap any program in a function call
that throws any results away and ask whether it's equivalent to a
program that does nothing; this would solve the halting problem.
Of course, if the two programs are sufficiently similar, it might still
be possible to get useful results (as John noted). The problem here is
that this type of semantic analysis and code transformation requires an
*exact* understanding of the language semantics. I wouldn't want to do
this for languages that do not have a formal semantics (needless to say
that many of the more popular languages don't have such a thing).
Regards,
Joachim
Return to the
comp.compilers page.
Search the
comp.compilers archives again.