- -

2D Dependency Pairs for Proving Operational Termination of CTRSs

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

2D Dependency Pairs for Proving Operational Termination of CTRSs

Show full item record

Lucas Alba, S.; Meseguer, J. (2014). 2D Dependency Pairs for Proving Operational Termination of CTRSs. En Rewriting Logic and Its Applications. Springer Verlag (Germany). 195-212. doi:10.1007/978-3-319-12904-4_11

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

Files in this item

Item Metadata

Title: 2D Dependency Pairs for Proving Operational Termination of CTRSs
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Issued date:
Abstract:
The notion of *operational termination* captures nonterminating computations due to subsidiary processes that are necessary to issue a *single* `main' step but which often remain `hidden' when the main computation sequence ...[+]
Subjects: Conditional term rewriting , Dependency pairs , Program analysis , Operational termination
Copyrigths: Reserva de todos los derechos
Source:
Rewriting Logic and Its Applications. (issn: 0302-9743 )
DOI: 10.1007/978-3-319-12904-4_11
Publisher:
Springer Verlag (Germany)
Publisher version: http://dx.doi.org/10.1007/978-3-319-12904-4_11
Series: Lecture Notes in Computer Science;8663
Description: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-12904-4_11
Type: Capítulo de libro

This item appears in the following Collection(s)

Show full item record