МОЛОДЕЖНЫЙ НАУЧНО-ТЕХНИЧЕСКИЙ ВЕСТНИК

Файл статьи: Дикопалова Т.С..pdf (222.13Кб)

1.     Lankford D.S. Tech. Report «On proving term rewriting systems are Noetherian». LA: Louisiana Technical University, 1979. 21 p.

2.     Kamin S., Levy J.J. Tech. Report «Two generalizations of the recursive path ordering». IL: University of Illinois, 1980. 26 p.

3.     Arts T., Giesl J. Termination of term rewriting using dependency pairs // Theoretical Computer Science. 2000. Vol. 236. P. 133–178.

 4.     Dershowitz N., Hoot C. Natural termination // Theoret. Comput. Sci. 1995. Vol. 142(2). P. 179 – 207.

5.     Plaisted D.A. Tech. Report R-78-943 «A recursively defined ordering for proving termination of term rewriting systems». IL: University of Illinois, 1978. 52 p.

6.     Bachmair L., Dershowitz N. Commutation, transformation and termination // The 8th international conference on Automated deduction: proceedings. NY: Springer-Verlag, 1986. Vol. 230. P. 5 – 20.

7.     Zantema H. Termination of term rewriting by semantic labelling // Fund. Inform. 1995. Vol. 24. P. 89 –105.

8.     Falke S., Kapur D., Sinz C. Termination Analysis of Imperative Programs Using Bitvector Arithmetic // The 4th international conference on Verified Software: theories, tools, experiments: proceedings. Berlin: Springer-Verlag, 2012. P. 261-277.

9.     Dershowitz N. Orderings for term-rewriting systems // Theoret. Comput. Sci. 1982. Vol. 17. P. 279 –301.

10. Cook B., Kroening D., Rummer P., Wintersteiger C.M. Ranking function synthesis for bit-vector relations // The 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems: proceedings. 2010. Vol. 6015. P. 236–250.