Equational Unification and Matching, and Symbolic Reachability Analysis in Maude 3.2 (System Description)
dc.conference.date | 8-10 Ago 2022 | |
dc.conference.place | Haifa, Israel | |
dc.conference.title | IJCAR 2022 | |
dc.contributor.author | Durán, Francisco | |
dc.contributor.author | Eker, Steven | |
dc.contributor.author | Escobar, Santiago | |
dc.contributor.author | Martí Oliet, Narciso | |
dc.contributor.author | Meseguer, José | |
dc.contributor.author | Rubio Cuéllar, Rubén Rafael | |
dc.contributor.author | Talcott, Carolyn | |
dc.contributor.editor | Blanchette, Jasmin | |
dc.contributor.editor | Kovács, Laura | |
dc.contributor.editor | Pattinson, Dirk | |
dc.date.accessioned | 2024-01-23T16:09:29Z | |
dc.date.available | 2024-01-23T16:09:29Z | |
dc.date.issued | 2022 | |
dc.description.abstract | Equational 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. | |
dc.description.department | Depto. de Sistemas Informáticos y Computación | |
dc.description.faculty | Fac. de Informática | |
dc.description.refereed | TRUE | |
dc.description.sponsorship | Agencia Estatal de Investigación | |
dc.description.sponsorship | Junta de Andalucía | |
dc.description.sponsorship | FEDER | |
dc.description.sponsorship | European Union | |
dc.description.sponsorship | Generalitat Valenciana | |
dc.description.sponsorship | U. S. Office of Naval Research | |
dc.description.status | pub | |
dc.identifier.doi | 10.1007/978-3-031-10769-6_31 | |
dc.identifier.isbn | 9783031107689 | |
dc.identifier.isbn | 9783031107696 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.issn | 1611-3349 | |
dc.identifier.uri | https://hdl.handle.net/20.500.14352/94853 | |
dc.language.iso | eng | |
dc.relation.projectID | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PGC2018-094905-B-I00/ES/DIGITAL AVATARS: UN FRAMEWORK PARA APLICACIONES DE COMPUTACION SOCIAL COLABORATIVA/ | |
dc.relation.projectID | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-108528RB-C22/ES/METODOS RIGUROSOS PARA EL DESARROLLO DE SISTEMAS SOFTWARE DE CALIDAD Y FIABILIDAD CERTIFICADAS/ | |
dc.relation.projectID | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/RTI2018-094403-B-C32/ES/RAZONAMIENTO FORMAL PARA TECNOLOGIAS FACILITADORAS Y EMERGENTES/ | |
dc.relation.projectID | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PCI2020-120708-2/ES/FORMAL ANALYSIS AND VERIFICATION OF POST-QUANTUM CRYPTOGRAPHIC PROTOCOLS/ | |
dc.relation.projectID | info:eu-repo/grantAgreeement/Junta de Andalucía//UMA18-FEDERJA-180 | |
dc.relation.projectID | info:eu-repo/grantAgreeement/Generalitat Valenciana//PROMETEO/2019/098 | |
dc.relation.projectID | info:eu-repo/grantAgreeement/U. S. Office of Naval Research//N00014-15-1-2202 | |
dc.relation.projectID | info:eu-repo/grantAgreeement/U. S. Office of Naval Research//N00014-20-1-2644 | |
dc.relation.projectID | info:eu-repo/grantAgreeement/U. S. Office of Naval Research//N0017317-1-G002 | |
dc.relation.projectID | info:eu-repo/grantAgreement/EC/H2020/952215/EU | |
dc.rights | Attribution 4.0 International | en |
dc.rights.accessRights | open access | |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | |
dc.subject.keyword | Symbolic reachability | |
dc.subject.keyword | Rewriting logic | |
dc.subject.keyword | Narrowing | |
dc.subject.ucm | Inteligencia artificial (Informática) | |
dc.subject.ucm | Lenguajes de programación | |
dc.subject.unesco | 1203.04 Inteligencia Artificial | |
dc.subject.unesco | 1102.14 Lógica Simbólica | |
dc.subject.unesco | 1203.23 Lenguajes de Programación | |
dc.title | Equational Unification and Matching, and Symbolic Reachability Analysis in Maude 3.2 (System Description) | |
dc.type | conference paper | |
dc.type.hasVersion | VoR | |
dspace.entity.type | Publication | |
relation.isAuthorOfPublication | e8d4e85a-2a43-444c-84e7-1fa5f392c50d | |
relation.isAuthorOfPublication | 7dfd0267-1708-4f39-bda5-55a246b4bc41 | |
relation.isAuthorOfPublication.latestForDiscovery | 7dfd0267-1708-4f39-bda5-55a246b4bc41 |
Download
Original bundle
1 - 1 of 1