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

From The Maude System
Jump to: navigation, search
Line 1: Line 1:
 
A friendly introduction to the latest advances in the symbolic features of Maude will appear in Proc. LOPSTER 2020: [[Media:maude-tapas.pdf|Symbolic Computation in Maude: Some Tapas]].
 
A friendly introduction to the latest advances in the symbolic features of Maude will appear in Proc. LOPSTER 2020: [[Media:maude-tapas.pdf|Symbolic Computation in Maude: Some Tapas]].
 +
 +
In-depth presentations of Maude and how to use their most common features is available in the following books:
 +
 +
* 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)
 +
 +
* P.C. Ölveczky: [https://doi.org/10.1007/978-1-4471-6687-0 Designing Reliable Distributed Systems - A Formal Methods Approach Based on Executable Modeling in Maude]. Springer (2017)
  
 
Several bibliographies and surveys on rewriting logic and Maude have been published:
 
Several bibliographies and surveys on rewriting logic and Maude have been published:
Line 28: Line 34:
  
 
* 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]].
 
* 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, J. Meseguer, M. Palomino: [https://doi.org/10.1016/j.tcs.2006.12.009 Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic]. Theor. Comput. Sci. 373(1-2): 70-91 (2007)
 
* M. Clavel, J. Meseguer, M. Palomino: [https://doi.org/10.1016/j.tcs.2006.12.009 Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic]. Theor. Comput. Sci. 373(1-2): 70-91 (2007)

Revision as of 15:31, 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.

In-depth presentations of Maude and how to use their most common features is available in the following books:

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.