Optimization of rewrite theories by equational partial evaluation
DOI10.1016/j.jlamp.2021.100729zbMath1477.68136OpenAlexW3207121611MaRDI QIDQ2667190
Santiago Escobar, Julia Sapiña, María Alpuente, Demis Ballis
Publication date: 24 November 2021
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2021.100729
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strict coherence of conditional rewriting modulo axioms
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Equational abstractions
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Conditional rewriting logic as a unified model of concurrency
- Equational rules for rewriting logic
- Folding variant narrowing and optimal variant termination
- Generalized rewrite theories, coherence completion, and symbolic methods
- A partial evaluation framework for order-sorted equational programs modulo axioms
- \({\mathsf{ACUOS}}^\mathbf{2}\): a high-performance system for modular ACU generalization with subtyping and inheritance
- Metalevel algorithms for variant satisfiability
- A modular order-sorted equational generalization algorithm
- On Forward Closure and the Finite Variant Property
- ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance
- Abstract Logical Model Checking of Infinite-State Systems Using Narrowing
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Specialization of functional logic programs based on needed narrowing
- MTT: The Maude Termination Tool (System Description)
- A Modular Equational Generalization Algorithm
- Partial evaluation in logic programming
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- A Transformation System for Developing Recursive Programs
- Variant-Based Satisfiability in Initial Algebras
- Conjunctive partial deduction: foundations, control, algorithms, and experiments
- Order-Sorted Generalization
- Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms*
- Variant Narrowing and Equational Unification
- Symbolic Model Checking of Infinite-State Systems Using Narrowing
- Term Rewriting and Applications
- Associative unification and symbolic reasoning modulo associativity in Maude
This page was built for publication: Optimization of rewrite theories by equational partial evaluation
