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. ...
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 ...
Program termination is a relevant property that has been extensively studied in the
context of many different formalisms and programming languages. Traditional approaches
to proving termination are usually based on ...
[EN] The halting problem is a prominent example of undecidable problem and its formulation and undecidability proof is usually attributed to Turing's 1936 landmark paper. Copeland noticed in 2004, though, that it was so ...
Martínez López, Alejandro(Universitat Politècnica de València, 2022-10-21)
[ES] Realizar una herramienta que demuestra la terminación de sistemas de reescritura utilizando el denominado Marco de Pares de Dependencia (\emph{DP Framework}) a partir de procesadores aportados por usuarios externos. ...