A study of set-sharing analysis via cliques

Jorge Navas, Francisco Bueno, Manuel Hermenegildo

We study the problem of efficient, scalable set-sharing analysis of logic programs. We use the idea of representing sharing information as a pair of abstract substitutions, one of…