1. Ahlem Ben Cherifa and Pierre Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9:137–159, 1987.
2. Leo Bachmair, Nachum Dershowitz, and David A. Plaisted. Completion without failure. In H. Aït-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, volume 2 of Rewriting Techniques, chapter 1. Academic Press, 1989.
3. Reinhard Bündgen, Wolfgang Küchlin, and Werner Lauterbach. Verification of the Sparrow processor. In IEEE Symposium and Workshop on Engineering of Computer-Based Systems. IEEE Press, 1996.
4. Reinhard Bündgen and Werner Lauterbach. Experiments with partial evaluation domains for rewrite specifications. In 11th Workshop on Abstract Data Types, 1996. (Proc. WADT'95, Oslo, N, September 1995, to appear).
5. University of California, Berkeley, CA. Berkeley Logic Interchange Format (BLIF), July 1992.