Equational Unification and Matching, and Symbolic Reachability Analysis in Maude 3.2 (System Description)-Reference-Cited by-同舟云学术

Equational Unification and Matching, and Symbolic Reachability Analysis in Maude 3.2 (System Description)

Published:2022 Issue: Volume: Page:529-540
ISSN:0302-9743
Container-title:Automated Reasoning
language:
Short-container-title:

Author:

Durán Francisco^ORCID,Eker Steven^ORCID,Escobar Santiago^ORCID,Martí-Oliet Narciso^ORCID,Meseguer José^ORCID,Rubio Rubén^ORCID,Talcott Carolyn^ORCID

Abstract

AbstractEquational unification and matching are fundamental mechanisms in many automated deduction applications. Supporting them efficiently for as wide as possible a class of equational theories, and in a typed manner supporting type hierarchies, benefits many applications; but this is both challenging and nontrivial. We present Maude 3.2’s efficient support of these features as well as of symbolic reachability analysis of infinite-state concurrent systems based on them.

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-10769-6_31

Reference48 articles.

1. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);H Aït-Kaci,2003

2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);M Alpuente,2019

3. Alpuente, M., Cuenca-Ortega, A., Escobar, S., Meseguer, J.: Order-sorted homeomorphic embedding modulo combinations of associativity and/or commutativity axioms. Fundam. Inform. 177(3–4), 297–329 (2020)

4. Alpuente, M., Cuenca-Ortega, A., Escobar, S., Meseguer, J.: A partial evaluation framework for order-sorted equational programs modulo axioms. J. Log. Algebraic Methods Program. 110, 100501 (2020)

5. Alpuente, M., Falaschi, M., Vidal, G.: Partial evaluation of functional logic programs. ACM Trans. Program. Lang. Syst. 20(4), 768–844 (1998)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Narrowing and heuristic search for symbolic reachability analysis of concurrent object-oriented systems;Science of Computer Programming;2024-07

2. A Flexible Framework for Integrating Maude and SMT Solvers Using Python;Lecture Notes in Computer Science;2024

3. Verifying Invariants by Deductive Model Checking;Lecture Notes in Computer Science;2024

4. Symbolic Analysis by Using Folding Narrowing with Irreducibility and SMT Constraints;Proceedings of the 9th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems;2023-10-18

5. Variants and satisfiability in the infinitary unification wonderland;Journal of Logical and Algebraic Methods in Programming;2023-08