|Anyone recognise this book firstname.lastname@example.org (1998-09-26)|
|Re: Anyone recognise this book email@example.com (Michael McKernan) (1998-09-29)|
|From:||firstname.lastname@example.org (A Johnstone)|
|Date:||26 Sep 1998 01:25:58 -0400|
|Organization:||Royal Holloway, University of London|
I have notes from year ago concerning a book on control and dataflow
analysis, but I've lost the reference. Can anybody recognise it? The
2. Preliminary background
3. Flow graphs, dominance, reducibility by intervals
and depth-first spanning trees
4. Characterizations of reducible flow-graphs
5. Node orders, node listings
6. Node splitting
7. Some simple iterative algorithms for data flow analysis
8. Interval analysis
9. Monotone dataflow analysis frameworks
10. A modest quad improver for SIMPL-T
As you can see from this list, the book was an absolute goldmine of
information and was also very readable. Judging from the bibliography
it was published in the late 70's. I'd be very grateful for any pointers
to this and related books.
Dr Adrian Johnstone, Senior Lecturer in Computing, Computer Science Dep,
Royal Holloway, University of London, Egham, Surrey, TW20 0EX, England.
Email email@example.com Tel:+44(0)1784 443425 Fax:+44(0)1784 439786
[I believe that SIMPL-T was done by Victor Basili, so you might ask him.
Return to the
Search the comp.compilers archives again.