Re: Are there any tools that can compare two source files

nmm1@cus.cam.ac.uk (Nick Maclaren)
19 Dec 2001 23:59:26 -0500

          From comp.compilers

Related articles
Are there any tools that can compare two source files satyanandam_g@hotmail.com (2001-12-07)
Re: Are there any tools that can compare two source files joachim_d@gmx.de (Joachim Durchholz) (2001-12-11)
Re: Are there any tools that can compare two source files sarath_kumar@mentorg.com (Sarath Kumar) (2001-12-15)
Re: Are there any tools that can compare two source files nmm1@cus.cam.ac.uk (2001-12-19)
Re: Are there any tools that can compare two source files joachim_d@gmx.de (Joachim Durchholz) (2001-12-20)
Re: Are there any tools that can compare two source files torbenm@eir.diku.dk (2001-12-20)
Re: Are there any tools that can compare two source files Martin.Ward@durham.ac.uk (2001-12-20)
Re: Are there any tools that can compare two source files thp@cs.ucr.edu (2001-12-20)
Re: Are there any tools that can compare two source files idbaxter@semdesigns.com (Ira D. Baxter) (2001-12-22)
Re: Are there any tools that can compare two source files tej@melbpc.org.au (Tim Josling) (2001-12-22)
| List of all articles for this month |
From: nmm1@cus.cam.ac.uk (Nick Maclaren)
Newsgroups: comp.compilers
Date: 19 Dec 2001 23:59:26 -0500
Organization: University of Cambridge, England
References: 01-12-027 01-12-058
Keywords: tools, theory
Posted-Date: 19 Dec 2001 23:59:26 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?? As the
>theorists go this is very tough and not possible in polynomial time.


It is not possible. Not even in exponential time. It is at least as
hard as deciding whether they will halt (for obvious reasons).


> If there is one such tool then send them down, i will love to look
>at it.


BANG! Sound from up on high:


        Mortal. Do not presume. Solving the Halting Problem is My
        Prerogative.


More seriously, I believe that the canonical rearrangement problem IS
soluble, and I am surprised that there aren't more tools to do it.
This is because it has two important uses:


        1) Signatures for separately compiled codes, to determine
whether rebuilding is necessary.


        2) Checking for the inheritance of codes, especially in a
copyright context.


Regards,
Nick Maclaren,
University of Cambridge Computing Service,
New Museums Site, Pembroke Street, Cambridge CB2 3QH, England.
Email: nmm1@cam.ac.uk
Tel.: +44 1223 334761 Fax: +44 1223 334679


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.