1. [1] F. Baader and T. Nipkow, Term Rewriting and All That, Cambridge University Press, 1998.
2. [2] B. Beizer, Software Testing Techniques, 2nd ed., International Thomson Computer Press, 1990.
3. [3] S. Bensalem, D. Peled, H. Qu, S. Tripakis, and L.D. Zuck, “Test case generation for ultimately periodic paths, ” Haifa Verification Conference 2007 (HVC 2007), LNCS 4899, pp.120-135, 2008.
4. [4] D. Beyer, A. Chlipala, T. Henzinger, R. Jhala, and R. Majumdar, “Generating tests from counterexamples, ” Proc. 26th International Conference on Software Engineering (ICSE 2004), pp.326-335, 2004.
5. [5] A.D. Brucker and B. Wolff, “Symbolic test case generation for primitive recursive functions, ” Proc. 4th International Workshop on Formal Approaches to Software Testing (FATES 2004), Lecture Notes in Computer Science, vol.3395, pp.16-32, Springer-Verlag, 2004.