- -

Añadidos recientemente

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Informes técnicos de investigación DSIC-ELP: Enviados recientemente

  • thumb
    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. ...
  • thumb
    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 ...
  • thumb
    Backward Trace Slicing for Rewriting Logic Theories -Technical report - 
    Alpuente Frasnedo, María; Ballis, Demis; Espert, Javier; Romero, Daniel (Universitat Politècnica de València, 2011-04-19)
    Trace slicing is a widely used technique for execution trace analysis that is effectively used in program debugging, analysis and comprehension. In this paper, we present a backward trace slicing technique that can be used ...
  • thumb
    Backward Trace Slicing for Rewriting Logic Theories -Technical report - 
    Alpuente Frasnedo, María; Ballis, D.; Espert, J.; Romero, D. (Universitat Politècnica de València, 2011-04-19)
    Trace slicing is a widely used technique for execution trace analysis that is effectively used in program debugging, analysis and comprehension. In this paper, we present a backward trace slicing technique that can be used ...
  • thumb
    On Unfolding Completeness for Rewriting Logic Theories 
    Alpuente Frasnedo, María; Baggi, Michele; Ballis, Demis; Falaschi, Moreno (Universitat Politècnica de València, 2010-10-04)
    Many transformation systems for program optimization, program synthesis, and program specialization are based on fold/unfold transformations. In this paper, we investigate the semantic properties of a narrowing-based ...