Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs.

John P. Gallagher, Germn Puebla

Browse the full PADL paper archive.