Difference between revisions of "Rewriting Logic"
| (3 intermediate revisions by the same user not shown) | |||
| Line 12: | Line 12: | ||
[http://www.sciencedirect.com/science/journal/15710661/117 Spain (2004)], | [http://www.sciencedirect.com/science/journal/15710661/117 Spain (2004)], | ||
[http://www.sciencedirect.com/science/journal/15710661/176/4 Austria (2006)], | [http://www.sciencedirect.com/science/journal/15710661/176/4 Austria (2006)], | ||
| − | [http://www.sciencedirect.com/science/journal/15710661/238/3 Hungary (2008)], [http://link.springer.com/book/10.1007/978-3-642-16310-4/page/1 Cyprus (2010)], [http://link.springer.com/book/10.1007/978-3-642-34005-5/page/1 Estonia (2012)], [http://users.dsic.upv.es/workshops/wrla2014/ France (2014)], [https://fmse.info.uaic.ro/events/WRLA2016/ The Netherlands (2016)], [https://project.inria.fr/wrla18/ Greece (2018)], [https://wrla2020.webs.upv.es/ Ireland (2020)]. | + | [http://www.sciencedirect.com/science/journal/15710661/238/3 Hungary (2008)], |
| + | [http://link.springer.com/book/10.1007/978-3-642-16310-4/page/1 Cyprus (2010)], | ||
| + | [http://link.springer.com/book/10.1007/978-3-642-34005-5/page/1 Estonia (2012)], | ||
| + | [http://users.dsic.upv.es/workshops/wrla2014/ France (2014)], | ||
| + | [https://fmse.info.uaic.ro/events/WRLA2016/ The Netherlands (2016)], | ||
| + | [https://project.inria.fr/wrla18/ Greece (2018)], | ||
| + | [https://wrla2020.webs.upv.es/ Ireland (2020)], | ||
| + | [http://sv.postech.ac.kr/wrla2022/ Germany (2022)]. | ||
Several journal special issues have been published on rewriting logic: | Several journal special issues have been published on rewriting logic: | ||
[https://www.sciencedirect.com/journal/theoretical-computer-science/vol/285/issue/2 TCS 285 (2002)], | [https://www.sciencedirect.com/journal/theoretical-computer-science/vol/285/issue/2 TCS 285 (2002)], | ||
| − | [https://link.springer.com/journal/10990/20/1/page/1 HOSC 20 (2007)] | + | [https://link.springer.com/journal/10990/20/1/page/1 HOSC 20 (2007)], |
[https://www.sciencedirect.com/journal/the-journal-of-logic-and-algebraic-programming/vol/81 JLAMP 81 (2012)], | [https://www.sciencedirect.com/journal/the-journal-of-logic-and-algebraic-programming/vol/81 JLAMP 81 (2012)], | ||
[https://www.sciencedirect.com/journal/science-of-computer-programming/vol/99/ SCP 99 (2012)], | [https://www.sciencedirect.com/journal/science-of-computer-programming/vol/99/ SCP 99 (2012)], | ||
[https://www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming/vol/85/issue/1/part/P1 JLAMP 85 (2016)], | [https://www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming/vol/85/issue/1/part/P1 JLAMP 85 (2016)], | ||
[https://www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming/vol/86/issue/1 JLAMP 86 (2017)], | [https://www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming/vol/86/issue/1 JLAMP 86 (2017)], | ||
| − | [https://www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming/special-issue/10QHD3B3JSJ JLAMP 93 (2017)], | + | [https://www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming/special-issue/10QHD3B3JSJ JLAMP 93 (2017)], |
| − | [https://www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming/special-issue/10R8T94S8FM JLAMP 110 (2020)]. | + | [https://www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming/special-issue/10R8T94S8FM JLAMP 110 (2020)], and |
| + | [https://www.sciencedirect.com/journal/journal-of-logical-and-algebraic-methods-in-programming/special-issue/10HT7LGD2SQ JLAMP 134 (2023)]. | ||
Furthermore, several language implementations of rewriting logic | Furthermore, several language implementations of rewriting logic | ||
([http://www.ldl.jaist.ac.jp/cafeobj/index.html CafeOBJ], [http://elan.loria.fr/ ELAN], [[The Maude System|Maude]], etc.) | ([http://www.ldl.jaist.ac.jp/cafeobj/index.html CafeOBJ], [http://elan.loria.fr/ ELAN], [[The Maude System|Maude]], etc.) | ||
and a variety of [[Maude Tools|formal tools]] | and a variety of [[Maude Tools|formal tools]] | ||
| − | have also been developed and have been used in a wide range of | + | have also been developed and have been used in a wide range of applications. |
| + | You may take a look to the [https://doi.org/10.1007/978-3-030-17502-3_6 retrospective on rewrite engines published in TACAS 2019]. | ||
Several snapshots of the state of rewriting logic research—some more global in scope, | Several snapshots of the state of rewriting logic research—some more global in scope, | ||
| Line 37: | Line 46: | ||
[https://doi.org/10.1007/978-0-387-35520-7_5 FMOODS'00], | [https://doi.org/10.1007/978-0-387-35520-7_5 FMOODS'00], | ||
[http://maude.cs.illinois.edu/papers/abstract/MMroadmap_2001.html TCS'02], | [http://maude.cs.illinois.edu/papers/abstract/MMroadmap_2001.html TCS'02], | ||
| − | [https://doi.org/10.1016/j.jlap.2012.06.003 JLAMP'12], | + | [https://doi.org/10.1016/j.jlap.2012.06.003 JLAMP'12], |
| − | [https://doi.org/10.1007/978-3-662-57669-4_2 WoLLIC'18]. | + | [https://doi.org/10.1007/978-3-662-57669-4_2 WoLLIC'18], |
| + | [https://doi.org/10.1016/j.jlamp.2019.100497 JLAMP'20], and | ||
| + | [https://doi.org/10.1007/978-3-031-10769-6_31 IJCAR'22]. | ||
Maude should be seen as our contribution to the broader | Maude should be seen as our contribution to the broader | ||
| Line 53: | Line 64: | ||
[https://doi.org/10.1007/3-540-44881-0_7 RTA'03], | [https://doi.org/10.1007/3-540-44881-0_7 RTA'03], | ||
[https://doi.org/10.1007/978-3-642-02348-4_27 RTA'04], | [https://doi.org/10.1007/978-3-642-02348-4_27 RTA'04], | ||
| − | [https://doi.org/10.4230/LIPIcs.RTA.2011.31 RTA'11], | + | [https://doi.org/10.4230/LIPIcs.RTA.2011.31 RTA'11], |
| − | [https://doi.org/10.1007/978-3-319-40229-1_13 IJCAR'16]. | + | [https://doi.org/10.1007/978-3-319-40229-1_13 IJCAR'16], and |
| + | [https://doi.org/10.1007/978-3-031-10769-6_31 IJCAR'22]. | ||
An account of the history of the language may be found in the [https://doi.org/10.1007/978-3-319-23165-5_11 Two Decades of Maude] 2015 paper. | An account of the history of the language may be found in the [https://doi.org/10.1007/978-3-319-23165-5_11 Two Decades of Maude] 2015 paper. | ||
| + | Some more recent papers have focused on specific aspects of the language: | ||
| + | [https://doi.org/10.1016/j.jlamp.2023.100887 strategies], | ||
| + | [https://doi.org/10.1007/978-3-031-10769-6_31 symbolic features]. | ||
Latest revision as of 13:36, 20 March 2024
The theory and applications of rewriting logic have been vigorously developed by researchers all over the world during the past years, with more than three hundred papers related to rewriting logic published so far (see the roadmap).
International workshops on rewriting logic have been held in United States (1996), France (1998), Japan (2000), Italy (2002), Spain (2004), Austria (2006), Hungary (2008), Cyprus (2010), Estonia (2012), France (2014), The Netherlands (2016), Greece (2018), Ireland (2020), Germany (2022).
Several journal special issues have been published on rewriting logic: TCS 285 (2002), HOSC 20 (2007), JLAMP 81 (2012), SCP 99 (2012), JLAMP 85 (2016), JLAMP 86 (2017), JLAMP 93 (2017), JLAMP 110 (2020), and JLAMP 134 (2023).
Furthermore, several language implementations of rewriting logic (CafeOBJ, ELAN, Maude, etc.) and a variety of formal tools have also been developed and have been used in a wide range of applications. You may take a look to the retrospective on rewrite engines published in TACAS 2019.
Several snapshots of the state of rewriting logic research—some more global in scope, and others restricted to specific areas such as concurrency or object-based systems—have appeared so far CONCUR'96, Marktoberdorf'98, RTA'00, FMOODS'00, TCS'02, JLAMP'12, WoLLIC'18, JLAMP'20, and IJCAR'22.
Maude should be seen as our contribution to the broader collective effort of building good language implementations for rewriting logic. In this regard, a key distinguishing feature of Maude is its systematic and efficient use of reflection, exploiting the fact that rewriting logic is reflective, a feature that makes Maude remarkably extensible and powerful, and that allows many advanced metaprogramming and metalanguage applications.
Several versions of Maude have also been presented in different venues: RTA'99, WRLA'00, RTA'03, RTA'04, RTA'11, IJCAR'16, and IJCAR'22. An account of the history of the language may be found in the Two Decades of Maude 2015 paper. Some more recent papers have focused on specific aspects of the language: strategies, symbolic features.
