- -

Listar Informes técnicos de investigación DSIC-ELP por fecha de publicación

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

Listar Informes técnicos de investigación DSIC-ELP por fecha de publicación

Ordenar por:Orden:Resultados:

  • 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 ...
  • 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
    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
    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
    A Condensed Goal-Independent Bottom-Up Fixpoint Semantics Modeling the Behavior of tccp 
    Comini, Marco; Titolo, Laura; Villanueva García, Alicia (Universitat Politècnica de València, 2013)
    In this paper, we present a new compositional bottom-up semantics for the Timed Concurrent Constraint Language (tccp in short) which is defined for the full language. In particular, is able to deal with the non- monotonic ...
  • thumb
    A Condensed Goal-Independent Bottom-Up Fixpoint Semantics Modeling the Behavior of tccp 
    Comini, Marco; Titolo, Laura; Villanueva García, Alicia (Universitat Politècnica de València, 2013-04-13)
    In this paper, we present a new compositional bottom-up semantics for the Timed Concurrent Constraint Language (tccp in short). Such semantics is defined for the full language. In particular, is able to deal with the ...
  • thumb
    Abstract Diagnosis for tccp using a Linear Temporal Logic 
    Comini, Marco; Titolo, Laura; Villanueva García, Alicia (Universitat Politècnica de València, 2014-02-15)
    Automatic techniques for program verification usually suffer the well-known state explosion problem. Most of the classical approaches are based on browsing the structure of some form of model (which rep- resents the behavior ...
  • thumb
    ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance (extended version) 
    Alpuente, María; Escobar, Santiago; Espert, Javier; Meseguer, José (Universitat Politècnica de València, 2014-07-16)
    Computing generalizers is relevant in a wide spectrum of automated reasoning areas where analogical reasoning and inductive inference are needed. The ACUOS system computes a complete and minimal set of semantic generalizers ...
  • thumb
    Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting 
    Gutiérrez Gil, Raúl; Lucas Alba, Salvador (Universitat Politècnica de València, 2015-05-26)
    Context-sensitive rewriting (CSR) is a variant of rewriting where only selected arguments of function symbols can be rewritten. Consequently, the subterm positions of a term are classified as either active, i.e., positions ...
  • thumb
    Static Correction of Maude Programs with Assertions 
    Alpuente Frasnedo, María; Ballis, D.; Sapiña Sanchis, Julia (Universitat Politècnica de València, 2018-04-12)
    In this paper, we present a novel transformation method for Maude programs featuring both automatic program diagnosis and correction. The input of our method is a reference specification A of the program behavior that ...
  • thumb
    I.G 
    Hernández-Orallo, José (Universitat Politècnica de València, 2018-04-12)
    This report summarises the key ideas for a simple concept of I.G. and its explanatory value for several areas.
  • thumb
    Abstract Contract Synthesis and Verification in the Symbolic K Framework 
    Alpuente Frasnedo, María; Pardo Pont, Daniel; Villanueva García, Alicia (Universitat Politècnica de València, 2018-04-12)
    [EN] In this article, we propose a symbolic technique that can be used for automatically inferring software contracts from programs that are written in a non-trivial fragment of C, called KernelC, that supports pointer-based ...
  • thumb
    Narrowing-based Optimization of Rewrite Theories 
    Alpuente Frasnedo, María; Ballis, Demis; Escobar Román, Santiago; Sapiña Sanchis, Julia (Universitat Politècnica de València, 2020-06-08)
    Partial evaluation has been never investigated in the context of rewrite theories that allow concurrent systems to be specified by means of rules, with an underlying equational theory being used to model system states as ...
  • thumb
    A Probabilistic Framework for Non-Cheating Machine Teaching 
    Ferri Ramírez, César; Hernández Orallo, José; Telle, Jan Arne (2022-05-03)
    Over the past decades in the field of machine teaching, several restrictions have been introduced to avoid ‘cheating’, such as collusion-free or non-clashing teaching. However, these restrictions forbid several teaching ...