Path: utzoo!utgpu!attcan!uunet!lll-winken!lll-ncis!helios.ee.lbl.gov!pasteur!ucbvax!decwrl!labrea!rutgers!njin!princeton!phoenix!haahr
From: haahr@phoenix.Princeton.EDU (Paul Gluckauf Haahr)
Newsgroups: comp.lang.misc
Subject: Re: Clever programming tricks wanted
Message-ID: <5345@phoenix.Princeton.EDU>
Date: 13 Jan 89 02:09:49 GMT
References: <4061@hubcap.UUCP> <47380@yale-celray.yale.UUCP>
Reply-To: haahr@princeton.edu (Paul Gluckauf Haahr)
Organization: Princeton University, Princeton NJ
Lines: 11

In article <47380@yale-celray.yale.UUCP> wald-david@CS.YALE.EDU (david wald) writes:
 Essentially, the generator would be given a description of a common
> function (say, min() or max() or some such), and would then attempt to
> generate the shortest-length sequence of assembly language instructions
> (or perhaps, shortest sequence with fewest branch instructions) that
> would compute the function.

> Does any one recognize this work?  I'll try to dig up the reference.

the super-optimizer.  from the asplos 2 conference, summer 87 i think.
proceedings published as an issue of sigplan notices.