@INPROCEEDINGS{Hanus08PPDP,
author = "Hanus, M.",
title = "Call Pattern Analysis for Functional Logic Programs",
year = "2008",
pages = "67-78",
publisher = "ACM Press",
booktitle = "Proc.\ of the 10th International ACM SIGPLAN Conference on
             Principle and Practice of Declarative Programming (PPDP'08)"
abstract = {
This paper presents a new program analysis framework to approximate
call patterns and their results in functional logic computations.
We consider programs containing non-strict, nondeterministic
operations in order to make the analysis applicable to modern
functional logic languages like Curry or TOY. For this purpose, we
present a new fixpoint characterization of functional logic
computations w.r.t.\ a set of initial calls.  We show how programs
can be analyzed by approximating this fixpoint.  The results of such
an approximation have various applications, e.g., program
optimization as well as verifying safety properties of programs.
}
}