Resumen:
Canonical Narrowing for Variant-Based Conditional Rewrite Theories

Fecha

2023-09-12

Editor

Sistedes

Publicado en

Actas de las XXII Jornadas sobre Programación y Lenguajes (PROLE 2023)

Licencia

CC BY-NC-ND 4.0

Resumen

23rd International Conference on Formal Engineering Methods (ICFEM 2022). Madrid, Spain: Springer. Maude currently supports many symbolic reasoning features such as order-sorted equational unification and order-sorted narrowingbased symbolic reachability analysis. There have been many advances and new features added to improve narrowing in Maude but only at a theoretical level. In this paper, we provide a very elegant, transparent, and extremely pragmatic approach for conditional rewrite theories where the conditions are just equalities solved by equational unification. We show how two conditional theories, never executed before, are now executable with very good performance.We also show how real execution works better than the manually transformed version.

Descripción

Acerca de López Rueda, Raúl

Palabras clave

Canonical Narrowing, Conditional Rules, Maude, Program Transformation

Colecciones

Página completa del ítem
Notificar un error en este resumen
Mostrar cita
Mostrar cita en BibTeX
Descargar cita en BibTeX