Olin Shivers' k-CFA stuff also computes call flow graphs (and can infer types, and can determine when garbage can be released).
A starting point might be here: http://matt.might.net/articles/implementation-of-kcfa-and-0cfa/ frank On 6 July 2015 at 14:30, Francisco Garau <[email protected]> wrote: > Hi Nevena > > To compute the control flow graph you would need to do concrete type > inference. > > Search for Ole Agesen PhD thesis to have an idea what's that about. > > I've started a smalltalk implementation of his ideas in 2001 but never got > beyond the proof of concept stage. I can forward the presentation slides > later tonight. > > Cheers > - Francisco > > >> On 6 Jul 2015, at 12:21, Nevena Milojkovic <[email protected]> wrote: >> >> Hi all, >> >> Can anybody point me towards some tool/paper with the possibility to >> construct Control Flow Graph for Smalltalk? >> >> Cheers, >> Nevena >> >> ———————— >> Nevena Milojkovic >> Research assistant >> Software Composition Group >> Institute of Computer Science and Applied Mathematics >> University of Bern >> >> email: [email protected] >> office phone: +41 (0)31 511 7639 >> webpage: http://scg.unibe.ch/staff/Milojkovic >> >> >> >> >> >> >
