4 ms·
If your language has pointers or aliases, precise call graphs are exceedingly expensive (for large programs), because you need a precise pointer or alias analys
by foobarbazqux 13y ago
If your language has pointers or aliases, precise call graphs are exceedingly expensive (for large programs), because you need a precise pointer or alias analysis. Do you have a link to a publication about the technique you describe?
- larsberg 13y agoThere are meatier technical presentations around about the formal bounds, but I always recommend Manuel Serrano's early work, which is much more accessible than more modern presentations (my own included): http://dl.acm.org/citation.cfm?id=315891.315934 http://dl.acm.org/citation.cfm?id=315891.315934 A good survey of many of the tricks used in practice (and the formal techniques, as well) is available in Jan Midtgaard's tome, which was finally published in the last year or so: http://dl.acm.org/citation.cfm?id=2187671.2187672 http://dl.acm.org/citation.cfm?id=2187671.2187672
- foobarbazqux 13y agoCool, thanks. I wasn't clear whether you were talking about functional programs, but I can believe that it works for them.