Programming and symbolic computation in Maude

Rewriting logic is both a flexible semantic framework within which widely different concurrent systems can be naturally specified and a logical framework in which widely different logics can be specified. Maude programs are exactly rewrite theories. Maude has also a formal environment of verificatio...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 110; p. 100497
Main Authors Durán, Francisco, Eker, Steven, Escobar, Santiago, Martí-Oliet, Narciso, Meseguer, José, Rubio, Rubén, Talcott, Carolyn
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.01.2020
Subjects
External objects
Maude and rewriting logic
Meta-interpreters
Strategies
Symbolic model checking
Unification and narrowing
Symbolic model checking
Meta-interpreters
Maude and rewriting logic
Unification and narrowing
Strategies
External objects
Online AccessGet full text

Cover

Abstract Rewriting logic is both a flexible semantic framework within which widely different concurrent systems can be naturally specified and a logical framework in which widely different logics can be specified. Maude programs are exactly rewrite theories. Maude has also a formal environment of verification tools. Symbolic computation is a powerful technique for reasoning about the correctness of concurrent systems and for increasing the power of formal tools. We present several new symbolic features of Maude that enhance formal reasoning about Maude programs and the effectiveness of formal tools. They include: (i) very general unification modulo user-definable equational theories, and (ii) symbolic reachability analysis of concurrent systems using narrowing. The paper does not focus just on symbolic features: it also describes several other new Maude features, including: (iii) Maude's strategy language for controlling rewriting, and (iv) external objects that allow flexible interaction of Maude object-based concurrent systems with the external world. In particular, meta-interpreters are external objects encapsulating Maude interpreters that can interact with many other objects. To make the paper self-contained and give a reasonably complete language overview, we also review the basic Maude features for equational rewriting and rewriting with rules, Maude programming of concurrent object systems, and reflection. Furthermore, we include many examples illustrating all the Maude notions and features described in the paper.
AbstractList Rewriting logic is both a flexible semantic framework within which widely different concurrent systems can be naturally specified and a logical framework in which widely different logics can be specified. Maude programs are exactly rewrite theories. Maude has also a formal environment of verification tools. Symbolic computation is a powerful technique for reasoning about the correctness of concurrent systems and for increasing the power of formal tools. We present several new symbolic features of Maude that enhance formal reasoning about Maude programs and the effectiveness of formal tools. They include: (i) very general unification modulo user-definable equational theories, and (ii) symbolic reachability analysis of concurrent systems using narrowing. The paper does not focus just on symbolic features: it also describes several other new Maude features, including: (iii) Maude's strategy language for controlling rewriting, and (iv) external objects that allow flexible interaction of Maude object-based concurrent systems with the external world. In particular, meta-interpreters are external objects encapsulating Maude interpreters that can interact with many other objects. To make the paper self-contained and give a reasonably complete language overview, we also review the basic Maude features for equational rewriting and rewriting with rules, Maude programming of concurrent object systems, and reflection. Furthermore, we include many examples illustrating all the Maude notions and features described in the paper.
ArticleNumber 100497
Author Martí-Oliet, Narciso
Talcott, Carolyn
Durán, Francisco
Eker, Steven
Escobar, Santiago
Meseguer, José
Rubio, Rubén
Author_xml – sequence: 1
  givenname: Francisco
  surname: Durán
  fullname: Durán, Francisco
  email: duran@lcc.uma.es
  organization: Universidad de Málaga, Spain
– sequence: 2
  givenname: Steven
  surname: Eker
  fullname: Eker, Steven
  email: eker@csl.sri.com
  organization: SRI International, CA, USA
– sequence: 3
  givenname: Santiago
  surname: Escobar
  fullname: Escobar, Santiago
  email: sescobar@upv.es
  organization: Universitat Politècnica de València, Spain
– sequence: 4
  givenname: Narciso
  surname: Martí-Oliet
  fullname: Martí-Oliet, Narciso
  email: narciso@ucm.es
  organization: Universidad Complutense de Madrid, Spain
– sequence: 5
  givenname: José
  surname: Meseguer
  fullname: Meseguer, José
  email: meseguer@illinois.edu
  organization: University of Illinois at Urbana-Champaign, IL, USA
– sequence: 6
  givenname: Rubén
  surname: Rubio
  fullname: Rubio, Rubén
  email: rubenrub@ucm.es
  organization: Universidad Complutense de Madrid, Spain
– sequence: 7
  givenname: Carolyn
  surname: Talcott
  fullname: Talcott, Carolyn
  email: clt@cs.stanford.edu
  organization: SRI International, CA, USA
BookMark eNqFz71OwzAQwHEPRaKUPgFLXiDl_NEmHhhQxUelIhhgtuyzWzlK7MpOkfr2pISJASafrPuf9LsikxCDI-SGwoICXd02i6bV3WHBgMrhB4SsJmTK-JKVjEF9SeY5NwDDal3VnE5J-ZbiPumu82Ff6GCLfOpMbD0WGLvDsde9j6HwoXjRR-uuycVOt9nNf94Z-Xh8eF8_l9vXp836flsiF3VfGqyEYMaCkdKuUAixBI5yRRkFBoCOVaZeOqPFMEHN3M7aykjkWlBDjeEzwse7mGLOye3UIflOp5OioM5Q1ahvqDpD1QgdKvmrQj8C-qR9-097N7ZuYH16l1RG7wI665PDXtno_-y_AL7Kc0w
CitedBy_id crossref_primary_10_1007_s10515_021_00307_9
crossref_primary_10_1016_j_jlamp_2024_101034
crossref_primary_10_1109_TR_2024_3354459
crossref_primary_10_7717_peerj_cs_1547
crossref_primary_10_7717_peerj_cs_1556
crossref_primary_10_1049_2023_9399887
crossref_primary_10_3103_S0005105522050065
crossref_primary_10_4204_EPTCS_325_10
crossref_primary_10_1007_s10270_021_00947_1
crossref_primary_10_1007_s10817_021_09603_1
crossref_primary_10_1145_3608486
Cites_doi 10.1007/978-3-319-94460-9_18
10.1016/S1571-0661(05)80012-X
10.1016/j.tcs.2016.12.026
10.1007/978-3-319-99840-4_2
10.1016/j.scico.2017.09.001
10.1016/j.tcs.2008.09.022
10.1007/978-3-319-08918-8_29
10.1016/S0304-3975(03)00312-8
10.1016/S0747-7171(89)80036-7
10.1016/S0304-3975(99)00206-6
10.1016/j.jlap.2012.06.003
10.1016/j.jlamp.2016.10.001
10.1007/978-3-319-23165-5_21
10.1016/0304-3975(92)90182-F
10.1016/j.scico.2006.07.002
10.1016/j.jlamp.2015.06.001
10.1016/j.scico.2014.02.006
10.1016/j.jlap.2012.06.002
10.1016/j.scico.2013.09.010
10.1016/S0304-3975(01)00360-7
10.1145/359131.359136
10.1016/j.tcs.2012.05.040
10.1016/j.tcs.2008.04.040
10.1007/978-3-319-99840-4_6
10.1016/j.jlap.2011.12.004
10.1016/0743-1066(84)90004-9
10.1007/978-3-319-94460-9_12
10.1016/j.scico.2014.07.003
10.1016/j.scico.2014.02.005
10.1145/147508.147524
10.1016/S1571-0661(05)82552-6
10.1016/j.tcs.2006.12.009
10.1016/j.jsc.2016.07.012
10.1016/j.tcs.2006.12.018
10.1007/s10990-007-9001-5
10.1016/S0304-3975(01)00359-0
10.1007/s00165-017-0415-5
10.1016/j.entcs.2009.05.022
10.1016/j.entcs.2009.05.014
10.1007/s10990-008-9028-2
10.2307/2268661
10.1007/978-3-319-23165-5_11
10.1016/j.ic.2014.01.006
10.1007/978-3-319-08918-8_5
10.1023/A:1010000313106
10.1016/j.tcs.2006.04.012
10.1007/978-3-319-99840-4_1
10.1016/j.ic.2014.07.007
10.1016/j.ic.2013.08.004
10.1016/0304-3975(92)90302-V
10.1016/j.jalgor.2007.04.002
10.1016/j.jlap.2012.01.002
10.1007/978-3-319-99840-4_10
10.1007/978-3-319-99840-4_7
10.1016/j.scico.2007.11.003
10.1016/j.ic.2008.03.026
10.1016/j.jlamp.2017.12.006
10.1007/s10990-007-9000-6
ContentType Journal Article
Copyright 2019 Elsevier Inc.
Copyright_xml – notice: 2019 Elsevier Inc.
DBID AAYXX
CITATION
DOI 10.1016/j.jlamp.2019.100497
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
ExternalDocumentID 10_1016_j_jlamp_2019_100497
S2352220818301135
GroupedDBID --M
0R~
4.4
457
4G.
7-5
8P~
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAXUO
AAYFN
ABBOA
ABMAC
ABVKL
ABXDB
ABYKQ
ACDAQ
ACGFS
ACRLP
ADBBV
ADEZE
AEBSH
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
AXJTR
BKOJK
BLXMC
EBS
EFJIC
EFLBG
EJD
FDB
FIRID
FYGXN
GBLVA
GBOLZ
HZ~
KOM
M41
NCXOZ
O9-
OAUVE
RIG
ROL
SPC
SPCBC
SSV
SSZ
T5K
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABJNI
ACVFH
ADCNI
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AFXIZ
AGCQF
AGRNS
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
BNPGV
CITATION
SSH
ID FETCH-LOGICAL-c348t-bc7442bd0b99d6c444503c961210200ce27b85eba4e27082efdd7b9c3a41b1bb3
IEDL.DBID AIKHN
ISSN 2352-2208
IngestDate Thu Apr 24 23:02:34 EDT 2025
Tue Jul 01 00:37:50 EDT 2025
Fri Feb 23 02:48:13 EST 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords Symbolic model checking
Meta-interpreters
Maude and rewriting logic
Unification and narrowing
Strategies
External objects
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c348t-bc7442bd0b99d6c444503c961210200ce27b85eba4e27082efdd7b9c3a41b1bb3
OpenAccessLink https://www.sciencedirect.com/science/article/am/pii/S2352220818301135
ParticipantIDs crossref_primary_10_1016_j_jlamp_2019_100497
crossref_citationtrail_10_1016_j_jlamp_2019_100497
elsevier_sciencedirect_doi_10_1016_j_jlamp_2019_100497
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate January 2020
2020-01-00
PublicationDateYYYYMMDD 2020-01-01
PublicationDate_xml – month: 01
  year: 2020
  text: January 2020
PublicationDecade 2020
PublicationTitle Journal of logical and algebraic methods in programming
PublicationYear 2020
Publisher Elsevier Inc
Publisher_xml – name: Elsevier Inc
References K. Bae, J. Meseguer, Predicate abstraction of rewrite theories, in
Bobba, Grov, Gupta, Liu, Meseguer, Ölveczky, Skeirik (br0140) 2018
Durán, Eker, Escobar, Meseguer, Talcott (br0410) 2011
Rubio, Martí-Oliet, Pita, Verdejo (br1190) 2019
Meseguer (br1020) 2018; 154
(br1210) 2018; vol. 11152
2018, pp. 26–44.
F. Durán, P.C. Ölveczky, A guide to extending Full Maude illustrated with the implementation of Real-Time Maude, in
Clavel, Durán, Eker, Meseguer, Lincoln, Martí-Oliet, Talcott (br0280) 2007; vol. 4350
Comon-Lundh, Delaune (br0340) 2005
2018, pp. 1–25.
Clavel, Durán, Eker, Escobar, Lincoln, Martí-Oliet, Meseguer, Rubio, Talcott (br0240) 2019
Meseguer, Talcott (br1100) 2002
Bravenboer, Kalleberg, Vermaas, Visser (br0180) 2008; 72
Durán, Meseguer (br0450) 2003; 309
Alpuente, Escobar, Espert, Meseguer (br0060) 2014; 235
(br0860) 2015; vol. 9200
Stehr, Meseguer (br1270) 2004
Clavel, Meseguer (br0300) 2002; 285
Cholewa, Meseguer, Escobar (br0220) 2014
Durán, Eker, Escobar, Martí-Oliet, Meseguer, Talcott (br0390) 2016
2009, pp. 83–102.
Talcott, Eker, Knapp, Lincoln, Laderoute (br1300) 2004
F. Durán, S. Eker, S. Escobar, N. Martí-Oliet, J. Meseguer, C.L. Talcott, Associative unification and symbolic reasoning modulo associativity in Maude, in
(br1160) 2009; vol. 238(3)
Goguen, Burstall (br0630) 1992; 39
Goguen, Winkler, Meseguer, Futatsugi, Jouannaud (br0670) 2000
Durán, Riesco, Verdejo (br0490) 2007
N. Martí-Oliet, J. Meseguer, A. Verdejo, A rewriting semantics for Maude strategies, in
F. Durán, J. Meseguer, An extensible module algebra for Maude, in
Katelman, Meseguer, Hou (br0760) 2008
Dreier, Duménil, Kremer, Sasse (br0370) 2017
Alpuente, Ballis, Cuenca-Ortega, Escobar, Meseguer (br0020) 2019
Alpuente, Cuenca-Ortega, Escobar, Meseguer (br0030) 2017
Meseguer (br1010) 2018
2009, pp. 227–247.
Rubio, Martí-Oliet, Pita, Verdejo (br1200) 2019
Escobar, Meadows, Meseguer, Santiago (br0590) 2014; 238
Bae, Meseguer (br0080) 2014
Braga, Verdejo (br0170) 2007
A. Ştefănescu, S. Ciobâcă, R. Mereuta, B.M. Moore, T. Serbanuta, G. Roşu, All-path reachability logic, in
Meseguer (br0970) 2009
Alpuente, Cuenca-Ortega, Escobar, Meseguer (br0050) 2020; 110
Sasse, King, Meseguer, Tang (br1220) 2013
Eker (br0530) 2011
Escobar, Sasse, Meseguer (br0600) 2012; 81
Meseguer (br0950) 1997
2015, pp. 451–474.
Dutertre (br0520) 2014
Eker, Knapp, Laderoute, Lincoln, Meseguer, Sonmez (br0540) 2002
Meseguer (br0920) 1993
Meseguer (br0910) 1992
2015, pp. 232–254.
2014, pp. 425–440.
Goguen, Meseguer (br0660) 1992; 105
Bae, Meseguer (br0100) 2015; 99
Agha, Meseguer, Sen (br0010) 2006
(br0360) 2014; vol. 8560
Eker, Martí-Oliet, Meseguer, Verdejo (br0550) 2007
Meseguer, Ölveczky (br1050) 2012; 451
S. Escobar, Multi-paradigm programming in Maude, in
Clavel, Durán, Eker, Escobar, Lincoln, Martí-Oliet, Meseguer, Talcott (br0250) 2009
Colmerauer, Kanoui, van Caneghem (br0330) 1979
2018, pp. 306–322.
R. Gutiérrez, J. Meseguer, Variant-based decidable satisfiability in initial algebras with predicates, in
Meseguer, Thati (br1110) 2007; 20
Ciobâcă, Lucanu (br0230) 2018
Hidalgo-Herrero, Verdejo, Ortega-Mallén (br0720) 2007
Ölveczky, Thorvaldsen (br1140) 2009; 410
D. Lucanu, V. Rusu, A. Arusoaie, D. Nowak, Verifying reachability-logic properties on rewriting-logic specifications, in
2018, pp. 201–217.
Bruni, Meseguer (br0190) 2006; 360
Clavel, Eker, Lincoln, Meseguer (br0290) 1996
2018, pp. 98–114.
Clavel, Palomino (br0320) 2005
Meseguer (br1030) 2020; 110
Bergstra, Tucker (br0130) 1980; vol. 81
Martí-Oliet, Meseguer, Verdejo (br0840) 2004
Durán, Rocha, Meseguer (br0510) 2020; 111
(br0770) 1998; vol. 15
2018, pp. 164–183.
Meseguer, Roşu (br1080) 2013; 231
Tushkanova, Giorgetti, Ringeissen, Kouchnarenko (br1330) 2015; 99
Goguen, Meseguer (br0640) 1984; 1
Lucas, Meseguer (br0820) 2016; 85
Horn (br0730) 1951; 16
Bouhoula, Jouannaud, Meseguer (br0160) 2000; 236
Bae, Escobar, Meseguer (br0070) 2013
Gutiérrez, Meseguer, Rocha (br0700) 2015; 99
Meier, Schmidt, Cremers, Basin (br0880) 2013
Durán, Eker, Lincoln, Meseguer (br0420) 2000
Barrett, Barbosa, Brain, Ibeling, King, Meng, Niemetz, Nötzli, Preiner, Reynolds, Tinelli (br0120) 2018
Caballero, López-Fraguas (br0200) 1999
Durán, Rocha, Álvarez (br0500) 2011
Meseguer (br0890) 1989
Roşu, Ştefănescu (br1170) 2012
Liu, Ölveczky, Meseguer (br0790) 2015
Strachey (br1290) 2000; 13
Verdejo, Martí-Oliet (br1340) 2000
Kowalski (br0780) 1979; 22
Martí-Oliet, Palomino, Verdejo (br0870) 2007; 62
M. Clavel, F. Durán, S. Eker, S. Escobar, P. Lincoln, N. Martí-Oliet, C.L. Talcott, Two decades of Maude, in
Chen, Meseguer, Sasse, Wang, Wang (br0210) 2007
Jouannaud, Kirchner, Kirchner (br0740) 1983
Meseguer (br0990) 2017; 672
Meseguer, Skeirik (br1090) 2017; 29
(br0610) 2018; vol. 10855
Hendrix, Meseguer (br0710) 2008
Martí-Oliet, Meseguer (br0830) 2002
1998, pp. 55–70.
Meseguer (br0960) 2008
Lucanu, Rusu, Arusoaie (br0800) 2017; 80
Meseguer (br0940) 1996
Meseguer (br0930) 1993
Stehr, Meseguer, Ölveczky (br1280) 2001
Rocha, Meseguer, Muñoz (br1150) 2017; 86
Serbanuta, Roşu, Meseguer (br1230) 2009; 207
Clavel, Durán, Eker, Lincoln, Martí-Oliet, Meseguer, Quesada (br0270) 2002; 285
Durán (br0380) 2000
J. Meseguer, Generalized rewrite theories and coherence completion, in
Meseguer (br0980) 2012; 81
Stehr (br1260) 2000
2018, pp. 115–135.
Ölveczky, Meseguer (br1130) 2007; 20
P. Borovanský, C. Kirchner, H. Kirchner, P.E. Moreau, C. Ringeissen, An overview of ELAN, in
González-Burgueño, Aparicio-Sánchez, Escobar, Meadows, Meseguer (br0680) 2018
H. Garavel, M. Tabikh, I. Arrada, Benchmarking implementations of term rewriting and pattern matching in algebraic, functional, and object-oriented languages – the 4th rewrite engines competition, in
Bae, Meseguer, Ölveczky (br0110) 2014; 91
Durán, Meseguer (br0470) 2012; 81
Durán, Lucas, Marché, Meseguer, Urbain (br0430) 2008; 21
Clavel, Meseguer, Palomino (br0310) 2007; 373
Meseguer, Roşu (br1070) 2007; 373
Escobar (br0560) 2014
C. Olarte, E. Pimentel, C. Rocha, Proving structural properties of sequent systems in rewriting logic, in
Dershowitz, Jouannaud (br0350) 1990
S. Skeirik, A. Ştefănescu, J. Meseguer, A constructor-based reachability logic for rewrite theories, in
Meseguer, Palomino, Martí-Oliet (br1060) 2008; 403
Ştefănescu, Park, Yuwen, Li, Roşu (br1320) 2016
Alpuente, Cuenca-Ortega, Escobar, Meseguer (br0040) 2019
Escobar, Meadows, Meseguer (br0580) 2009
1998, pp. 174–195.
Meseguer, Goguen (br1040) 1989; 8
2014, pp. 61–76.
Durán, Meseguer (br0460) 2007; 66
Roşu, Ştefănescu (br1180) 2012
Meseguer (br0900) 1992; 96
Skeirik, Meseguer (br1240) 2018; 96
Katelman, Keller, Meseguer (br0750) 2012; 81
Goguen, Meseguer (br0650) 1986
Talcott (10.1016/j.jlamp.2019.100497_br1300) 2004
Bravenboer (10.1016/j.jlamp.2019.100497_br0180) 2008; 72
10.1016/j.jlamp.2019.100497_br0150
Meseguer (10.1016/j.jlamp.2019.100497_br1090) 2017; 29
Eker (10.1016/j.jlamp.2019.100497_br0540) 2002
Liu (10.1016/j.jlamp.2019.100497_br0790) 2015
Durán (10.1016/j.jlamp.2019.100497_br0500) 2011
Meseguer (10.1016/j.jlamp.2019.100497_br0980) 2012; 81
Bae (10.1016/j.jlamp.2019.100497_br0110) 2014; 91
Durán (10.1016/j.jlamp.2019.100497_br0460) 2007; 66
Durán (10.1016/j.jlamp.2019.100497_br0490) 2007
Agha (10.1016/j.jlamp.2019.100497_br0010) 2006
10.1016/j.jlamp.2019.100497_br1000
10.1016/j.jlamp.2019.100497_br1120
Durán (10.1016/j.jlamp.2019.100497_br0420) 2000
Eker (10.1016/j.jlamp.2019.100497_br0550) 2007
Dershowitz (10.1016/j.jlamp.2019.100497_br0350) 1990
Serbanuta (10.1016/j.jlamp.2019.100497_br1230) 2009; 207
Escobar (10.1016/j.jlamp.2019.100497_br0580) 2009
Clavel (10.1016/j.jlamp.2019.100497_br0240) 2019
Braga (10.1016/j.jlamp.2019.100497_br0170) 2007
Chen (10.1016/j.jlamp.2019.100497_br0210) 2007
Meseguer (10.1016/j.jlamp.2019.100497_br1060) 2008; 403
Martí-Oliet (10.1016/j.jlamp.2019.100497_br0830) 2002
10.1016/j.jlamp.2019.100497_br0260
Eker (10.1016/j.jlamp.2019.100497_br0530) 2011
Meseguer (10.1016/j.jlamp.2019.100497_br1020) 2018; 154
Meseguer (10.1016/j.jlamp.2019.100497_br0960) 2008
(10.1016/j.jlamp.2019.100497_br0610) 2018; vol. 10855
Alpuente (10.1016/j.jlamp.2019.100497_br0020) 2019
Alpuente (10.1016/j.jlamp.2019.100497_br0040) 2019
Goguen (10.1016/j.jlamp.2019.100497_br0650) 1986
Escobar (10.1016/j.jlamp.2019.100497_br0560) 2014
Cholewa (10.1016/j.jlamp.2019.100497_br0220) 2014
Meier (10.1016/j.jlamp.2019.100497_br0880) 2013
Dreier (10.1016/j.jlamp.2019.100497_br0370) 2017
Jouannaud (10.1016/j.jlamp.2019.100497_br0740) 1983
Hendrix (10.1016/j.jlamp.2019.100497_br0710) 2008
Tushkanova (10.1016/j.jlamp.2019.100497_br1330) 2015; 99
10.1016/j.jlamp.2019.100497_br0690
Meseguer (10.1016/j.jlamp.2019.100497_br0900) 1992; 96
Rubio (10.1016/j.jlamp.2019.100497_br1200) 2019
Ciobâcă (10.1016/j.jlamp.2019.100497_br0230) 2018
Dutertre (10.1016/j.jlamp.2019.100497_br0520) 2014
Horn (10.1016/j.jlamp.2019.100497_br0730) 1951; 16
Durán (10.1016/j.jlamp.2019.100497_br0380) 2000
10.1016/j.jlamp.2019.100497_br0850
Bobba (10.1016/j.jlamp.2019.100497_br0140) 2018
Ölveczky (10.1016/j.jlamp.2019.100497_br1140) 2009; 410
10.1016/j.jlamp.2019.100497_br0570
Meseguer (10.1016/j.jlamp.2019.100497_br0990) 2017; 672
Roşu (10.1016/j.jlamp.2019.100497_br1180) 2012
Katelman (10.1016/j.jlamp.2019.100497_br0760) 2008
Meseguer (10.1016/j.jlamp.2019.100497_br1070) 2007; 373
Bruni (10.1016/j.jlamp.2019.100497_br0190) 2006; 360
Bouhoula (10.1016/j.jlamp.2019.100497_br0160) 2000; 236
Skeirik (10.1016/j.jlamp.2019.100497_br1240) 2018; 96
Meseguer (10.1016/j.jlamp.2019.100497_br1100) 2002
Stehr (10.1016/j.jlamp.2019.100497_br1270) 2004
10.1016/j.jlamp.2019.100497_br1250
Clavel (10.1016/j.jlamp.2019.100497_br0280) 2007; vol. 4350
Meseguer (10.1016/j.jlamp.2019.100497_br0970) 2009
Ştefănescu (10.1016/j.jlamp.2019.100497_br1320) 2016
Alpuente (10.1016/j.jlamp.2019.100497_br0030) 2017
Strachey (10.1016/j.jlamp.2019.100497_br1290) 2000; 13
(10.1016/j.jlamp.2019.100497_br0860) 2015; vol. 9200
Meseguer (10.1016/j.jlamp.2019.100497_br0910) 1992
Ölveczky (10.1016/j.jlamp.2019.100497_br1130) 2007; 20
10.1016/j.jlamp.2019.100497_br0440
Durán (10.1016/j.jlamp.2019.100497_br0390) 2016
Clavel (10.1016/j.jlamp.2019.100497_br0300) 2002; 285
Clavel (10.1016/j.jlamp.2019.100497_br0290) 1996
Goguen (10.1016/j.jlamp.2019.100497_br0640) 1984; 1
Katelman (10.1016/j.jlamp.2019.100497_br0750) 2012; 81
Comon-Lundh (10.1016/j.jlamp.2019.100497_br0340) 2005
Meseguer (10.1016/j.jlamp.2019.100497_br0890) 1989
Rubio (10.1016/j.jlamp.2019.100497_br1190) 2019
Durán (10.1016/j.jlamp.2019.100497_br0470) 2012; 81
Goguen (10.1016/j.jlamp.2019.100497_br0670) 2000
Bae (10.1016/j.jlamp.2019.100497_br0080) 2014
Meseguer (10.1016/j.jlamp.2019.100497_br0940) 1996
Durán (10.1016/j.jlamp.2019.100497_br0450) 2003; 309
Meseguer (10.1016/j.jlamp.2019.100497_br0950) 1997
(10.1016/j.jlamp.2019.100497_br1210) 2018; vol. 11152
Hidalgo-Herrero (10.1016/j.jlamp.2019.100497_br0720) 2007
Meseguer (10.1016/j.jlamp.2019.100497_br1050) 2012; 451
Escobar (10.1016/j.jlamp.2019.100497_br0590) 2014; 238
Stehr (10.1016/j.jlamp.2019.100497_br1260) 2000
Barrett (10.1016/j.jlamp.2019.100497_br0120) 2018
Meseguer (10.1016/j.jlamp.2019.100497_br1030) 2020; 110
Stehr (10.1016/j.jlamp.2019.100497_br1280) 2001
Meseguer (10.1016/j.jlamp.2019.100497_br0920) 1993
Alpuente (10.1016/j.jlamp.2019.100497_br0060) 2014; 235
10.1016/j.jlamp.2019.100497_br0620
Rocha (10.1016/j.jlamp.2019.100497_br1150) 2017; 86
10.1016/j.jlamp.2019.100497_br1310
Caballero (10.1016/j.jlamp.2019.100497_br0200) 1999
Clavel (10.1016/j.jlamp.2019.100497_br0310) 2007; 373
Martí-Oliet (10.1016/j.jlamp.2019.100497_br0870) 2007; 62
Meseguer (10.1016/j.jlamp.2019.100497_br1080) 2013; 231
Sasse (10.1016/j.jlamp.2019.100497_br1220) 2013
(10.1016/j.jlamp.2019.100497_br1160) 2009; vol. 238(3)
Durán (10.1016/j.jlamp.2019.100497_br0410) 2011
Bae (10.1016/j.jlamp.2019.100497_br0100) 2015; 99
González-Burgueño (10.1016/j.jlamp.2019.100497_br0680) 2018
Gutiérrez (10.1016/j.jlamp.2019.100497_br0700) 2015; 99
10.1016/j.jlamp.2019.100497_br0090
Goguen (10.1016/j.jlamp.2019.100497_br0660) 1992; 105
(10.1016/j.jlamp.2019.100497_br0770) 1998; vol. 15
Meseguer (10.1016/j.jlamp.2019.100497_br1010) 2018
Colmerauer (10.1016/j.jlamp.2019.100497_br0330) 1979
Clavel (10.1016/j.jlamp.2019.100497_br0270) 2002; 285
Verdejo (10.1016/j.jlamp.2019.100497_br1340) 2000
Bergstra (10.1016/j.jlamp.2019.100497_br0130) 1980; vol. 81
10.1016/j.jlamp.2019.100497_br0810
Roşu (10.1016/j.jlamp.2019.100497_br1170) 2012
Alpuente (10.1016/j.jlamp.2019.100497_br0050) 2020; 110
Durán (10.1016/j.jlamp.2019.100497_br0510) 2020; 111
Martí-Oliet (10.1016/j.jlamp.2019.100497_br0840) 2004
Meseguer (10.1016/j.jlamp.2019.100497_br1110) 2007; 20
10.1016/j.jlamp.2019.100497_br0480
Goguen (10.1016/j.jlamp.2019.100497_br0630) 1992; 39
Meseguer (10.1016/j.jlamp.2019.100497_br0930) 1993
Bae (10.1016/j.jlamp.2019.100497_br0070) 2013
10.1016/j.jlamp.2019.100497_br0400
Meseguer (10.1016/j.jlamp.2019.100497_br1040) 1989; 8
(10.1016/j.jlamp.2019.100497_br0360) 2014; vol. 8560
Escobar (10.1016/j.jlamp.2019.100497_br0600) 2012; 81
Lucanu (10.1016/j.jlamp.2019.100497_br0800) 2017; 80
Lucas (10.1016/j.jlamp.2019.100497_br0820) 2016; 85
Kowalski (10.1016/j.jlamp.2019.100497_br0780) 1979; 22
Durán (10.1016/j.jlamp.2019.100497_br0430) 2008; 21
Clavel (10.1016/j.jlamp.2019.100497_br0250) 2009
Clavel (10.1016/j.jlamp.2019.100497_br0320) 2005
References_xml – reference: A. Ştefănescu, S. Ciobâcă, R. Mereuta, B.M. Moore, T. Serbanuta, G. Roşu, All-path reachability logic, in:
– volume: 85
  start-page: 67
  year: 2016
  end-page: 97
  ident: br0820
  article-title: Normal forms and normal theories in conditional rewriting
  publication-title: J. Log. Algebraic Methods Program.
– start-page: 299
  year: 2011
  end-page: 314
  ident: br0530
  article-title: Fast sort computations for order-sorted matching and unification
  publication-title: Formal Modeling: Actors, Open Systems, Biological Systems – Essays Dedicated to Carolyn Talcott on the Occasion of Her 70th Birthday
– volume: 13
  start-page: 11
  year: 2000
  end-page: 49
  ident: br1290
  article-title: Fundamental concepts in programming languages
  publication-title: High.-Order Symb. Comput.
– reference: , 2018, pp. 115–135.
– volume: 285
  start-page: 187
  year: 2002
  end-page: 243
  ident: br0270
  article-title: Maude: specification and programming in rewriting logic
  publication-title: Theor. Comput. Sci.
– reference: , 2018, pp. 306–322.
– start-page: 400
  year: 2018
  end-page: 417
  ident: br0680
  article-title: Formal verification of the YubiKey and YubiHSM APIs in Maude-NPA
  publication-title: LPAR-22, 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
– start-page: 171
  year: 2019
  end-page: 181
  ident: br0020
  article-title: : a high-performance system for modular ACU generalization with subtyping and inheritance
  publication-title: Logics in Artificial Intelligence – Proceedings of the 16th European Conference
– volume: 110
  year: 2020
  ident: br1030
  article-title: Generalized rewrite theories, coherence completion, and symbolic methods
  publication-title: J. Log. Algebraic Methods Program.
– start-page: 3
  year: 2007
  end-page: 17
  ident: br0170
  article-title: Modular structural operational semantics with strategies
  publication-title: Proceedings of the Third Workshop on Structural Operational Semantics
– volume: 20
  start-page: 123
  year: 2007
  end-page: 160
  ident: br1110
  article-title: Symbolic reachability analysis using narrowing and its application to the verification of cryptographic protocols
  publication-title: High.-Order Symb. Comput.
– start-page: 568
  year: 2004
  end-page: 580
  ident: br1300
  article-title: Pathway logic modeling of protein functional domains in signal transduction
  publication-title: Biocomputing 2004, Proceedings of the Pacific Symposium
– volume: 99
  start-page: 193
  year: 2015
  end-page: 234
  ident: br0100
  article-title: Model checking linear temporal logic of rewriting formulas under localized fairness
  publication-title: Sci. Comput. Program.
– start-page: 71
  year: 2007
  end-page: 85
  ident: br0210
  article-title: A systematic approach to uncover security flaws in GUI logic
  publication-title: 2007 IEEE Symposium on Security and Privacy
– start-page: 183
  year: 2016
  end-page: 192
  ident: br0390
  article-title: Built-in variant generation and unification, and their applications in Maude 2.7
  publication-title: Automated Reasoning – Proceedings of the 8th International Joint Conference
– volume: 39
  start-page: 95
  year: 1992
  end-page: 146
  ident: br0630
  article-title: Institutions: abstract model theory for specification and programming
  publication-title: J. ACM
– volume: 86
  start-page: 269
  year: 2017
  end-page: 297
  ident: br1150
  article-title: Rewriting modulo SMT and open system analysis
  publication-title: J. Log. Algebraic Methods Program.
– reference: , 2009, pp. 227–247.
– start-page: 331
  year: 1996
  end-page: 372
  ident: br0940
  article-title: Rewriting logic as a semantic framework for concurrency: a progress report
  publication-title: CONCUR '96, Concurrency Theory, Proceedings of the 7th International Conference
– volume: 62
  start-page: 95
  year: 2007
  end-page: 116
  ident: br0870
  article-title: Strategies and simulations in a semantic framework
  publication-title: J. Algorithms
– volume: 81
  start-page: 721
  year: 2012
  end-page: 781
  ident: br0980
  article-title: Twenty years of rewriting logic
  publication-title: J. Log. Algebraic Program.
– volume: 22
  start-page: 424
  year: 1979
  end-page: 436
  ident: br0780
  article-title: Algorithm = logic + control
  publication-title: Commun. ACM
– reference: , 2015, pp. 451–474.
– start-page: 314
  year: 1993
  end-page: 390
  ident: br0920
  article-title: A logical theory of concurrent objects and its realization in the Maude language
  publication-title: Research Directions in Concurrent Object-Oriented Programming
– start-page: 27
  year: 2019
  end-page: 44
  ident: br1200
  article-title: Parameterized strategies specification in Maude
  publication-title: Recent Trends in Algebraic Development Techniques, 24th IFIP WG 1.3 International Workshop
– volume: vol. 4350
  year: 2007
  ident: br0280
  article-title: All About Maude – A High-Performance Logical Framework
  publication-title: Lecture Notes in Computer Science
– start-page: 18
  year: 1997
  end-page: 61
  ident: br0950
  article-title: Membership algebra as a logical framework for equational specification
  publication-title: Recent Trends in Algebraic Development Techniques, 12th International Workshop
– start-page: 250
  year: 2001
  end-page: 303
  ident: br1280
  article-title: Rewriting logic as a unifying framework for Petri nets
  publication-title: Unifying Petri Nets, Advances in Petri Nets
– start-page: 81
  year: 2013
  end-page: 96
  ident: br0070
  article-title: Abstract logical model checking of infinite-state systems using narrowing
  publication-title: 24th International Conference on Rewriting Techniques and Applications
– start-page: 38
  year: 2019
  end-page: 55
  ident: br0040
  article-title: Homeomorphic embedding modulo combinations of associativity and commutativity axioms
  publication-title: Logic-Based Program Synthesis and Transformation – 28th International Symposium
– volume: vol. 9200
  year: 2015
  ident: br0860
  publication-title: Logic, Rewriting, and Concurrency - Essays dedicated to José Meseguer on the Occasion of His 65th Birthday
– reference: , 2018, pp. 26–44.
– volume: 29
  start-page: 423
  year: 2017
  end-page: 452
  ident: br1090
  article-title: Equational formulas and pattern operations in initial order-sorted algebras
  publication-title: Form. Asp. Comput.
– volume: 8
  start-page: 383
  year: 1989
  end-page: 413
  ident: br1040
  article-title: Order-sorted unification
  publication-title: J. Symb. Comput.
– volume: vol. 15
  year: 1998
  ident: br0770
  publication-title: Proceedings of the Second International Workshop on Rewriting Logic and its Applications
– start-page: 555
  year: 2012
  end-page: 574
  ident: br1170
  article-title: Checking reachability using matching logic
  publication-title: Proceedings of the 27th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2012, part of SPLASH 2012
– reference: F. Durán, P.C. Ölveczky, A guide to extending Full Maude illustrated with the implementation of Real-Time Maude, in:
– reference: H. Garavel, M. Tabikh, I. Arrada, Benchmarking implementations of term rewriting and pattern matching in algebraic, functional, and object-oriented languages – the 4th rewrite engines competition, in:
– reference: F. Durán, S. Eker, S. Escobar, N. Martí-Oliet, J. Meseguer, C.L. Talcott, Associative unification and symbolic reasoning modulo associativity in Maude, in:
– volume: 81
  start-page: 816
  year: 2012
  end-page: 850
  ident: br0470
  article-title: On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
  publication-title: J. Log. Algebraic Program.
– volume: 99
  start-page: 235
  year: 2015
  end-page: 261
  ident: br0700
  article-title: Order-sorted equality enrichments modulo axioms
  publication-title: Sci. Comput. Program.
– volume: 373
  start-page: 213
  year: 2007
  end-page: 237
  ident: br1070
  article-title: The rewriting logic semantics project
  publication-title: Theor. Comput. Sci.
– reference: , 2009, pp. 83–102.
– start-page: 74
  year: 2016
  end-page: 91
  ident: br1320
  article-title: Semantics-based program verifiers for all languages
  publication-title: Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2016, part of SPLASH 2016
– volume: 80
  start-page: 125
  year: 2017
  end-page: 163
  ident: br0800
  article-title: A generic framework for symbolic execution: a coinductive approach
  publication-title: J. Symb. Comput.
– volume: 1
  start-page: 179
  year: 1984
  end-page: 210
  ident: br0640
  article-title: Equality, types, modules and (why not?) generics for logic programming
  publication-title: J. Log. Program.
– reference: , 2014, pp. 61–76.
– start-page: 3
  year: 2000
  end-page: 167
  ident: br0670
  article-title: Introducing OBJ
  publication-title: Software Engineering with OBJ: Algebraic Specification in Action
– reference: J. Meseguer, Generalized rewrite theories and coherence completion, in:
– start-page: 1
  year: 2009
  end-page: 50
  ident: br0580
  article-title: Maude-NPA: cryptographic protocol analysis modulo equational properties
  publication-title: Foundations of Security Analysis and Design V, FOSAD 2007/2008/2009 Tutorial Lectures
– start-page: 117
  year: 2017
  end-page: 140
  ident: br0370
  article-title: Beyond subterm-convergent equational theories in automated verification of stateful protocols
  publication-title: Principles of Security and Trust – Proceedings of the 6th International Conference
– reference: S. Escobar, Multi-paradigm programming in Maude, in:
– start-page: 158
  year: 1992
  end-page: 200
  ident: br0910
  article-title: Multiparadigm logic programming
  publication-title: Algebraic and Logic Programming, Proceedings of the Third International Conference
– start-page: 220
  year: 1993
  end-page: 246
  ident: br0930
  article-title: Solving the inheritance anomaly in concurrent object-oriented programming
  publication-title: ECOOP'93 – Object-Oriented Programming, Proceedings of the 7th European Conference
– start-page: 37
  year: 2008
  end-page: 50
  ident: br0710
  article-title: Order-sorted equational unification revisited
  publication-title: Proceedings of the Ninth International Workshop on Rule-Based Programming
– volume: 111
  year: 2020
  ident: br0510
  article-title: Ground confluence of order-sorted conditional specifications modulo axioms
  publication-title: J. Log. Algebraic Methods Program.
– reference: K. Bae, J. Meseguer, Predicate abstraction of rewrite theories, in:
– volume: vol. 8560
  year: 2014
  ident: br0360
  publication-title: Rewriting and Typed Lambda Calculi – Proceedings of the Joint International Conference, RTA-TLCA 2014, Held as Part of the Vienna Summer of Logic
– start-page: 73
  year: 2000
  end-page: 85
  ident: br0420
  article-title: Principles of Mobile Maude
  publication-title: Agent Systems, Mobile Agents, and Applications, Proceedings of the Second International Symposium on Agent Systems and Applications and Fourth International Symposium on Mobile Agents
– reference: R. Gutiérrez, J. Meseguer, Variant-based decidable satisfiability in initial algebras with predicates, in:
– reference: , 1998, pp. 55–70.
– start-page: 31
  year: 2011
  end-page: 40
  ident: br0410
  article-title: Variants, unification, narrowing, and symbolic reachability in Maude 2.6
  publication-title: Proceedings of the 22nd International Conference on Rewriting Techniques and Applications
– start-page: 150
  year: 2008
  end-page: 169
  ident: br0760
  article-title: Redesign of the LMST wireless sensor protocol through formal modeling and statistical model checking
  publication-title: Formal Methods for Open Object-Based Distributed Systems, Proceedings of the 10th IFIP WG 6.1 International Conference
– start-page: 25
  year: 2018
  end-page: 60
  ident: br1010
  article-title: Symbolic reasoning methods in rewriting logic and Maude
  publication-title: Logic, Language, Information, and Computation – Proceedings of the 25th International Workshop
– start-page: 65
  year: 1996
  end-page: 89
  ident: br0290
  article-title: Principles of Maude
  publication-title: Proceedings of the First International Workshop on Rewriting Logic and its Applications
– start-page: 1
  year: 2002
  end-page: 36
  ident: br1100
  article-title: Semantic models for distributed object reflection
  publication-title: ECOOP 2002 – Object-Oriented Programming, Proceedings of the 16th European Conference
– start-page: 315
  year: 2014
  end-page: 336
  ident: br0560
  article-title: Functional logic programming in Maude
  publication-title: Specification, Algebra, and Software – Essays Dedicated to Kokichi Futatsugi
– volume: 154
  start-page: 3
  year: 2018
  end-page: 41
  ident: br1020
  article-title: Variant-based satisfiability in initial algebras
  publication-title: Sci. Comput. Program.
– volume: 235
  start-page: 98
  year: 2014
  end-page: 136
  ident: br0060
  article-title: A modular order-sorted equational generalization algorithm
  publication-title: Inf. Comput.
– start-page: 422
  year: 2000
  end-page: 437
  ident: br0380
  article-title: The extensibility of Maude's module algebra
  publication-title: Algebraic Methodology and Software Technology, Proceedings of the 8th International Conference
– volume: 96
  start-page: 73
  year: 1992
  end-page: 155
  ident: br0900
  article-title: Conditional rewriting logic as a unified model of concurrency
  publication-title: Theor. Comput. Sci.
– start-page: 119
  year: 2007
  end-page: 137
  ident: br0720
  article-title: Using Maude and its strategies for defining a framework for analyzing Eden semantics
  publication-title: Proceedings of the Sixth International Workshop on Reduction Strategies in Rewriting and Programming
– reference: , 2018, pp. 1–25.
– year: 2005
  ident: br0320
  article-title: The ITP Tool's Manual
– reference: P. Borovanský, C. Kirchner, H. Kirchner, P.E. Moreau, C. Ringeissen, An overview of ELAN, in:
– volume: 81
  start-page: 898
  year: 2012
  end-page: 928
  ident: br0600
  article-title: Folding variant narrowing and optimal variant termination
  publication-title: J. Log. Algebraic Program.
– volume: 238
  start-page: 157
  year: 2014
  end-page: 186
  ident: br0590
  article-title: State space reduction in the Maude-NRL protocol analyzer
  publication-title: Inf. Comput.
– start-page: 43
  year: 2009
  end-page: 80
  ident: br0970
  article-title: Order-sorted parameterization and induction
  publication-title: Semantics and Algebraic Specification, Essays Dedicated to Peter D. Mosses on the Occasion of His 60th Birthday
– volume: 373
  start-page: 70
  year: 2007
  end-page: 91
  ident: br0310
  article-title: Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
  publication-title: Theor. Comput. Sci.
– reference: C. Olarte, E. Pimentel, C. Rocha, Proving structural properties of sequent systems in rewriting logic, in:
– year: 2018
  ident: br0120
  article-title: CVC4 at the SMT competition 2018
  publication-title: CoRR
– volume: vol. 238(3)
  year: 2009
  ident: br1160
  publication-title: Proceedings of the Seventh International Workshop on Rewriting Logic and its Applications
– start-page: 334
  year: 2004
  end-page: 375
  ident: br1270
  article-title: Pure type systems in rewriting logic: specifying typed higher-order languages in a first-order logical framework
  publication-title: From Object-Orientation to Formal Methods, Essays in Memory of Ole-Johan Dahl
– volume: 91
  start-page: 3
  year: 2014
  end-page: 44
  ident: br0110
  article-title: Formal patterns for multirate distributed real-time systems
  publication-title: Sci. Comput. Program.
– start-page: 295
  year: 1986
  end-page: 363
  ident: br0650
  article-title: Eqlog: equality, types, and generic modules for logic programming
  publication-title: Logic Programming: Functions, Relations and Equations
– reference: , 2018, pp. 201–217.
– start-page: 213
  year: 2006
  end-page: 239
  ident: br0010
  article-title: PMaude: rewrite-based specification language for probabilistic object systems
  publication-title: Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages
– volume: 96
  start-page: 81
  year: 2018
  end-page: 110
  ident: br1240
  article-title: Metalevel algorithms for variant satisfiability
  publication-title: J. Log. Algebraic Methods Program.
– start-page: 400
  year: 2011
  end-page: 406
  ident: br0500
  article-title: Tool interoperability in the Maude Formal Environment
  publication-title: Algebra and Coalgebra in Computer Science – Proceedings of the 4th International Conference
– year: 2015
  ident: br0790
  article-title: Modeling and analyzing mobile ad hoc networks in Real-Time Maude
  publication-title: J. Log. Algebraic Methods Program.
– reference: , 2018, pp. 164–183.
– start-page: 113
  year: 2014
  end-page: 129
  ident: br0080
  article-title: Infinite-state model checking of LTLR formulas using narrowing
  publication-title: Rewriting Logic and Its Applications – 10th International Workshop
– start-page: 243
  year: 1990
  end-page: 320
  ident: br0350
  article-title: Rewrite systems
  publication-title: Handbook of Theoretical Computer Science, Vol. B
– volume: 66
  start-page: 125
  year: 2007
  end-page: 153
  ident: br0460
  article-title: Maude's module algebra
  publication-title: Sci. Comput. Program.
– start-page: 351
  year: 2000
  end-page: 366
  ident: br1340
  article-title: Implementing CCS in Maude
  publication-title: Formal Techniques for Distributed System Development, FORTE/PSTV 2000, IFIP TC6 WG6.1, Proceedings of the Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
– start-page: 70
  year: 2000
  end-page: 92
  ident: br1260
  article-title: CINNI – a generic calculus of explicit substitutions and its application to lambda-, sigma- and pi-calculi
  publication-title: Proceedings of the Third International Workshop on Rewriting Logic and its Applications
– start-page: 400
  year: 2002
  end-page: 412
  ident: br0540
  article-title: Pathway logic: symbolic analysis of biological signaling
  publication-title: Proceedings of the 7th Pacific Symposium on Biocomputing
– start-page: 10
  year: 2018
  end-page: 48
  ident: br0140
  article-title: Design, formal modeling, and validation of cloud storage systems using Maude
  publication-title: Assured Cloud Computing
– volume: 99
  start-page: 3
  year: 2015
  end-page: 23
  ident: br1330
  article-title: A rule-based system for automatic decidability and combinability
  publication-title: Sci. Comput. Program.
– volume: 105
  start-page: 217
  year: 1992
  end-page: 273
  ident: br0660
  article-title: Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations
  publication-title: Theor. Comput. Sci.
– year: 2019
  ident: br0240
  article-title: Maude Manual (Version 3.0)
– volume: vol. 81
  start-page: 76
  year: 1980
  end-page: 90
  ident: br0130
  article-title: Characterization of computable data types by means of a finite equational specification method
  publication-title: Automata, Languages and Programming, Seventh Colloquium
– volume: 81
  start-page: 929
  year: 2012
  end-page: 956
  ident: br0750
  article-title: Rewriting semantics of production rule sets
  publication-title: J. Log. Algebraic Program.
– reference: D. Lucanu, V. Rusu, A. Arusoaie, D. Nowak, Verifying reachability-logic properties on rewriting-logic specifications, in:
– start-page: 380
  year: 2009
  end-page: 390
  ident: br0250
  article-title: Unification and narrowing in Maude 2.4
  publication-title: Rewriting Techniques and Applications, Proceedings of the 20th International Conference
– volume: 236
  start-page: 35
  year: 2000
  end-page: 132
  ident: br0160
  article-title: Specification and proof in membership equational logic
  publication-title: Theor. Comput. Sci.
– start-page: 387
  year: 2012
  end-page: 402
  ident: br1180
  article-title: From Hoare logic to matching logic reachability
  publication-title: FM 2012: Formal Methods – Proceedings of the 18th International Symposium
– volume: 285
  start-page: 245
  year: 2002
  end-page: 288
  ident: br0300
  article-title: Reflection in conditional rewriting logic
  publication-title: Theor. Comput. Sci.
– volume: 20
  start-page: 161
  year: 2007
  end-page: 196
  ident: br1130
  article-title: Semantics and pragmatics of Real-Time Maude
  publication-title: High.-Order Symb. Comput.
– reference: , 2018, pp. 98–114.
– volume: vol. 10855
  year: 2018
  ident: br0610
  publication-title: Logic-Based Program Synthesis and Transformation – 27th International Symposium
– volume: 231
  start-page: 38
  year: 2013
  end-page: 69
  ident: br1080
  article-title: The rewriting logic semantics project: a progress report
  publication-title: Inf. Comput.
– reference: , 2015, pp. 232–254.
– reference: F. Durán, J. Meseguer, An extensible module algebra for Maude, in:
– start-page: 275
  year: 1989
  end-page: 329
  ident: br0890
  article-title: General logics
  publication-title: Logic Colloquium'87, Proceedings of the Colloquium held in Granada
– start-page: 3
  year: 2007
  end-page: 25
  ident: br0550
  article-title: Deduction, strategies, and rewriting
  publication-title: Proceedings of the 6th International Workshop on Strategies in Automated Deduction
– volume: 21
  start-page: 59
  year: 2008
  end-page: 88
  ident: br0430
  article-title: Proving operational termination of membership equational programs
  publication-title: High.-Order Symb. Comput.
– start-page: 85
  year: 1999
  end-page: 99
  ident: br0200
  article-title: A functional-logic perspective on parsing
  publication-title: Functional and Logic Programming, Proceedings of the 4th Fuji International Symposium
– reference: , 2014, pp. 425–440.
– start-page: 354
  year: 2008
  end-page: 382
  ident: br0960
  article-title: The temporal logic of rewriting: a gentle introduction
  publication-title: Concurrency, Graphs and Models, Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday
– volume: 309
  start-page: 357
  year: 2003
  end-page: 380
  ident: br0450
  article-title: Structured theories and institutions
  publication-title: Theor. Comput. Sci.
– start-page: 361
  year: 1983
  end-page: 373
  ident: br0740
  article-title: Incremental construction of unification algorithms in equational theories
  publication-title: Automata, Languages and Programming, Proceedings of the 10th Colloquium
– volume: 403
  start-page: 239
  year: 2008
  end-page: 264
  ident: br1060
  article-title: Equational abstractions
  publication-title: Theor. Comput. Sci.
– volume: vol. 11152
  year: 2018
  ident: br1210
  publication-title: Rewriting Logic and Its Applications – Proceedings of the 12th International Workshop, WRLA 2018, Held as a Satellite Event of ETAPS
– volume: 110
  year: 2020
  ident: br0050
  article-title: A partial evaluation framework for order-sorted equational programs modulo axioms
  publication-title: J. Log. Algebraic Methods Program.
– start-page: 737
  year: 2014
  end-page: 744
  ident: br0520
  article-title: Yices 2.2
  publication-title: Computer Aided Verification – Proceedings of the 26th International Conference, CAV 2014, Held as Part of the Vienna Summer of Logic
– start-page: 1
  year: 2002
  end-page: 87
  ident: br0830
  article-title: Rewriting logic as a logical and semantic framework
  publication-title: Handbook of Philosophical Logic
– volume: 72
  start-page: 52
  year: 2008
  end-page: 70
  ident: br0180
  article-title: Stratego/xt 0.17. A language and toolset for program transformation
  publication-title: Sci. Comput. Program.
– start-page: 417
  year: 2004
  end-page: 441
  ident: br0840
  article-title: Towards a strategy language for Maude
  publication-title: Proceedings of the Fifth International Workshop on Rewriting Logic and its Applications
– volume: 360
  start-page: 386
  year: 2006
  end-page: 414
  ident: br0190
  article-title: Semantic foundations for generalized rewrite theories
  publication-title: Theor. Comput. Sci.
– start-page: 696
  year: 2013
  end-page: 701
  ident: br0880
  article-title: The TAMARIN prover for the symbolic analysis of security protocols
  publication-title: Computer Aided Verification – Proceedings of the 25th International Conference
– volume: 207
  start-page: 305
  year: 2009
  end-page: 340
  ident: br1230
  article-title: A rewriting logic approach to operational semantics
  publication-title: Inf. Comput.
– volume: 16
  start-page: 14
  year: 1951
  end-page: 21
  ident: br0730
  article-title: On sentences which are true of direct unions of algebras
  publication-title: J. Symb. Log.
– year: 2014
  ident: br0220
  article-title: Variants of Variants and the Finite Variant Property
– year: 2019
  ident: br1190
  article-title: Model checking strategy-controlled rewriting systems
  publication-title: 4th International Conference on Formal Structures for Computation and Deduction
– start-page: 295
  year: 2018
  end-page: 311
  ident: br0230
  article-title: A coinductive approach to proving reachability properties in logically constrained term rewriting systems
  publication-title: Automated Reasoning – Proceedings of the 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference
– reference: M. Clavel, F. Durán, S. Eker, S. Escobar, P. Lincoln, N. Martí-Oliet, C.L. Talcott, Two decades of Maude, in:
– year: 1979
  ident: br0330
  article-title: Étude et Réalisation d'un Système Prolog
– start-page: 294
  year: 2005
  end-page: 307
  ident: br0340
  article-title: The finite variant property: how to get rid of some algebraic properties
  publication-title: Term Rewriting and Applications, Proceedings of the 16th International Conference
– reference: S. Skeirik, A. Ştefănescu, J. Meseguer, A constructor-based reachability logic for rewrite theories, in:
– reference: N. Martí-Oliet, J. Meseguer, A. Verdejo, A rewriting semantics for Maude strategies, in:
– start-page: 113
  year: 2007
  end-page: 131
  ident: br0490
  article-title: A distributed implementation of Mobile Maude
  publication-title: Proceedings of the Sixth International Workshop on Rewriting Logic and its Applications
– volume: 451
  start-page: 1
  year: 2012
  end-page: 37
  ident: br1050
  article-title: Formalization and correctness of the PALS architectural pattern for distributed real-time systems
  publication-title: Theor. Comp. Sci.
– volume: 410
  start-page: 254
  year: 2009
  end-page: 280
  ident: br1140
  article-title: Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude
  publication-title: Theor. Comput. Sci.
– volume: 672
  start-page: 1
  year: 2017
  end-page: 35
  ident: br0990
  article-title: Strict coherence of conditional rewriting modulo axioms
  publication-title: Theor. Comput. Sci.
– start-page: 3
  year: 2017
  end-page: 20
  ident: br0030
  article-title: Partial evaluation of order-sorted equational programs modulo axioms
  publication-title: Logic-Based Program Synthesis and Transformation - 26th International Symposium
– reference: , 1998, pp. 174–195.
– start-page: 224
  year: 2013
  end-page: 241
  ident: br1220
  article-title: IBOS: a correct-by-construction modular browser
  publication-title: Formal Aspects of Component Software, 9th International Symposium
– start-page: 275
  year: 1989
  ident: 10.1016/j.jlamp.2019.100497_br0890
  article-title: General logics
– ident: 10.1016/j.jlamp.2019.100497_br0690
  doi: 10.1007/978-3-319-94460-9_18
– start-page: 43
  year: 2009
  ident: 10.1016/j.jlamp.2019.100497_br0970
  article-title: Order-sorted parameterization and induction
– start-page: 119
  year: 2007
  ident: 10.1016/j.jlamp.2019.100497_br0720
  article-title: Using Maude and its strategies for defining a framework for analyzing Eden semantics
– start-page: 243
  year: 1990
  ident: 10.1016/j.jlamp.2019.100497_br0350
  article-title: Rewrite systems
– start-page: 113
  year: 2007
  ident: 10.1016/j.jlamp.2019.100497_br0490
  article-title: A distributed implementation of Mobile Maude
– ident: 10.1016/j.jlamp.2019.100497_br0440
  doi: 10.1016/S1571-0661(05)80012-X
– volume: 672
  start-page: 1
  year: 2017
  ident: 10.1016/j.jlamp.2019.100497_br0990
  article-title: Strict coherence of conditional rewriting modulo axioms
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2016.12.026
– ident: 10.1016/j.jlamp.2019.100497_br0570
  doi: 10.1007/978-3-319-99840-4_2
– start-page: 1
  year: 2002
  ident: 10.1016/j.jlamp.2019.100497_br1100
  article-title: Semantic models for distributed object reflection
– volume: 154
  start-page: 3
  year: 2018
  ident: 10.1016/j.jlamp.2019.100497_br1020
  article-title: Variant-based satisfiability in initial algebras
  publication-title: Sci. Comput. Program.
  doi: 10.1016/j.scico.2017.09.001
– volume: 410
  start-page: 254
  year: 2009
  ident: 10.1016/j.jlamp.2019.100497_br1140
  article-title: Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2008.09.022
– ident: 10.1016/j.jlamp.2019.100497_br1310
  doi: 10.1007/978-3-319-08918-8_29
– start-page: 295
  year: 2018
  ident: 10.1016/j.jlamp.2019.100497_br0230
  article-title: A coinductive approach to proving reachability properties in logically constrained term rewriting systems
– start-page: 3
  year: 2017
  ident: 10.1016/j.jlamp.2019.100497_br0030
  article-title: Partial evaluation of order-sorted equational programs modulo axioms
– start-page: 400
  year: 2018
  ident: 10.1016/j.jlamp.2019.100497_br0680
  article-title: Formal verification of the YubiKey and YubiHSM APIs in Maude-NPA
– start-page: 25
  year: 2018
  ident: 10.1016/j.jlamp.2019.100497_br1010
  article-title: Symbolic reasoning methods in rewriting logic and Maude
– start-page: 380
  year: 2009
  ident: 10.1016/j.jlamp.2019.100497_br0250
  article-title: Unification and narrowing in Maude 2.4
– start-page: 117
  year: 2017
  ident: 10.1016/j.jlamp.2019.100497_br0370
  article-title: Beyond subterm-convergent equational theories in automated verification of stateful protocols
– volume: 110
  year: 2020
  ident: 10.1016/j.jlamp.2019.100497_br1030
  article-title: Generalized rewrite theories, coherence completion, and symbolic methods
  publication-title: J. Log. Algebraic Methods Program.
– volume: vol. 9200
  year: 2015
  ident: 10.1016/j.jlamp.2019.100497_br0860
– start-page: 224
  year: 2013
  ident: 10.1016/j.jlamp.2019.100497_br1220
  article-title: IBOS: a correct-by-construction modular browser
– start-page: 294
  year: 2005
  ident: 10.1016/j.jlamp.2019.100497_br0340
  article-title: The finite variant property: how to get rid of some algebraic properties
– volume: 309
  start-page: 357
  year: 2003
  ident: 10.1016/j.jlamp.2019.100497_br0450
  article-title: Structured theories and institutions
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(03)00312-8
– volume: 8
  start-page: 383
  year: 1989
  ident: 10.1016/j.jlamp.2019.100497_br1040
  article-title: Order-sorted unification
  publication-title: J. Symb. Comput.
  doi: 10.1016/S0747-7171(89)80036-7
– volume: 236
  start-page: 35
  year: 2000
  ident: 10.1016/j.jlamp.2019.100497_br0160
  article-title: Specification and proof in membership equational logic
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(99)00206-6
– start-page: 400
  year: 2002
  ident: 10.1016/j.jlamp.2019.100497_br0540
  article-title: Pathway logic: symbolic analysis of biological signaling
– start-page: 3
  year: 2007
  ident: 10.1016/j.jlamp.2019.100497_br0550
  article-title: Deduction, strategies, and rewriting
– start-page: 250
  year: 2001
  ident: 10.1016/j.jlamp.2019.100497_br1280
  article-title: Rewriting logic as a unifying framework for Petri nets
– volume: 81
  start-page: 721
  year: 2012
  ident: 10.1016/j.jlamp.2019.100497_br0980
  article-title: Twenty years of rewriting logic
  publication-title: J. Log. Algebraic Program.
  doi: 10.1016/j.jlap.2012.06.003
– start-page: 387
  year: 2012
  ident: 10.1016/j.jlamp.2019.100497_br1180
  article-title: From Hoare logic to matching logic reachability
– start-page: 417
  year: 2004
  ident: 10.1016/j.jlamp.2019.100497_br0840
  article-title: Towards a strategy language for Maude
– year: 2018
  ident: 10.1016/j.jlamp.2019.100497_br0120
  article-title: CVC4 at the SMT competition 2018
  publication-title: CoRR
– volume: 86
  start-page: 269
  year: 2017
  ident: 10.1016/j.jlamp.2019.100497_br1150
  article-title: Rewriting modulo SMT and open system analysis
  publication-title: J. Log. Algebraic Methods Program.
  doi: 10.1016/j.jlamp.2016.10.001
– ident: 10.1016/j.jlamp.2019.100497_br0810
  doi: 10.1007/978-3-319-23165-5_21
– volume: 96
  start-page: 73
  year: 1992
  ident: 10.1016/j.jlamp.2019.100497_br0900
  article-title: Conditional rewriting logic as a unified model of concurrency
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(92)90182-F
– volume: 66
  start-page: 125
  year: 2007
  ident: 10.1016/j.jlamp.2019.100497_br0460
  article-title: Maude's module algebra
  publication-title: Sci. Comput. Program.
  doi: 10.1016/j.scico.2006.07.002
– volume: 85
  start-page: 67
  year: 2016
  ident: 10.1016/j.jlamp.2019.100497_br0820
  article-title: Normal forms and normal theories in conditional rewriting
  publication-title: J. Log. Algebraic Methods Program.
  doi: 10.1016/j.jlamp.2015.06.001
– volume: 99
  start-page: 193
  year: 2015
  ident: 10.1016/j.jlamp.2019.100497_br0100
  article-title: Model checking linear temporal logic of rewriting formulas under localized fairness
  publication-title: Sci. Comput. Program.
  doi: 10.1016/j.scico.2014.02.006
– volume: 81
  start-page: 929
  year: 2012
  ident: 10.1016/j.jlamp.2019.100497_br0750
  article-title: Rewriting semantics of production rule sets
  publication-title: J. Log. Algebraic Program.
  doi: 10.1016/j.jlap.2012.06.002
– start-page: 85
  year: 1999
  ident: 10.1016/j.jlamp.2019.100497_br0200
  article-title: A functional-logic perspective on parsing
– start-page: 71
  year: 2007
  ident: 10.1016/j.jlamp.2019.100497_br0210
  article-title: A systematic approach to uncover security flaws in GUI logic
– start-page: 400
  year: 2011
  ident: 10.1016/j.jlamp.2019.100497_br0500
  article-title: Tool interoperability in the Maude Formal Environment
– volume: 91
  start-page: 3
  year: 2014
  ident: 10.1016/j.jlamp.2019.100497_br0110
  article-title: Formal patterns for multirate distributed real-time systems
  publication-title: Sci. Comput. Program.
  doi: 10.1016/j.scico.2013.09.010
– volume: 285
  start-page: 245
  year: 2002
  ident: 10.1016/j.jlamp.2019.100497_br0300
  article-title: Reflection in conditional rewriting logic
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(01)00360-7
– volume: 22
  start-page: 424
  year: 1979
  ident: 10.1016/j.jlamp.2019.100497_br0780
  article-title: Algorithm = logic + control
  publication-title: Commun. ACM
  doi: 10.1145/359131.359136
– volume: 451
  start-page: 1
  year: 2012
  ident: 10.1016/j.jlamp.2019.100497_br1050
  article-title: Formalization and correctness of the PALS architectural pattern for distributed real-time systems
  publication-title: Theor. Comp. Sci.
  doi: 10.1016/j.tcs.2012.05.040
– start-page: 295
  year: 1986
  ident: 10.1016/j.jlamp.2019.100497_br0650
  article-title: Eqlog: equality, types, and generic modules for logic programming
– volume: 403
  start-page: 239
  year: 2008
  ident: 10.1016/j.jlamp.2019.100497_br1060
  article-title: Equational abstractions
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2008.04.040
– year: 2019
  ident: 10.1016/j.jlamp.2019.100497_br0240
– ident: 10.1016/j.jlamp.2019.100497_br0400
  doi: 10.1007/978-3-319-99840-4_6
– start-page: 351
  year: 2000
  ident: 10.1016/j.jlamp.2019.100497_br1340
  article-title: Implementing CCS in Maude
– year: 2019
  ident: 10.1016/j.jlamp.2019.100497_br1190
  article-title: Model checking strategy-controlled rewriting systems
– volume: 81
  start-page: 816
  year: 2012
  ident: 10.1016/j.jlamp.2019.100497_br0470
  article-title: On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
  publication-title: J. Log. Algebraic Program.
  doi: 10.1016/j.jlap.2011.12.004
– volume: vol. 15
  year: 1998
  ident: 10.1016/j.jlamp.2019.100497_br0770
– start-page: 334
  year: 2004
  ident: 10.1016/j.jlamp.2019.100497_br1270
  article-title: Pure type systems in rewriting logic: specifying typed higher-order languages in a first-order logical framework
– start-page: 31
  year: 2011
  ident: 10.1016/j.jlamp.2019.100497_br0410
  article-title: Variants, unification, narrowing, and symbolic reachability in Maude 2.6
– start-page: 361
  year: 1983
  ident: 10.1016/j.jlamp.2019.100497_br0740
  article-title: Incremental construction of unification algorithms in equational theories
– volume: vol. 8560
  year: 2014
  ident: 10.1016/j.jlamp.2019.100497_br0360
– volume: 1
  start-page: 179
  year: 1984
  ident: 10.1016/j.jlamp.2019.100497_br0640
  article-title: Equality, types, modules and (why not?) generics for logic programming
  publication-title: J. Log. Program.
  doi: 10.1016/0743-1066(84)90004-9
– ident: 10.1016/j.jlamp.2019.100497_br1250
  doi: 10.1007/978-3-319-94460-9_12
– start-page: 113
  year: 2014
  ident: 10.1016/j.jlamp.2019.100497_br0080
  article-title: Infinite-state model checking of LTLR formulas using narrowing
– volume: 99
  start-page: 235
  year: 2015
  ident: 10.1016/j.jlamp.2019.100497_br0700
  article-title: Order-sorted equality enrichments modulo axioms
  publication-title: Sci. Comput. Program.
  doi: 10.1016/j.scico.2014.07.003
– start-page: 331
  year: 1996
  ident: 10.1016/j.jlamp.2019.100497_br0940
  article-title: Rewriting logic as a semantic framework for concurrency: a progress report
– volume: 99
  start-page: 3
  year: 2015
  ident: 10.1016/j.jlamp.2019.100497_br1330
  article-title: A rule-based system for automatic decidability and combinability
  publication-title: Sci. Comput. Program.
  doi: 10.1016/j.scico.2014.02.005
– volume: 39
  start-page: 95
  year: 1992
  ident: 10.1016/j.jlamp.2019.100497_br0630
  article-title: Institutions: abstract model theory for specification and programming
  publication-title: J. ACM
  doi: 10.1145/147508.147524
– start-page: 73
  year: 2000
  ident: 10.1016/j.jlamp.2019.100497_br0420
  article-title: Principles of Mobile Maude
– ident: 10.1016/j.jlamp.2019.100497_br0150
  doi: 10.1016/S1571-0661(05)82552-6
– volume: 373
  start-page: 70
  year: 2007
  ident: 10.1016/j.jlamp.2019.100497_br0310
  article-title: Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2006.12.009
– start-page: 422
  year: 2000
  ident: 10.1016/j.jlamp.2019.100497_br0380
  article-title: The extensibility of Maude's module algebra
– volume: 80
  start-page: 125
  year: 2017
  ident: 10.1016/j.jlamp.2019.100497_br0800
  article-title: A generic framework for symbolic execution: a coinductive approach
  publication-title: J. Symb. Comput.
  doi: 10.1016/j.jsc.2016.07.012
– start-page: 37
  year: 2008
  ident: 10.1016/j.jlamp.2019.100497_br0710
  article-title: Order-sorted equational unification revisited
– start-page: 3
  year: 2000
  ident: 10.1016/j.jlamp.2019.100497_br0670
  article-title: Introducing OBJ
– start-page: 354
  year: 2008
  ident: 10.1016/j.jlamp.2019.100497_br0960
  article-title: The temporal logic of rewriting: a gentle introduction
– volume: vol. 238(3)
  year: 2009
  ident: 10.1016/j.jlamp.2019.100497_br1160
– volume: vol. 10855
  year: 2018
  ident: 10.1016/j.jlamp.2019.100497_br0610
– volume: 373
  start-page: 213
  year: 2007
  ident: 10.1016/j.jlamp.2019.100497_br1070
  article-title: The rewriting logic semantics project
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2006.12.018
– volume: 20
  start-page: 161
  year: 2007
  ident: 10.1016/j.jlamp.2019.100497_br1130
  article-title: Semantics and pragmatics of Real-Time Maude
  publication-title: High.-Order Symb. Comput.
  doi: 10.1007/s10990-007-9001-5
– volume: 285
  start-page: 187
  year: 2002
  ident: 10.1016/j.jlamp.2019.100497_br0270
  article-title: Maude: specification and programming in rewriting logic
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(01)00359-0
– start-page: 65
  year: 1996
  ident: 10.1016/j.jlamp.2019.100497_br0290
  article-title: Principles of Maude
– start-page: 171
  year: 2019
  ident: 10.1016/j.jlamp.2019.100497_br0020
  article-title: ACUOS2: a high-performance system for modular ACU generalization with subtyping and inheritance
– start-page: 183
  year: 2016
  ident: 10.1016/j.jlamp.2019.100497_br0390
  article-title: Built-in variant generation and unification, and their applications in Maude 2.7
– volume: 29
  start-page: 423
  year: 2017
  ident: 10.1016/j.jlamp.2019.100497_br1090
  article-title: Equational formulas and pattern operations in initial order-sorted algebras
  publication-title: Form. Asp. Comput.
  doi: 10.1007/s00165-017-0415-5
– ident: 10.1016/j.jlamp.2019.100497_br0850
  doi: 10.1016/j.entcs.2009.05.022
– start-page: 70
  year: 2000
  ident: 10.1016/j.jlamp.2019.100497_br1260
  article-title: CINNI – a generic calculus of explicit substitutions and its application to lambda-, sigma- and pi-calculi
– start-page: 74
  year: 2016
  ident: 10.1016/j.jlamp.2019.100497_br1320
  article-title: Semantics-based program verifiers for all languages
– start-page: 81
  year: 2013
  ident: 10.1016/j.jlamp.2019.100497_br0070
  article-title: Abstract logical model checking of infinite-state systems using narrowing
– ident: 10.1016/j.jlamp.2019.100497_br0480
  doi: 10.1016/j.entcs.2009.05.014
– start-page: 737
  year: 2014
  ident: 10.1016/j.jlamp.2019.100497_br0520
  article-title: Yices 2.2
– year: 1979
  ident: 10.1016/j.jlamp.2019.100497_br0330
– start-page: 314
  year: 1993
  ident: 10.1016/j.jlamp.2019.100497_br0920
  article-title: A logical theory of concurrent objects and its realization in the Maude language
– start-page: 18
  year: 1997
  ident: 10.1016/j.jlamp.2019.100497_br0950
  article-title: Membership algebra as a logical framework for equational specification
– year: 2005
  ident: 10.1016/j.jlamp.2019.100497_br0320
– start-page: 220
  year: 1993
  ident: 10.1016/j.jlamp.2019.100497_br0930
  article-title: Solving the inheritance anomaly in concurrent object-oriented programming
– volume: 21
  start-page: 59
  year: 2008
  ident: 10.1016/j.jlamp.2019.100497_br0430
  article-title: Proving operational termination of membership equational programs
  publication-title: High.-Order Symb. Comput.
  doi: 10.1007/s10990-008-9028-2
– start-page: 10
  year: 2018
  ident: 10.1016/j.jlamp.2019.100497_br0140
  article-title: Design, formal modeling, and validation of cloud storage systems using Maude
– volume: 16
  start-page: 14
  year: 1951
  ident: 10.1016/j.jlamp.2019.100497_br0730
  article-title: On sentences which are true of direct unions of algebras
  publication-title: J. Symb. Log.
  doi: 10.2307/2268661
– year: 2015
  ident: 10.1016/j.jlamp.2019.100497_br0790
  article-title: Modeling and analyzing mobile ad hoc networks in Real-Time Maude
  publication-title: J. Log. Algebraic Methods Program.
– volume: 111
  year: 2020
  ident: 10.1016/j.jlamp.2019.100497_br0510
  article-title: Ground confluence of order-sorted conditional specifications modulo axioms
  publication-title: J. Log. Algebraic Methods Program.
– ident: 10.1016/j.jlamp.2019.100497_br0260
  doi: 10.1007/978-3-319-23165-5_11
– start-page: 299
  year: 2011
  ident: 10.1016/j.jlamp.2019.100497_br0530
  article-title: Fast sort computations for order-sorted matching and unification
– start-page: 38
  year: 2019
  ident: 10.1016/j.jlamp.2019.100497_br0040
  article-title: Homeomorphic embedding modulo combinations of associativity and commutativity axioms
– volume: 235
  start-page: 98
  year: 2014
  ident: 10.1016/j.jlamp.2019.100497_br0060
  article-title: A modular order-sorted equational generalization algorithm
  publication-title: Inf. Comput.
  doi: 10.1016/j.ic.2014.01.006
– ident: 10.1016/j.jlamp.2019.100497_br0090
  doi: 10.1007/978-3-319-08918-8_5
– volume: 13
  start-page: 11
  year: 2000
  ident: 10.1016/j.jlamp.2019.100497_br1290
  article-title: Fundamental concepts in programming languages
  publication-title: High.-Order Symb. Comput.
  doi: 10.1023/A:1010000313106
– volume: 360
  start-page: 386
  year: 2006
  ident: 10.1016/j.jlamp.2019.100497_br0190
  article-title: Semantic foundations for generalized rewrite theories
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2006.04.012
– start-page: 568
  year: 2004
  ident: 10.1016/j.jlamp.2019.100497_br1300
  article-title: Pathway logic modeling of protein functional domains in signal transduction
– ident: 10.1016/j.jlamp.2019.100497_br0620
  doi: 10.1007/978-3-319-99840-4_1
– start-page: 696
  year: 2013
  ident: 10.1016/j.jlamp.2019.100497_br0880
  article-title: The TAMARIN prover for the symbolic analysis of security protocols
– volume: 238
  start-page: 157
  year: 2014
  ident: 10.1016/j.jlamp.2019.100497_br0590
  article-title: State space reduction in the Maude-NRL protocol analyzer
  publication-title: Inf. Comput.
  doi: 10.1016/j.ic.2014.07.007
– volume: 231
  start-page: 38
  year: 2013
  ident: 10.1016/j.jlamp.2019.100497_br1080
  article-title: The rewriting logic semantics project: a progress report
  publication-title: Inf. Comput.
  doi: 10.1016/j.ic.2013.08.004
– volume: 105
  start-page: 217
  year: 1992
  ident: 10.1016/j.jlamp.2019.100497_br0660
  article-title: Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(92)90302-V
– start-page: 3
  year: 2007
  ident: 10.1016/j.jlamp.2019.100497_br0170
  article-title: Modular structural operational semantics with strategies
– volume: vol. 4350
  year: 2007
  ident: 10.1016/j.jlamp.2019.100497_br0280
  article-title: All About Maude – A High-Performance Logical Framework
– start-page: 150
  year: 2008
  ident: 10.1016/j.jlamp.2019.100497_br0760
  article-title: Redesign of the LMST wireless sensor protocol through formal modeling and statistical model checking
– volume: 62
  start-page: 95
  year: 2007
  ident: 10.1016/j.jlamp.2019.100497_br0870
  article-title: Strategies and simulations in a semantic framework
  publication-title: J. Algorithms
  doi: 10.1016/j.jalgor.2007.04.002
– volume: 81
  start-page: 898
  year: 2012
  ident: 10.1016/j.jlamp.2019.100497_br0600
  article-title: Folding variant narrowing and optimal variant termination
  publication-title: J. Log. Algebraic Program.
  doi: 10.1016/j.jlap.2012.01.002
– ident: 10.1016/j.jlamp.2019.100497_br1000
  doi: 10.1007/978-3-319-99840-4_10
– start-page: 27
  year: 2019
  ident: 10.1016/j.jlamp.2019.100497_br1200
  article-title: Parameterized strategies specification in Maude
– start-page: 1
  year: 2002
  ident: 10.1016/j.jlamp.2019.100497_br0830
  article-title: Rewriting logic as a logical and semantic framework
– ident: 10.1016/j.jlamp.2019.100497_br1120
  doi: 10.1007/978-3-319-99840-4_7
– start-page: 555
  year: 2012
  ident: 10.1016/j.jlamp.2019.100497_br1170
  article-title: Checking reachability using matching logic
– volume: 72
  start-page: 52
  year: 2008
  ident: 10.1016/j.jlamp.2019.100497_br0180
  article-title: Stratego/xt 0.17. A language and toolset for program transformation
  publication-title: Sci. Comput. Program.
  doi: 10.1016/j.scico.2007.11.003
– volume: vol. 11152
  year: 2018
  ident: 10.1016/j.jlamp.2019.100497_br1210
– start-page: 213
  year: 2006
  ident: 10.1016/j.jlamp.2019.100497_br0010
  article-title: PMaude: rewrite-based specification language for probabilistic object systems
– volume: 110
  year: 2020
  ident: 10.1016/j.jlamp.2019.100497_br0050
  article-title: A partial evaluation framework for order-sorted equational programs modulo axioms
  publication-title: J. Log. Algebraic Methods Program.
– start-page: 1
  year: 2009
  ident: 10.1016/j.jlamp.2019.100497_br0580
  article-title: Maude-NPA: cryptographic protocol analysis modulo equational properties
– start-page: 158
  year: 1992
  ident: 10.1016/j.jlamp.2019.100497_br0910
  article-title: Multiparadigm logic programming
– start-page: 315
  year: 2014
  ident: 10.1016/j.jlamp.2019.100497_br0560
  article-title: Functional logic programming in Maude
– volume: 207
  start-page: 305
  year: 2009
  ident: 10.1016/j.jlamp.2019.100497_br1230
  article-title: A rewriting logic approach to operational semantics
  publication-title: Inf. Comput.
  doi: 10.1016/j.ic.2008.03.026
– volume: vol. 81
  start-page: 76
  year: 1980
  ident: 10.1016/j.jlamp.2019.100497_br0130
  article-title: Characterization of computable data types by means of a finite equational specification method
– year: 2014
  ident: 10.1016/j.jlamp.2019.100497_br0220
– volume: 96
  start-page: 81
  year: 2018
  ident: 10.1016/j.jlamp.2019.100497_br1240
  article-title: Metalevel algorithms for variant satisfiability
  publication-title: J. Log. Algebraic Methods Program.
  doi: 10.1016/j.jlamp.2017.12.006
– volume: 20
  start-page: 123
  year: 2007
  ident: 10.1016/j.jlamp.2019.100497_br1110
  article-title: Symbolic reachability analysis using narrowing and its application to the verification of cryptographic protocols
  publication-title: High.-Order Symb. Comput.
  doi: 10.1007/s10990-007-9000-6
SSID ssj0001687831
Score 2.396401
Snippet Rewriting logic is both a flexible semantic framework within which widely different concurrent systems can be naturally specified and a logical framework in...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 100497
SubjectTerms External objects
Maude and rewriting logic
Meta-interpreters
Strategies
Symbolic model checking
Unification and narrowing
Title Programming and symbolic computation in Maude
URI https://dx.doi.org/10.1016/j.jlamp.2019.100497
Volume 110
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFD7M7cUX7-K8kQcfDcvSNGkex3BMxSHoYG-luRQ2XB3aPfjvTdrUC8gefGtKDrRf0nO-lq_fAbjihOaOaEjs3to4ZrElOJHEDSU3NFKJr4lebTHh4ym7m8WzFgybf2G8rDLk_jqnV9k6nOkFNHur-bz3RD13oN6SzW_SKN6CDnXVlbShM7i9H0--P7XwRCRVZ0Ifgn1M4z9UKb0WDntvXdmXXjPAvP_TXzXqR90Z7cFOIIxoUF_TPrRscQC7TTMGFJ7NQ8CPtdJq6WoRygqD3j-Wypv-Il3NrVYAzQv0kK2NPYLp6OZ5OMahFwLWEUtKrLRgjCpDlJSGa8ZYTCIta_8vQrSlQiWxVRlzR66s29wYoaSOMtZXfaWiY2gXr4U9AWSkMMLxFG4cWaJ5riLLMiE4MTbW7p21C7S5-1QHo3Dfr-IlbRRhi7SCLPWQpTVkXbj-ClrVPhmbp_MG1vTXcqcuk28KPP1v4BlsuxGtBdfn0C7f1vbC8YlSXYb98gkupsYa
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1JS8NAFH7U9qAXd7Guc9CboelkMskcPBS1pHZBsAVvMbMEWmwstkX6u_yDzmRxAelB6C0JMyH55uUtw5fvAVxQG8c60WCWrtqoRVxlWz6z9SmjEjvcNzHRsC16NBiQ-yf3qQQfxb8whlaZ-_7Mp6feOr9Sy9GsTYbD2iM2uQM2kmzGSJ2CWdlWi3ddt02vW7d6kS8xbt71bwIrby1gCYf4M4sLjxDMpc0Zk1QQQlzbESyT07JtobDHfVfxiOgjHSVVLKXHmXAiUud1zh193zWoGDUs_VlVGq120Pve2qG-56edEM0jWuYZC72jlFk20mttpDLrzHAUiNGb-ism_ohzzW3YzBNU1Mgw2IGSSnZhq2j-gHJfsAfWQ8bsGuvYh6JEoulizI3IMBLp2HTF0TBB3Wgu1T4MVgLQAZST10QdApLMk57Oi6jUyRmOY-4oEnketaVyha6Rq4CLtw9FLkxu-mO8hAUDbRSmkIUGsjCDrApXX5MmmS7H8uG0gDX8ZV6hjhzLJh79d-I5rAf9bifstHrtY9jApkxPd25OoDx7m6tTncvM-FluOwieV22unxBmAxQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Programming+and+symbolic+computation+in+Maude&rft.jtitle=Journal+of+logical+and+algebraic+methods+in+programming&rft.au=Dur%C3%A1n%2C+Francisco&rft.au=Eker%2C+Steven&rft.au=Escobar%2C+Santiago&rft.au=Mart%C3%AD-Oliet%2C+Narciso&rft.date=2020-01-01&rft.pub=Elsevier+Inc&rft.issn=2352-2208&rft.volume=110&rft_id=info:doi/10.1016%2Fj.jlamp.2019.100497&rft.externalDocID=S2352220818301135
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2352-2208&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2352-2208&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2352-2208&client=summon