Abstract Interpretation over Non-Deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs (2002)

by John P. Gallagher , Germán Puebla
Venue:In Fourth International Symposium on Practical Aspects of Declarative Languages, number 2257 in LNCS
Citations:30 - 11 self