deletions | additions       diff --git a/case-study.tex b/case-study.tex  index 77714bd..eda8e27 100644  --- a/case-study.tex  +++ b/case-study.tex 
...
\begin{itemize}  \item $f$ is an {\tt inline} or an anonymous function defined in $g$;  \item $f$ is the return value from a previous call in $g$ to another function;  %\item $f$ is retrieved from a data structure; structure~\cite{lameed2013feval};  \item $f$ is a constant string containing the name of a user-defined function (a typical inappropriate use of {\tt feval} according to~\cite{radpour2013refactoring}).  \end{itemize}    Lameed and Hendren conclude their paper by stating, ``It would be interesting to look at future work that combine the  strengths of both approaches". In the remaining part of this section, we extend their work by implementing a novel optimization mechanism for {\tt feval} based on our OSR technique that is as efficient as the JIT-based approach in terms of quality of generated code, and is even more general than their OSR-based approach, as it can optimize also {\tt feval} not enclosed in the body of a loop.