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

Gallagher John P., Puebla German

Research output: Working paper

Fingerprint

Dive into the research topics of 'Abstract Interpretation over Non-Deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs'. Together they form a unique fingerprint.

Computer Science