A method for monotonic global data flow analysis in LISP programs is presented. It is shown how this analysis can be used to identify available concurrency in the presence of global side effects, aliasing, and the run time creation of variables.