Buscar en RiuNet

Listar

Todo RiuNet

Mi cuenta

Acceder

Ayuda RiuNet

Admin. UPV

Listar por autor "Alarcón Jiménez, Beatriz"

Mostrando ítems 1-10 de 10

A Dependency Pair Framework for AvC-Termination

Alarcón Jiménez, Beatriz; Gutiérrez Gil, Raúl; Lucas, Salvador; Meseguer, José (Universitat Politècnica de València, 2011-05-04)

The development of powerful techniques for proving termination of rewriting modulo a set of equational axioms is essential when dealing with rewriting logic-based programming languages like CafeOBJ, Maude, ELAN, OBJ, etc. ...
Context-Sensitive Dependency Pairs

Alarcón, Beatriz; Gutiérrez Gil, Raúl; Lucas Alba, Salvador (Springer-Verlag, 2006)

[EN] Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of context-sensitive rewriting (CSR), the ...
Context-Sensitive Dependency Pairs

Alarcón, Beatriz; Gutiérrez Gil, Raúl; Lucas Alba, Salvador (Elsevier, 2010-08)

[EN] Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although a good number of techniques for proving termination of context-sensitive rewriting (CSR) have been ...
Improving Context-Sensitive Dependency Pairs

Alarcón, Beatriz; Emmes, Fabian; Fuhs, Carsten; Giesl, Jürgen; Gutiérrez Gil, Raúl; Lucas Alba, Salvador; Schneider-Kamp, Peter; Thiemann, René (Springer-Verlag, 2008)

[EN] Context-sensitive dependence pairs (CS-DPs) are currently the most powerful method for automated termination analysis of context-sensitive rewriting. However, compared to DPs for ordinary rewriting, CS-DPs suffer from ...
Improving the Context-Sensitive Dependency Graph

Alarcón, Beatriz; Gutiérrez Gil, Raúl; Lucas Alba, Salvador (Elsevier, 2007-07-16)

[EN] The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently, it has been adapted to be used in ...
Innermost Termination of Context-Sensitive Rewriting

Alarcón Jiménez, Beatriz; Lucas, Salvador (Universitat Politècnica de València, 2011-05-04)

Innermost context-sensitive rewriting (CSR) has been proved useful for modeling the computational behavior of programs of algebraic languages like Maude, OBJ, etc, which incorporate an innermost strategy which is used to ...
Innermost Termination of Context-Sensitive Rewriting

Alarcón Jiménez, Beatriz (Universitat Politècnica de València, 2011-11-28)

Innermost context-sensitive rewriting (CSR) has been proved useful for modeling the computational behavior of programs of algebraic languages like Maude. We adapt the Dependency Pairs Framework to innermost CSR since, up ...
Proving Termination of Context-Sensitive Rewriting with MU-TERM

Alarcón, Beatriz; Gutiérrez Gil, Raúl; Iborra, José; Lucas Alba, Salvador (Elsevier, 2007-07-16)

[EN] Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem with several applications in the fields ...
Proving Termination Properties with Muterm

Alarcón, Beatriz; Gutiérrez Gil, Raúl; Lucas Alba, Salvador; Navarro-Marset, Rafael (Springer-Verlag, 2010)

[EN] MU-TERM is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost rewriting, termination of order-sorted ...
Towards a Framework for Proving Termination of Maude Programs

Alarcón Jiménez, Beatriz (Universitat Politècnica de València, 2011-06-10)

Maude es un lenguaje de programación declarativo basado en la lógica de reescritura que incorpora muchas características que lo hacen muy potente. Sin embargo, a la hora de probar ciertas propiedades computacionales esto ...