Optimization of rewrite theories by equational partial evaluation
In this paper, we develop an automated optimization framework for rewrite theories that supports sorts, subsort overloading, equations and algebraic axioms with free/non-free constructors, and rewrite rules modeling concurrent system transitions whose state structure is defined by means of the equat...
Saved in:
| Published in | Journal of logical and algebraic methods in programming Vol. 124; p. 100729 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Inc
01.01.2022
|
| Online Access | Get full text |
Cover
Loading…
| Abstract | In this paper, we develop an automated optimization framework for rewrite theories that supports sorts, subsort overloading, equations and algebraic axioms with free/non-free constructors, and rewrite rules modeling concurrent system transitions whose state structure is defined by means of the equations. The main idea of the framework is to make the system computations more efficient by partially evaluating the equations to the specific calls that are required by the transition rules. This can be particularly useful for automatically optimizing rewrite theories that contain overly general equational theories which perform unnecessary and costly computations involving pattern matching and/or unification modulo equations and axioms. The transformation is based on a suitable unfolding operator parameter that relies on the symbolic operational engine of Maude's equational theories, called folding variant narrowing, together with a generic abstraction operator. Depending on the properties of the rewrite theory, the unfolding and abstraction operators must be fine-tuned to achieve the biggest optimization possible while ensuring termination and total correctness of the transformation. We formalize two instances of our scheme for the case when the rewrite theory either has an infinite number of most general variants or a finite number of most general variants. Finally, we discuss some experimental results which demonstrate that the proposed optimization technique pays off in practice. |
|---|---|
| AbstractList | In this paper, we develop an automated optimization framework for rewrite theories that supports sorts, subsort overloading, equations and algebraic axioms with free/non-free constructors, and rewrite rules modeling concurrent system transitions whose state structure is defined by means of the equations. The main idea of the framework is to make the system computations more efficient by partially evaluating the equations to the specific calls that are required by the transition rules. This can be particularly useful for automatically optimizing rewrite theories that contain overly general equational theories which perform unnecessary and costly computations involving pattern matching and/or unification modulo equations and axioms. The transformation is based on a suitable unfolding operator parameter that relies on the symbolic operational engine of Maude's equational theories, called folding variant narrowing, together with a generic abstraction operator. Depending on the properties of the rewrite theory, the unfolding and abstraction operators must be fine-tuned to achieve the biggest optimization possible while ensuring termination and total correctness of the transformation. We formalize two instances of our scheme for the case when the rewrite theory either has an infinite number of most general variants or a finite number of most general variants. Finally, we discuss some experimental results which demonstrate that the proposed optimization technique pays off in practice. |
| ArticleNumber | 100729 |
| Author | Ballis, D. Sapiña, J. Alpuente, M. Escobar, S. |
| Author_xml | – sequence: 1 givenname: M. orcidid: 0000-0002-9268-1178 surname: Alpuente fullname: Alpuente, M. email: alpuente@upv.es organization: VRAIN, Universitat Politècnica de València, Valencia, Spain – sequence: 2 givenname: D. surname: Ballis fullname: Ballis, D. email: demis.ballis@uniud.it organization: DMIF, Università degli Studi di Udine, Udine, Italy – sequence: 3 givenname: S. orcidid: 0000-0002-3550-4781 surname: Escobar fullname: Escobar, S. email: sescobar@upv.es organization: VRAIN, Universitat Politècnica de València, Valencia, Spain – sequence: 4 givenname: J. surname: Sapiña fullname: Sapiña, J. email: sapina@upv.es organization: VRAIN, Universitat Politècnica de València, Valencia, Spain |
| BookMark | eNp9j8tOwzAQRb0oEqX0C9jkBxLsSRM7CxZVxUuq1A2sLcceC0d5YZui8vWkDWtWV7ozZzTnhiz6oUdC7hjNGGXlfZM1rerGDCiwqaEcqgVZQl5ACkDFNVmH0FA6rQoucrYk28MYXed-VHRDnww28fjtXcQkfuDgHYakPiX4-XWZqzYZlY9uSjyqdi5vyZVVbcD1X67I-9Pj2-4l3R-eX3fbfaqhEjHNuSqUqig1wioEsILzjWWKV8ZwXdTKgtEMc1FiaUEUNWMbLE1NgbLaapavSD7f1X4IwaOVo3ed8ifJqDzLy0Ze5OVZXs7yE_UwUzi9dnToZdAOe43GedRRmsH9y_8COd1o5A |
| Cites_doi | 10.1016/j.entcs.2009.07.013 10.1007/s10472-021-09771-1 10.3233/FI-2020-1991 10.1016/j.jlamp.2017.12.006 10.1145/321992.321996 10.1145/321850.321859 10.1016/j.ic.2014.01.006 10.1016/j.tcs.2016.12.026 10.1016/S0304-3975(01)00366-8 10.1016/0304-3975(92)90182-F 10.1145/291891.291896 10.1016/j.jlap.2012.01.002 10.1016/j.entcs.2009.05.015 10.1016/S0743-1066(99)00030-8 10.1017/S147106841700031X 10.1007/s10990-007-9000-6 10.1016/j.tcs.2008.04.040 10.1017/S1471068404002303 10.1016/0743-1066(91)90027-M 10.5381/jot.2019.18.2.a4 |
| ContentType | Journal Article |
| Copyright | 2021 The Author(s) |
| Copyright_xml | – notice: 2021 The Author(s) |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.jlamp.2021.100729 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 10_1016_j_jlamp_2021_100729 S2352220821000924 |
| GrantInformation_xml | – fundername: MCIN/AEI/10.13039/501100011033 grantid: RTI2018-094403-B-C32 – fundername: Generalitat Valenciana grantid: PROMETEO/2019/098 funderid: https://doi.org/10.13039/501100003359 – fundername: Generalitat Valenciana grantid: APOSTD/2019/127 funderid: https://doi.org/10.13039/501100003359 – fundername: Horizon 2020 grantid: 952215 funderid: https://doi.org/10.13039/100010661 |
| GroupedDBID | --M 0R~ 4.4 457 4G. 6I. 7-5 8P~ AACTN AAEDT AAEDW AAFTH 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-c298t-37a5aa900d8fae22f8774f1a79dd7c5baf2dc1e386e6f285b114e6db0201bfc13 |
| IEDL.DBID | AIKHN |
| ISSN | 2352-2208 |
| IngestDate | Tue Jul 01 00:37:50 EDT 2025 Fri Feb 23 02:45:02 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | This is an open access article under the CC BY license. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c298t-37a5aa900d8fae22f8774f1a79dd7c5baf2dc1e386e6f285b114e6db0201bfc13 |
| ORCID | 0000-0002-3550-4781 0000-0002-9268-1178 |
| OpenAccessLink | https://www.sciencedirect.com/science/article/pii/S2352220821000924 |
| ParticipantIDs | crossref_primary_10_1016_j_jlamp_2021_100729 elsevier_sciencedirect_doi_10_1016_j_jlamp_2021_100729 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | January 2022 2022-01-00 |
| PublicationDateYYYYMMDD | 2022-01-01 |
| PublicationDate_xml | – month: 01 year: 2022 text: January 2022 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of logical and algebraic methods in programming |
| PublicationYear | 2022 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Lloyd, Shepherdson (br0340) 1991; 11 Hanus, Peemöller (br0310) 2014; vol. 1335 Clavel, Durán, Eker, Lincoln, Martí-Oliet, Meseguer, Talcott (br0210) 2007 Alpuente, Ballis, Escobar, Sapiña (br0040) 2020 Clavel, Durán, Eker, Escobar, Lincoln, Martí-Oliet, Meseguer, Rubio, Talcott (br0200) 2020 Alpuente, Escobar, Espert, Meseguer (br0080) 2014; 235 Martens, Gallagher (br0350) 1995 Meseguer, Palomino, Martí-Oliet (br0400) 2008; 403 Leuschel (br0330) 1998; vol. 1559 Alpuente, Cuenca-Ortega, Escobar, Meseguer (br0060) 2020; 177 Burstall, Darlington (br0190) 1977; 24 Meseguer (br0390) 2020; 110 Escobar, Meseguer, Sasse (br0280) 2009; 238 Viry (br0500) 2002; 285 Alpuente, Falaschi, Moreno, Vidal (br0140) 1997; vol. 1298 Meseguer (br0380) 2017; 672 Ölveczky, Meseguer (br0430) 2008; vol. 4963 Slagle (br0490) 1974; 21 Jones, Gomard, Sestoft (br0320) 1993 Alpuente, Falaschi, Julián, Vidal (br0130) 1997 Alpuente, Cuenca-Ortega, Escobar, Sapiña (br0070) 2017; 17 Meseguer (br0360) 1992; 96 Durán, Eker, Escobar, Martí-Oliet, Meseguer, Talcott (br0240) 2018; vol. 11152 Peemöller (br0440) 2017 Roşu (br0460) 2017; vol. 50 Alpuente, Cuenca-Ortega, Escobar, Meseguer (br0050) 2020; 110 Alpuente, Falaschi, Vidal (br0150) 1998; 20 Skeirik, Meseguer (br0480) 2018; 96 Alpuente, Escobar, Meseguer, Ojeda (br0110) 2009; 246 Meseguer (br0370) 2015; vol. 596 Rodríguez, Durán, Rutle, Kristensen (br0470) 2019; 18 The Presto Website (br0450) 2020 Alpuente, Escobar, Espert, Meseguer (br0090) 2014; vol. 8761 Escobar, Meadows, Meseguer (br0260) 2009; vol. 5705 Meseguer, Thati (br0410) 2007; 20 Albert, Hanus, Vidal (br0020) 2002; 2002 Alpuente, Escobar, Meseguer, Ojeda (br0100) 2008; vol. 5438 Alpuente, Lucas, Hanus, Vidal (br0160) 2005; 5 Alpuente, Ballis, Cuenca-Ortega, Escobar, Meseguer (br0030) 2019; vol. 11468 Alpuente, Escobar, Meseguer, Sapiña (br0120) 2021 Durán, Lucas, Meseguer (br0250) 2008; vol. 5195 Albert, Alpuente, Falaschi, Julián, Vidal (br0010) 1998; vol. 1503 Bouchard, Gero, Lynch, Narendran (br0180) 2013; vol. 8152 Fay (br0300) 1979 Bae, Escobar, Meseguer (br0170) 2013; vol. 21 Comon-Lundh, Delaune (br0220) 2005; vol. 3467 Escobar, Sasse, Meseguer (br0290) 2012; 81 De Schreye, Glück, Jørgensen, Leuschel, Martens, Sørensen (br0230) 1999; 41 Middeldorp, Hamoen (br0420) 1992; vol. 632 Escobar, Meseguer (br0270) 2007; vol. 4533 Alpuente (10.1016/j.jlamp.2021.100729_br0140) 1997; vol. 1298 Skeirik (10.1016/j.jlamp.2021.100729_br0480) 2018; 96 Alpuente (10.1016/j.jlamp.2021.100729_br0120) 2021 Roşu (10.1016/j.jlamp.2021.100729_br0460) 2017; vol. 50 Durán (10.1016/j.jlamp.2021.100729_br0240) 2018; vol. 11152 Bae (10.1016/j.jlamp.2021.100729_br0170) 2013; vol. 21 Fay (10.1016/j.jlamp.2021.100729_br0300) 1979 Jones (10.1016/j.jlamp.2021.100729_br0320) 1993 Clavel (10.1016/j.jlamp.2021.100729_br0210) 2007 Slagle (10.1016/j.jlamp.2021.100729_br0490) 1974; 21 Alpuente (10.1016/j.jlamp.2021.100729_br0060) 2020; 177 Escobar (10.1016/j.jlamp.2021.100729_br0260) 2009; vol. 5705 Leuschel (10.1016/j.jlamp.2021.100729_br0330) 1998; vol. 1559 Burstall (10.1016/j.jlamp.2021.100729_br0190) 1977; 24 Clavel (10.1016/j.jlamp.2021.100729_br0200) 2020 The Presto Website (10.1016/j.jlamp.2021.100729_br0450) Alpuente (10.1016/j.jlamp.2021.100729_br0110) 2009; 246 Meseguer (10.1016/j.jlamp.2021.100729_br0390) 2020; 110 Rodríguez (10.1016/j.jlamp.2021.100729_br0470) 2019; 18 De Schreye (10.1016/j.jlamp.2021.100729_br0230) 1999; 41 Martens (10.1016/j.jlamp.2021.100729_br0350) 1995 Alpuente (10.1016/j.jlamp.2021.100729_br0080) 2014; 235 Middeldorp (10.1016/j.jlamp.2021.100729_br0420) 1992; vol. 632 Alpuente (10.1016/j.jlamp.2021.100729_br0040) 2020 Meseguer (10.1016/j.jlamp.2021.100729_br0380) 2017; 672 Ölveczky (10.1016/j.jlamp.2021.100729_br0430) 2008; vol. 4963 Albert (10.1016/j.jlamp.2021.100729_br0020) 2002; 2002 Alpuente (10.1016/j.jlamp.2021.100729_br0100) 2008; vol. 5438 Meseguer (10.1016/j.jlamp.2021.100729_br0400) 2008; 403 Hanus (10.1016/j.jlamp.2021.100729_br0310) 2014; vol. 1335 Alpuente (10.1016/j.jlamp.2021.100729_br0130) 1997 Meseguer (10.1016/j.jlamp.2021.100729_br0370) 2015; vol. 596 Peemöller (10.1016/j.jlamp.2021.100729_br0440) 2017 Lloyd (10.1016/j.jlamp.2021.100729_br0340) 1991; 11 Alpuente (10.1016/j.jlamp.2021.100729_br0030) 2019; vol. 11468 Alpuente (10.1016/j.jlamp.2021.100729_br0090) 2014; vol. 8761 Comon-Lundh (10.1016/j.jlamp.2021.100729_br0220) 2005; vol. 3467 Alpuente (10.1016/j.jlamp.2021.100729_br0070) 2017; 17 Bouchard (10.1016/j.jlamp.2021.100729_br0180) 2013; vol. 8152 Albert (10.1016/j.jlamp.2021.100729_br0010) 1998; vol. 1503 Alpuente (10.1016/j.jlamp.2021.100729_br0160) 2005; 5 Escobar (10.1016/j.jlamp.2021.100729_br0290) 2012; 81 Alpuente (10.1016/j.jlamp.2021.100729_br0150) 1998; 20 Durán (10.1016/j.jlamp.2021.100729_br0250) 2008; vol. 5195 Escobar (10.1016/j.jlamp.2021.100729_br0280) 2009; 238 Meseguer (10.1016/j.jlamp.2021.100729_br0410) 2007; 20 Meseguer (10.1016/j.jlamp.2021.100729_br0360) 1992; 96 Escobar (10.1016/j.jlamp.2021.100729_br0270) 2007; vol. 4533 Alpuente (10.1016/j.jlamp.2021.100729_br0050) 2020; 110 Viry (10.1016/j.jlamp.2021.100729_br0500) 2002; 285 |
| References_xml | – volume: 5 start-page: 273 year: 2005 end-page: 303 ident: br0160 article-title: Specialization of functional logic programs based on needed narrowing publication-title: Theory Pract. Log. Program. – volume: vol. 50 start-page: 186 year: 2017 end-page: 206 ident: br0460 article-title: : a semantic framework for programming languages and formal analysis tools publication-title: Dependable Software Systems Engineering – volume: vol. 596 start-page: 3 year: 2015 end-page: 34 ident: br0370 article-title: Variant-based satisfiability in initial algebras publication-title: Proceedings of the 4th International Workshop for Safety-Critical Systems – volume: vol. 5705 start-page: 1 year: 2009 end-page: 50 ident: br0260 article-title: Maude-NPA: cryptographic protocol analysis modulo equational properties publication-title: Foundations of Security Analysis and Design V – volume: 403 start-page: 239 year: 2008 end-page: 264 ident: br0400 article-title: Equational abstractions publication-title: Theor. Comput. Sci. – volume: 18 start-page: 1 year: 2019 end-page: 21 ident: br0470 article-title: Executing multilevel domain-specific models in Maude publication-title: J. Object Technol. – volume: 177 start-page: 297 year: 2020 end-page: 329 ident: br0060 article-title: Order-sorted homeomorphic embedding modulo combinations of associativity and/or commutativity axioms publication-title: Fundam. Inform. – volume: vol. 11152 start-page: 98 year: 2018 end-page: 114 ident: br0240 article-title: Associative unification and symbolic reasoning modulo associativity in Maude publication-title: Proceedings of the 12th International Workshop on Rewriting Logic and Its Applications – volume: 235 start-page: 98 year: 2014 end-page: 136 ident: br0080 article-title: A modular order-sorted equational generalization algorithm publication-title: Inf. Comput. – volume: 2002 start-page: 1 year: 2002 end-page: 34 ident: br0020 article-title: A practical partial evaluation scheme for multi-paradigm declarative languages publication-title: J. Funct. Logic Program. – volume: vol. 4533 start-page: 153 year: 2007 end-page: 168 ident: br0270 article-title: Symbolic model checking of infinite-state systems using narrowing publication-title: Proceedings of the 18th International Conference on Term Rewriting and Applications – year: 1993 ident: br0320 article-title: Partial Evaluation and Automatic Program Generation – volume: 11 start-page: 217 year: 1991 end-page: 242 ident: br0340 article-title: Partial evaluation in logic programming publication-title: J. Log. Program. – volume: 81 start-page: 898 year: 2012 end-page: 928 ident: br0290 article-title: Folding variant narrowing and optimal variant termination publication-title: J. Log. Algebraic Program. – volume: 17 start-page: 689 year: 2017 end-page: 707 ident: br0070 article-title: Inspecting Maude variants with GLINTS publication-title: Theory Pract. Log. Program. – volume: 96 start-page: 73 year: 1992 end-page: 155 ident: br0360 article-title: Conditional rewriting logic as a unified model of concurrency publication-title: Theor. Comput. Sci. – volume: vol. 8761 start-page: 573 year: 2014 end-page: 581 ident: br0090 article-title: ACUOS: a system for modular ACU generalization with subtyping and inheritance publication-title: Proceedings of the 14th European Conference on Logics in Artificial Intelligence – volume: vol. 4963 start-page: 332 year: 2008 end-page: 336 ident: br0430 article-title: The real-time Maude tool publication-title: Proceedings of the 14th International Conference on Tools and Algorithms for Construction and Analysis of Systems – volume: 21 start-page: 622 year: 1974 end-page: 642 ident: br0490 article-title: Automated theorem-proving for theories with simplifiers, commutativity, and associativity publication-title: J. ACM – volume: 24 start-page: 44 year: 1977 end-page: 67 ident: br0190 article-title: A transformation system for developing recursive programs publication-title: J. ACM – year: 2017 ident: br0440 article-title: Normalization and partial evaluation of functional logic programs – volume: 672 start-page: 1 year: 2017 end-page: 35 ident: br0380 article-title: Strict coherence of conditional rewriting modulo axioms publication-title: Theor. Comput. Sci. – start-page: 161 year: 1979 end-page: 167 ident: br0300 article-title: First order unification in an equational theory publication-title: Proceedings of the 4th International Conference on Automated Deduction – year: 2007 ident: br0210 article-title: All About Maude: A High-Performance Logical Framework – volume: vol. 1298 start-page: 1 year: 1997 end-page: 15 ident: br0140 article-title: Safe folding/unfolding with conditional narrowing publication-title: Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming – volume: 20 start-page: 768 year: 1998 end-page: 844 ident: br0150 article-title: Partial evaluation of functional logic programs publication-title: ACM Trans. Program. Lang. Syst. – volume: vol. 1559 start-page: 199 year: 1998 end-page: 218 ident: br0330 article-title: Improving homeomorphic embedding for online termination publication-title: Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation – volume: vol. 1503 start-page: 262 year: 1998 end-page: 277 ident: br0010 article-title: Improving control in functional logic program specialization publication-title: Proceedings of the 5th International Symposium on Static Analysis – volume: 110 year: 2020 ident: br0390 article-title: Generalized rewrite theories, coherence completion, and symbolic methods publication-title: J. Log. Algebraic Methods Program. – start-page: 151 year: 1997 end-page: 162 ident: br0130 article-title: Specialization of lazy functional logic programs publication-title: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation – volume: 285 start-page: 487 year: 2002 end-page: 517 ident: br0500 article-title: Equational rules for rewriting logic publication-title: Theor. Comput. Sci. – volume: vol. 1335 start-page: 155 year: 2014 end-page: 171 ident: br0310 article-title: A partial evaluator for curry publication-title: Proceedings of the 28th International Workshop on (Constraint) Logic Programming – year: 2021 ident: br0120 article-title: Order-sorted equational generalization algorithm revisited publication-title: Ann. Math. Artif. Intell. – volume: vol. 5195 start-page: 313 year: 2008 end-page: 319 ident: br0250 article-title: MTT: the Maude termination tool (system description) publication-title: Proceedings of the 4th International Joint Conference on Automated Reasoning – volume: vol. 632 start-page: 244 year: 1992 end-page: 258 ident: br0420 article-title: Counterexamples to completeness results for basic narrowing publication-title: Proceedings of the 3rd International Conference on Algebraic and Logic Programming – volume: vol. 8152 start-page: 327 year: 2013 end-page: 342 ident: br0180 article-title: On forward closure and the finite variant property publication-title: Proceedings of the 9th International Symposium on Frontiers of Combining Systems – volume: 41 start-page: 231 year: 1999 end-page: 277 ident: br0230 article-title: Conjunctive partial deduction: foundations, control, algorithms, and experiments publication-title: J. Log. Program. – year: 2020 ident: br0200 article-title: Maude Manual (Version 3.0) – volume: 96 start-page: 81 year: 2018 end-page: 110 ident: br0480 article-title: Metalevel algorithms for variant satisfiability publication-title: J. Log. Algebraic Methods Program. – volume: vol. 5438 start-page: 24 year: 2008 end-page: 39 ident: br0100 article-title: A modular equational generalization algorithm publication-title: Proceedings of the 18th International Symposium on Logic-Based Program Synthesis and Transformation – year: 2020 ident: br0450 – volume: 20 start-page: 123 year: 2007 end-page: 160 ident: br0410 article-title: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols publication-title: High.-Order Symb. Comput. – volume: vol. 3467 start-page: 294 year: 2005 end-page: 307 ident: br0220 article-title: The finite variant property: how to get rid of some algebraic properties publication-title: Proceedings of the 16th International Conference on Rewriting Techniques and Applications – volume: vol. 21 start-page: 81 year: 2013 end-page: 96 ident: br0170 article-title: Abstract logical model checking of infinite-state systems using narrowing publication-title: Proceedings of the 24th International Conference on Rewriting Techniques and Applications – year: 2020 ident: br0040 article-title: Narrowing-based optimization of rewrite theories publication-title: Proceedings of the 7th International Workshop on Rewriting Techniques for Program Transformations and Evaluation – volume: 246 start-page: 27 year: 2009 end-page: 38 ident: br0110 article-title: Order-sorted generalization publication-title: Electron. Notes Theor. Comput. Sci. – volume: 238 start-page: 103 year: 2009 end-page: 119 ident: br0280 article-title: Variant narrowing and equational unification publication-title: Electron. Notes Theor. Comput. Sci. – start-page: 597 year: 1995 end-page: 611 ident: br0350 article-title: Ensuring global termination of partial deduction while allowing flexible polyvariance publication-title: Proceedings of the 12th International Conference on Logic Programming – volume: 110 start-page: 1 year: 2020 end-page: 36 ident: br0050 article-title: A partial evaluation framework for order-sorted equational programs modulo axioms publication-title: J. Log. Algebraic Methods Program. – volume: vol. 11468 start-page: 171 year: 2019 end-page: 181 ident: br0030 article-title: ACUOS publication-title: Proceedings of the 16th European Conference on Logics in Artificial Intelligence – volume: 246 start-page: 27 year: 2009 ident: 10.1016/j.jlamp.2021.100729_br0110 article-title: Order-sorted generalization publication-title: Electron. Notes Theor. Comput. Sci. doi: 10.1016/j.entcs.2009.07.013 – year: 2021 ident: 10.1016/j.jlamp.2021.100729_br0120 article-title: Order-sorted equational generalization algorithm revisited publication-title: Ann. Math. Artif. Intell. doi: 10.1007/s10472-021-09771-1 – volume: 177 start-page: 297 issue: 3–4 year: 2020 ident: 10.1016/j.jlamp.2021.100729_br0060 article-title: Order-sorted homeomorphic embedding modulo combinations of associativity and/or commutativity axioms publication-title: Fundam. Inform. doi: 10.3233/FI-2020-1991 – volume: vol. 50 start-page: 186 year: 2017 ident: 10.1016/j.jlamp.2021.100729_br0460 article-title: K: a semantic framework for programming languages and formal analysis tools – volume: 96 start-page: 81 year: 2018 ident: 10.1016/j.jlamp.2021.100729_br0480 article-title: Metalevel algorithms for variant satisfiability publication-title: J. Log. Algebraic Methods Program. doi: 10.1016/j.jlamp.2017.12.006 – volume: vol. 1503 start-page: 262 year: 1998 ident: 10.1016/j.jlamp.2021.100729_br0010 article-title: Improving control in functional logic program specialization – volume: vol. 4533 start-page: 153 year: 2007 ident: 10.1016/j.jlamp.2021.100729_br0270 article-title: Symbolic model checking of infinite-state systems using narrowing – volume: vol. 3467 start-page: 294 year: 2005 ident: 10.1016/j.jlamp.2021.100729_br0220 article-title: The finite variant property: how to get rid of some algebraic properties – year: 2020 ident: 10.1016/j.jlamp.2021.100729_br0200 – year: 2007 ident: 10.1016/j.jlamp.2021.100729_br0210 – volume: vol. 1559 start-page: 199 year: 1998 ident: 10.1016/j.jlamp.2021.100729_br0330 article-title: Improving homeomorphic embedding for online termination – volume: 24 start-page: 44 issue: 1 year: 1977 ident: 10.1016/j.jlamp.2021.100729_br0190 article-title: A transformation system for developing recursive programs publication-title: J. ACM doi: 10.1145/321992.321996 – volume: 21 start-page: 622 issue: 4 year: 1974 ident: 10.1016/j.jlamp.2021.100729_br0490 article-title: Automated theorem-proving for theories with simplifiers, commutativity, and associativity publication-title: J. ACM doi: 10.1145/321850.321859 – volume: vol. 632 start-page: 244 year: 1992 ident: 10.1016/j.jlamp.2021.100729_br0420 article-title: Counterexamples to completeness results for basic narrowing – volume: 235 start-page: 98 year: 2014 ident: 10.1016/j.jlamp.2021.100729_br0080 article-title: A modular order-sorted equational generalization algorithm publication-title: Inf. Comput. doi: 10.1016/j.ic.2014.01.006 – volume: vol. 11468 start-page: 171 year: 2019 ident: 10.1016/j.jlamp.2021.100729_br0030 article-title: ACUOS2: a high-performance system for modular ACU generalization with subtyping and inheritance – volume: 110 year: 2020 ident: 10.1016/j.jlamp.2021.100729_br0390 article-title: Generalized rewrite theories, coherence completion, and symbolic methods publication-title: J. Log. Algebraic Methods Program. – volume: vol. 5705 start-page: 1 year: 2009 ident: 10.1016/j.jlamp.2021.100729_br0260 article-title: Maude-NPA: cryptographic protocol analysis modulo equational properties – volume: 672 start-page: 1 year: 2017 ident: 10.1016/j.jlamp.2021.100729_br0380 article-title: Strict coherence of conditional rewriting modulo axioms publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2016.12.026 – start-page: 597 year: 1995 ident: 10.1016/j.jlamp.2021.100729_br0350 article-title: Ensuring global termination of partial deduction while allowing flexible polyvariance – volume: vol. 5438 start-page: 24 year: 2008 ident: 10.1016/j.jlamp.2021.100729_br0100 article-title: A modular equational generalization algorithm – volume: vol. 1298 start-page: 1 year: 1997 ident: 10.1016/j.jlamp.2021.100729_br0140 article-title: Safe folding/unfolding with conditional narrowing – volume: 285 start-page: 487 issue: 2 year: 2002 ident: 10.1016/j.jlamp.2021.100729_br0500 article-title: Equational rules for rewriting logic publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(01)00366-8 – year: 2020 ident: 10.1016/j.jlamp.2021.100729_br0040 article-title: Narrowing-based optimization of rewrite theories – volume: 96 start-page: 73 issue: 1 year: 1992 ident: 10.1016/j.jlamp.2021.100729_br0360 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: 20 start-page: 768 issue: 4 year: 1998 ident: 10.1016/j.jlamp.2021.100729_br0150 article-title: Partial evaluation of functional logic programs publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/291891.291896 – volume: vol. 4963 start-page: 332 year: 2008 ident: 10.1016/j.jlamp.2021.100729_br0430 article-title: The real-time Maude tool – volume: 81 start-page: 898 issue: 7–8 year: 2012 ident: 10.1016/j.jlamp.2021.100729_br0290 article-title: Folding variant narrowing and optimal variant termination publication-title: J. Log. Algebraic Program. doi: 10.1016/j.jlap.2012.01.002 – volume: 238 start-page: 103 issue: 3 year: 2009 ident: 10.1016/j.jlamp.2021.100729_br0280 article-title: Variant narrowing and equational unification publication-title: Electron. Notes Theor. Comput. Sci. doi: 10.1016/j.entcs.2009.05.015 – start-page: 161 year: 1979 ident: 10.1016/j.jlamp.2021.100729_br0300 article-title: First order unification in an equational theory – volume: 41 start-page: 231 issue: 2–3 year: 1999 ident: 10.1016/j.jlamp.2021.100729_br0230 article-title: Conjunctive partial deduction: foundations, control, algorithms, and experiments publication-title: J. Log. Program. doi: 10.1016/S0743-1066(99)00030-8 – volume: vol. 5195 start-page: 313 year: 2008 ident: 10.1016/j.jlamp.2021.100729_br0250 article-title: MTT: the Maude termination tool (system description) – ident: 10.1016/j.jlamp.2021.100729_br0450 – volume: 17 start-page: 689 issue: 5–6 year: 2017 ident: 10.1016/j.jlamp.2021.100729_br0070 article-title: Inspecting Maude variants with GLINTS publication-title: Theory Pract. Log. Program. doi: 10.1017/S147106841700031X – volume: vol. 596 start-page: 3 year: 2015 ident: 10.1016/j.jlamp.2021.100729_br0370 article-title: Variant-based satisfiability in initial algebras – volume: vol. 11152 start-page: 98 year: 2018 ident: 10.1016/j.jlamp.2021.100729_br0240 article-title: Associative unification and symbolic reasoning modulo associativity in Maude – volume: vol. 8152 start-page: 327 year: 2013 ident: 10.1016/j.jlamp.2021.100729_br0180 article-title: On forward closure and the finite variant property – year: 2017 ident: 10.1016/j.jlamp.2021.100729_br0440 – volume: 20 start-page: 123 issue: 1–2 year: 2007 ident: 10.1016/j.jlamp.2021.100729_br0410 article-title: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols publication-title: High.-Order Symb. Comput. doi: 10.1007/s10990-007-9000-6 – volume: 403 start-page: 239 issue: 2–3 year: 2008 ident: 10.1016/j.jlamp.2021.100729_br0400 article-title: Equational abstractions publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2008.04.040 – volume: vol. 21 start-page: 81 year: 2013 ident: 10.1016/j.jlamp.2021.100729_br0170 article-title: Abstract logical model checking of infinite-state systems using narrowing – start-page: 151 year: 1997 ident: 10.1016/j.jlamp.2021.100729_br0130 article-title: Specialization of lazy functional logic programs – volume: 5 start-page: 273 issue: 3 year: 2005 ident: 10.1016/j.jlamp.2021.100729_br0160 article-title: Specialization of functional logic programs based on needed narrowing publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068404002303 – volume: vol. 8761 start-page: 573 year: 2014 ident: 10.1016/j.jlamp.2021.100729_br0090 article-title: ACUOS: a system for modular ACU generalization with subtyping and inheritance – year: 1993 ident: 10.1016/j.jlamp.2021.100729_br0320 – volume: 2002 start-page: 1 year: 2002 ident: 10.1016/j.jlamp.2021.100729_br0020 article-title: A practical partial evaluation scheme for multi-paradigm declarative languages publication-title: J. Funct. Logic Program. – volume: vol. 1335 start-page: 155 year: 2014 ident: 10.1016/j.jlamp.2021.100729_br0310 article-title: A partial evaluator for curry – volume: 11 start-page: 217 issue: 3–4 year: 1991 ident: 10.1016/j.jlamp.2021.100729_br0340 article-title: Partial evaluation in logic programming publication-title: J. Log. Program. doi: 10.1016/0743-1066(91)90027-M – volume: 110 start-page: 1 year: 2020 ident: 10.1016/j.jlamp.2021.100729_br0050 article-title: A partial evaluation framework for order-sorted equational programs modulo axioms publication-title: J. Log. Algebraic Methods Program. – volume: 18 start-page: 1 issue: 2 year: 2019 ident: 10.1016/j.jlamp.2021.100729_br0470 article-title: Executing multilevel domain-specific models in Maude publication-title: J. Object Technol. doi: 10.5381/jot.2019.18.2.a4 |
| SSID | ssj0001687831 |
| Score | 2.1910176 |
| Snippet | In this paper, we develop an automated optimization framework for rewrite theories that supports sorts, subsort overloading, equations and algebraic axioms... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 100729 |
| Title | Optimization of rewrite theories by equational partial evaluation |
| URI | https://dx.doi.org/10.1016/j.jlamp.2021.100729 |
| Volume | 124 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB5qe_HiW6wv9uDR0Ow22WyOpViqYj1oobewm92FFmxraRH_vbObDVUQD54CgYHky-abb4Z5ANxwPBUJw7BEoniPEsu7keBURFpwFXMlMm1c7_DTiA_HycMknTSgX_fCuLLKwP0Vp3u2Dnc6Ac3OcjrtvDCnHRi6MJeixjBiB1oMvWvchFbv_nE42qZauMiE30zoTCJnU88f8pVeM8Teja5k1NcMeLX5i4_65ncGB7AXBCPpVc90CA0zP4L9ehkDCf_mMfSe8ed_C12VZGHJynxg4G-Ib1XEeJioT2LeNyH5R5buLfG6Hfd9AuPB3Wt_GIX9CFHJcrFGbpCplHkca2GlYcwK1HKWyizXOitTJS3TJTVdwQ23TKQKYx_DtUKFSJUtafcUmvPF3JwBsTRPskQY6_ZuUK1ymXYTpHFqkSyRiNpwWyNSLKsxGEVdHzYrPICFA7CoAGwDr1ErfnzNAon6L8Pz_xpewC5zjQk-OXIJzfVqY65QLqzVdTgOXwS1vSI |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3Na8IwFA9OD9tl32PuM4cdVzRpm6ZHkYnOjx2m4C0kbQIKUyfK2H-_lzTFDcYOOxUKD9Jfk19-7_E-EHpgsCsiCm6JBPEeRIaFAWeEBzlnqskUT3Jta4eHI9adRM_TeFpB7bIWxqZVeu4vON2xtX_T8Gg2VrNZ45Va7UDhCrMhanAj9lDNdqeCbV5r9frd0S7UwnjC3WRCaxJYm7L_kMv0mgP2tnUlJS5nwKnNX-6ob_dO5xgdesGIW8WaTlBFL07RUTmMAfuzeYZaL3D433xVJV4avNYf4Phr7EoVwR_G6hPr960P_uGV_Up47tp9n6NJ52nc7gZ-PkKQ0ZRvgBtkLGXabObcSE2p4aDlDJFJmudJFitpaJ4RHXKmmaE8VuD7aJYrUIhEmYyEF6i6WC70JcKGpFEScW3s3A2Sq1TGYQQ0TgyQJRBRHT2WiIhV0QZDlPlhc-EAFBZAUQBYR6xETfz4mwKI-i_Dq_8a3qP97ng4EIPeqH-NDqgtUnCBkhtU3ay3-hakw0bd-a3xBQ3GwBE |
| 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=Optimization+of+rewrite+theories+by+equational+partial+evaluation&rft.jtitle=Journal+of+logical+and+algebraic+methods+in+programming&rft.au=Alpuente%2C+M.&rft.au=Ballis%2C+D.&rft.au=Escobar%2C+S.&rft.au=Sapi%C3%B1a%2C+J.&rft.date=2022-01-01&rft.pub=Elsevier+Inc&rft.issn=2352-2208&rft.volume=124&rft_id=info:doi/10.1016%2Fj.jlamp.2021.100729&rft.externalDocID=S2352220821000924 |
| 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 |