This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: Need graph coloring code
- Subject: Re: Need graph coloring code
- From: Andy Walker <jawalker at stl dot quik dot com>
- Date: Tue, 23 Jan 2001 20:19:29 -0600
- CC: gcc at gcc dot gnu dot org
- References: <20010123060444.6360A34D80@nile.gnat.com>
- Reply-To: jawalker at mail dot quik dot com
Um ... I don't read the statutes and case law that way. In fact, I read it
exactly the opposite way: substantial improvements of the original algorithm
are specifically covered by the original patent.
The usual trick is to "code around" the patents by examining them, finding
another similar, but different way to do it, and use that instead. Trial
courts are usually favorably impressed by sincere attempts to "code around"
patents, and are more willing to find that such are not covered by the patent.
IMHO bright programmers often have tremendous opportunities and capacity to do
this.
Andy
dewar@gnat.com wrote:
> <<But the problem is IBM *patented* the use of graph coloring for register
> allocation, which trumps copyright.
> >>
>
> Well a patent is for a very particular algorithm, generally speaking any
> substantial improvement of the original algorithm is not covered by the
> original patent.