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. ...
Gutiérrez Gil, Raúl; Lucas Alba, Salvador; Urbain, Xavier(Springer-Verlag, 2008)
[EN] Recently, the dependency pairs (DP) approach has been generalized to context-sensitive rewriting (CSR). Although the context-sensitive dependency pairs (CS-DP) approach provides a very good basis for proving termination ...
Lucas Alba, Salvador; Gutiérrez Gil, Raúl(Elsevier, 2018)
[EN] Given a (Conditional) Rewrite System R and terms s and t, we consider the following problem: is there a substitution a instantiating the variables in s and t such that the reachability test sigma(s) -> *(R) sigma(t) ...
Lucas Alba, Salvador(Springer Verlag (Germany), 2016-08)
[EN] A declarative programming language is based on some logic L and its operational semantics is given by a proof calculus which is often presented in a natural deduction style by means of inference rules. Declarative ...
Lucas Alba, Salvador(Springer Verlag (Germany), 2014-12)
Proving polynomials non-negative when variables range on a
subset of numbers (e.g., [0, +∞)) is often required in many applications
(e.g., in the analysis of program termination). Several representations for
univariate ...
[EN] In this paper, we study operational termination, a proof theoretical notion for capturing the termination behavior of computational systems. We prove that operational termination can be characterized at different ...