Difference between revisions of "Some Papers on Maude and on Rewriting Logic"

From The Maude System
Jump to: navigation, search
Line 9: Line 9:
 
* N. Martí-Oliet, M. Palomino, A. Verdejo: [https://www.sciencedirect.com/science/article/pii/S1567832612000562?via%3Dihub Rewriting logic bibliography by topic: 1990–2011]. J. Log. Algebraic Methods Program. 81: 782-815 (2012)
 
* N. Martí-Oliet, M. Palomino, A. Verdejo: [https://www.sciencedirect.com/science/article/pii/S1567832612000562?via%3Dihub Rewriting logic bibliography by topic: 1990–2011]. J. Log. Algebraic Methods Program. 81: 782-815 (2012)
  
* N. Martí-Oliet, J. Meseguer: [https://www.sciencedirect.com/science/article/pii/S0304397501003577 Rewriting logic: roadmap and bibliography]. Theor. Comput. Sci. 285(2): 121-154 (2002)
+
* N. Martí-Oliet, J. Meseguer: [https://www.sciencedirect.com/science/article/pii/S0304397501003577 Rewriting logic: roadmap and bibliography]. Theor. Comput. Sci. 285(2): 121-154 (2002). A pre-print is available [[Media:MMroadmap_2001.pdf|here]].
  
 
The following papers may serve as a selection of such huge body of work:
 
The following papers may serve as a selection of such huge body of work:
Line 15: Line 15:
 
* F. Durán, S. Eker, S. Escobar, N. Martí-Oliet, J. Meseguer, R. Rubio, C. L. Talcott: [https://doi.org/10.1016/j.jlamp.2019.100497 Programming and symbolic computation in Maude]. J. Log. Algebraic Methods Program. 110 (2020)
 
* F. Durán, S. Eker, S. Escobar, N. Martí-Oliet, J. Meseguer, R. Rubio, C. L. Talcott: [https://doi.org/10.1016/j.jlamp.2019.100497 Programming and symbolic computation in Maude]. J. Log. Algebraic Methods Program. 110 (2020)
  
* J. Meseguer: [https://doi.org/10.1016/j.jlamp.2019.100483 Generalized rewrite theories, coherence completion, and symbolic methods]. J. Log. Algebraic Methods Program. 110 (2020)
+
* J. Meseguer: [https://doi.org/10.1016/j.jlamp.2019.100483 Generalized rewrite theories, coherence completion, and symbolic methods]. J. Log. Algebraic Methods Program. 110 (2020). A pre-print is available [[Media:BMgrt_2003.pdf|here]].
  
 
* F. Durán, J. Meseguer, C. Rocha: [https://doi.org/10.1016/j.jlamp.2019.100513 Ground confluence of order-sorted conditional specifications modulo axioms]. J. Log. Algebraic Methods Program. 111: 100513 (2020)
 
* F. Durán, J. Meseguer, C. Rocha: [https://doi.org/10.1016/j.jlamp.2019.100513 Ground confluence of order-sorted conditional specifications modulo axioms]. J. Log. Algebraic Methods Program. 111: 100513 (2020)
Line 23: Line 23:
 
* S. Escobar, R. Sasse, J. Meseguer: [https://doi.org/10.1016/j.jlap.2012.01.002 Folding variant narrowing and optimal variant termination]. J. Log. Algebraic Methods Program. 81(7-8): 898-928 (2012)
 
* S. Escobar, R. Sasse, J. Meseguer: [https://doi.org/10.1016/j.jlap.2012.01.002 Folding variant narrowing and optimal variant termination]. J. Log. Algebraic Methods Program. 81(7-8): 898-928 (2012)
  
* F. Durán, J. Meseguer: [https://doi.org/10.1016/j.jlap.2011.12.004 On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories]. J. Log. Algebraic Methods Program. 81(7-8): 816-850 (2012)
+
* F. Durán, J. Meseguer: [https://doi.org/10.1016/j.jlap.2011.12.004 On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories]. J. Log. Algebraic Methods Program. 81(7-8): 816-850 (2012). A pre-print is available [[Media:CRChC.pdf|here]].
  
* J. Meseguer, M. Palomino, N. Martí-Oliet: [https://doi.org/10.1016/j.jlap.2009.07.003 Algebraic simulations]. J. Log. Algebraic Methods Program. 79(2): 103-143 (2010)
+
* J. Meseguer, M. Palomino, N. Martí-Oliet: [https://doi.org/10.1016/j.jlap.2009.07.003 Algebraic simulations]. J. Log. Algebraic Methods Program. 79(2): 103-143 (2010). A pre-print is available [[Media:MartiOlietEtAl03-journal.pdf|here]].
  
* J. Meseguer, M. Palomino, N. Martí-Oliet: [https://doi.org/10.1016/j.tcs.2008.04.040 Equational abstractions]. Theor. Comput. Sci. 403(2-3): 239-264 (2008)
+
* J. Meseguer, M. Palomino, N. Martí-Oliet: [https://doi.org/10.1016/j.tcs.2008.04.040 Equational abstractions]. Theor. Comput. Sci. 403(2-3): 239-264 (2008). A pre-print is available [[Media:MPMea_2003.pdf|here]].
  
 
* M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, C. Talcott: [https://doi.org/10.1007/978-3-540-71999-1 All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic]. LNCS 4350, Springer (2007)
 
* M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, C. Talcott: [https://doi.org/10.1007/978-3-540-71999-1 All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic]. LNCS 4350, Springer (2007)
Line 39: Line 39:
 
* R. Bruni, J. Meseguer: [https://doi.org/10.1016/j.tcs.2006.04.012 Semantic foundations for generalized rewrite theories]. Theor. Comput. Sci. 360(1-3): 386-414 (2006)
 
* R. Bruni, J. Meseguer: [https://doi.org/10.1016/j.tcs.2006.04.012 Semantic foundations for generalized rewrite theories]. Theor. Comput. Sci. 360(1-3): 386-414 (2006)
  
* M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, J.F. Quesada: [https://doi.org/10.1016/S0304-3975(01)00359-0 Maude: specification and programming in rewriting logic]. Theor. Comput. Sci. 285(2): 187-243 (2002)
+
* M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, J.F. Quesada: [https://doi.org/10.1016/S0304-3975(01)00359-0 Maude: specification and programming in rewriting logic]. Theor. Comput. Sci. 285(2): 187-243 (2002). A pre-print is available [[Media:CDELMMQspecprog_2001.pdf|here]].
  
 
* J. Meseguer: [https://doi.org/10.1007/3-540-64299-4_26 Membership algebra as a logical framework for equational specification]. WADT: 18-61 (1997)
 
* J. Meseguer: [https://doi.org/10.1007/3-540-64299-4_26 Membership algebra as a logical framework for equational specification]. WADT: 18-61 (1997)

Revision as of 15:00, 30 December 2020

A friendly introduction to the latest advances in the symbolic features of Maude will appear in Proc. LOPSTER 2020: Symbolic Computation in Maude: Some Tapas.

Several bibliographies and surveys on rewriting logic and Maude have been published:

  • M. Clavel, F. Durán, S. Eker, S. Escobar, P. Lincoln, N. Martí-Oliet, C. L. Talcott: Two Decades of Maude. Logic, Rewriting, and Concurrency: 232-254 (2015). A pre-print is available here.

The following papers may serve as a selection of such huge body of work:

  • J. Meseguer, M. Palomino, N. Martí-Oliet: Algebraic simulations. J. Log. Algebraic Methods Program. 79(2): 103-143 (2010). A pre-print is available here.
  • J. Meseguer, M. Palomino, N. Martí-Oliet: Equational abstractions. Theor. Comput. Sci. 403(2-3): 239-264 (2008). A pre-print is available here.

Some Additional Papers on Maude and on Rewriting Logic are available here.