|Looking for data flow analysis references email@example.com (1990-09-07)|
|From:||firstname.lastname@example.org (Kwang-Keun Yi)|
|Organization:||Center for Supercomputing R&D|
|Date:||7 Sep 90 09:25:46|
Hi everybody. I'm looking for research reports on some topic.
In paper "A Flexible Approach to Interprocedural Data flow Analysis
and Programs with Recursive Data Structures" by Neil Jones and Steven
Muchnick of POPL '82, they mentioned in the conclusion section that
"Two areas of investigation that appear fruitful are to consider how
the computational complexity of the analyzer varies with the choice
of token set and the the feasibility of building an analyzer with
the choice of token set as a parameter."
Can somebody help me to find papers on the investigations?
I would be pretty much appreciated.
Kwangkeun Yi Center for Supercomputing R & D
email@example.com Univ. of Illinois, 305 Talbot Lab
104 S.Wright St, Urbana, IL61801
Return to the
Search the comp.compilers archives again.