9 citations · 11 across the 5 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2010★ 1 cited
Towards Parameterized Regular Type Inference Using Set Constraints
F. Bueno, J. Navas, M. Hermenegildo
We propose a method for inferring \emph{parameterized regular types} for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set const…
cs.LO2005
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…