Partial evaluation of rewriting logic theories

• Autores: Ángel Eduardo Cuenca Ortega
• Directores de la Tesis: Santiago Escobar Román (dir. tes.), María Alpuente Frasnedo (dir. tes.)
• Lectura: En la Universitat Politècnica de València ( España ) en 2019
• Idioma: español
• Tribunal Calificador de la Tesis: Silvia Mara Abrahao Gonzales (presid.), Mateu Villaret Auselle (secret.), Marisa Navarro Gomez (voc.)
• Programa de doctorado: Programa de Doctorado en Informática por la Universitat Politècnica de València
• Materias:
  • Lógica
    • Aplicaciones de la lógica
• Enlaces
  • Tesis en acceso abierto en: RiuNet
• Resumen

  • Partial evaluation is a powerful and general program optimization technique that preserves program semantics and has many successful applications. Optimization is achieved by specializing programs w.r.t. a part of their input data so that, when the residual or specialized program is executed on the remaining input data, it produces the same outcome than the original program with all of its input data. Existing PE schemes do not apply to expressive rule-based languages like Maude, CafeOBJ, OBJ, ASF+SDF, and ELAN, which support: 1) rich type structures with sorts, subsorts, and overloading; and 2) equational rewriting modulo various combinations of axioms such as associativity, commutativity, and identity. This thesis develops the new foundations needed and illustrates the key concepts of equational order sorted partial evaluation by showing how they apply to the specialization of expressive programs written in Maude. Our partial evaluation scheme is based on an automatic unfolding algorithm that computes term variants and relies on high-performance order-sorted equational least general generalization and ordersorted equational homeomorphic embedding algorithms for ensuring termination.We show that our partial evaluation technique is sound and complete for order-sorted equational theories that may contain various combinations of associativity, commutativity, and/or identity axioms for different binary operators. Finally, we present Victoria, the first partial evaluator for Maude's order-sorted equational theories, and demonstrate the effectiveness of our partial evaluation scheme on several examples where it shows significant speed-up.