1. Resolution theorem proving;Bachmair,2001
2. Paths vs. trees in set-based program analysis;Charatonik,2000
3. Logic programs as types for logic programs;Frühwirth,1991
4. Abstraction and resolution modulo AC: How to verify Diffie–Hellman-like protocols automatically;Goubault-Larrecq;J. Logic Algebraic Programming,2004
5. Approximating dependency graphs using tree automata techniques;Middeldorp,2001