|Help on smart recompilation firstname.lastname@example.org (Clement Cheung) (1992-02-13)|
|Re: Help on smart recompilation email@example.com (1992-02-16)|
|Re: Help on smart recompilation firstname.lastname@example.org (1992-02-16)|
|Re: Help on smart recompilation email@example.com (1992-02-17)|
|Re: Help on smart recompilation firstname.lastname@example.org (1992-02-17)|
|Smart Recompilation email@example.com (1992-02-20)|
|From:||Clement Cheung <firstname.lastname@example.org>|
|Date:||Thu, 13 Feb 92 16:16:10 EST|
I got hold on two papers on smart recompilation. And I quote "Smart
recompilation is the method of reducing the set of modules that must be
recompiled after a change. The method determines whether recompilation is
necessary by isolating the differences among program modules and analyzing
the effect of changes." Those papers dated back to 1986. I am wondering
if somebody reading this group will point me to recent research in this
topic or a related topic.
Please email your responses and I will summarize the results.
[There was a related paper on incremental linking in the Jan '91 TOPLAS, but
it described work from 1987. See messages 91-03-090 and 91-03-078. Many
people are satisfied with "make" though I can imagine that there may be places
where the effort to determine that a change is benign is less than the effort
to recompile. Also note that making compilers compile faster like Thompson's
Plan 9 C compiler does satisfies many of the same goals. -John]
Return to the
Search the comp.compilers archives again.