- -

Solving polynomial constraints for proving termination of rewriting

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Solving polynomial constraints for proving termination of rewriting

Show full item record

Navarro Marset, RA. (2008). Solving polynomial constraints for proving termination of rewriting. http://hdl.handle.net/10251/13626

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/13626

Files in this item

Item Metadata

Title: Solving polynomial constraints for proving termination of rewriting
Author: Navarro Marset, Rafael Andrés
Director(s): Lucas Alba, Salvador
UPV Unit: Universitat Politècnica de València. Servicio de Alumnado - Servei d'Alumnat
Read date / Event date:
2008-12
Issued date:
Abstract:
A termination problem can be transformed into a set of polynomial constraints. Up to now, several approaches have been studied to deal with these constraints as constraint solving problems. In this thesis, we study in depth ...[+]
Subjects: Termination , Term rewriting , Polynomial ordering
Copyrigths: Reserva de todos los derechos
degree: Máster Universitario en Ingeniería del Software, Métodos Formales y Sistemas de Información-Màster Universitari en Enginyeria del Programari, Mètodes Formals i Sistemes d'Informació
Type: Tesis de máster

This item appears in the following Collection(s)

Show full item record