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

From The Maude System
Jump to: navigation, search
 
(22 intermediate revisions by the same user not shown)
Line 1: Line 1:
== Roadmap and Bibliography ==
+
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]].
  
* [[Media:roadmap.ps|Rewriting Logic: Roadmap and Bibliography]] by Narciso Martí-Oliet and José Meseguer.
+
In-depth presentations of Maude, and on how to use its most common features, are available in the following books:  
* [[Media:Rwlcr.bib|bibTeX file]] about Rewriting Logic that contains cross references to proceedings volumes.
+
* [[Media:Rwl.bib|bibTeX file]] about Rewriting Logic without cross references.
+
  
== Some Relevant Papers on Maude and Rewriting Logic ==
+
* 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)
  
* 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)
+
* 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)
  
* 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)
+
Several bibliographies and surveys on rewriting logic and Maude have been published:
  
* 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)
+
* M. Clavel, F. Durán, S. Eker, S. Escobar, P. Lincoln, N. Martí-Oliet, C. L. Talcott: [https://doi.org/10.1007/978-3-319-23165-5_11 Two Decades of Maude]. Logic, Rewriting, and Concurrency: 232-254 (2015). A pre-print is available [[Media:Two-Decades-of-Maude.pdf|here]].
  
* C. Rocha, J. Meseguer, C. Muñoz: [https://doi.org/10.1016/j.jlamp.2016.10.001 Rewriting modulo SMT and open system analysis]. J. Log. Algebraic Methods Program. 86(1): 269-297 (2017)
+
* J. Meseguer: [https://doi.org/10.1016/j.jlap.2012.06.003 Twenty years of rewriting logic]. J. Log. Algebraic Methods Program. 81(7-8): 721-781 (2012). A pre-print is available [[Media:20-years.pdf|here]].
  
* M. Clavel, F. Durán, S. Eker, S. Escobar, P. Lincoln, N. Martí-Oliet, C. L. Talcott: [https://doi.org/10.1007/978-3-319-23165-5_11 Two Decades of Maude]. Logic, Rewriting, and Concurrency: 232-254 (2015)
+
* 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)
  
* J. Meseguer: [https://doi.org/10.1016/j.jlap.2012.06.003 Twenty years of rewriting logic]. J. Log. Algebraic Methods Program. 81(7-8): 721-781 (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). A pre-print is available [[Media:MMroadmap_2001.pdf|here]].
  
* 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)
+
The following papers may serve as a selection of such huge body of work:
  
* M. AlTurki, J. Meseguer: [https://doi.org/10.1007/978-3-642-22944-2_28 PVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool]. CALCO: 386-392 (2011)
+
* 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). A pre-print is available [[Media:maude-jlamp.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: [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]].
  
* 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)
+
* 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). A pre-print is available [[Media:Durán.Mesegue.Rocha.Ground Confluence of Order-sorted Conditional Specifications Modulo Axioms.TR.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)
+
* C. Rocha, J. Meseguer, C. Muñoz: [https://doi.org/10.1016/j.jlamp.2016.10.001 Rewriting modulo SMT and open system analysis]. J. Log. Algebraic Methods Program. 86(1): 269-297 (2017)
 +
 
 +
* 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). 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). 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). A pre-print is available [[Media:MPMea_2003.pdf|here]].
  
 
* 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)
 +
 +
* P.C. Ölveczky, J. Meseguer: [https://doi.org/10.1007/s10990-007-9001-5 Semantics and pragmatics of Real-Time Maude]. High. Order Symb. Comput. 20(1-2): 161-196 (2007)
 +
 +
* F. Durán, J. Meseguer: [https://doi.org/10.1016/j.scico.2006.07.002 Maude's module algebra]. Sci. Comput. Program. 66(2): 125-153 (2007)
  
 
* 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)
Line 41: Line 51:
 
* J. Meseguer: [https://www.sciencedirect.com/science/article/pii/030439759290182F Conditional rewriting logic as a unified model of concurrency]. Theor. Comput. Sci. 96(1): 73-155 (1996)
 
* J. Meseguer: [https://www.sciencedirect.com/science/article/pii/030439759290182F Conditional rewriting logic as a unified model of concurrency]. Theor. Comput. Sci. 96(1): 73-155 (1996)
  
[http://maude.cs.illinois.edu/papers/ Some Additional Papers on Maude and on Rewriting Logic]
+
Some Additional Papers on Maude and on Rewriting Logic are available [http://maude.cs.illinois.edu/papers/ here].

Latest revision as of 15:32, 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 on how to use its most common features, are 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.