1. Abstract compilation for sharing analysis;Amato,2001
2. Two classes of Boolean functions for dependency analysis;Armstrong;Science of Computer Programming,1998
3. R. Bagnara, Data-flow analysis for constraint logic-based languages, Ph.D. Thesis, Dipartimento di Informatica, Università di Pisa, 1997
4. Set-Sharing is reduntant for pair-sharing;Bagnara;Theoretical Computer Science,2002
5. The s-semantics approach: theory and applications;Bossi;Journal of Logic Programming,1994