Optimizing Maude Programs via Program Specialization

María Alpuente, Demis Ballis, Santiago Escobar, Jose Meseguer, Julia Sapiña

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

We develop an automated specialization framework for rewrite theories that model concurrent systems. A rewrite theory R= (Σ, E⊎ B, R) consists of two main components: an order-sorted equational theory E= (Σ, E⊎ B) that defines the system states as terms of an algebraic data type and a term rewriting system R that models the concurrent evolution of the system as state transitions. Our main idea is to partially evaluate the underlying equational theory E to the specific calls required by the rewrite rules of R in order to make the system computations more efficient. The specialization transformation relies on folding variant narrowing, which is the symbolic operational engine of Maude’s equational theories. We provide three instances of our specialization scheme that support distinct classes of theories that are relevant for many applications. The effectiveness of our method is finally demonstrated in some specialization examples.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer
Pages21-50
Number of pages30
DOIs
StatePublished - 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13160 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Optimizing Maude Programs via Program Specialization'. Together they form a unique fingerprint.

Cite this