References

  1. Oana Andrei, Gabriel Ciobanu & Dorel Lucanu (2006): Expressing Control Mechanisms of Membranes by Rewriting Strategies. In: Hendrik Jan Hoogeboom, Gheorghe Paun, Grzegorz Rozenberg & Arto Salomaa: Membrane Computing, 7th International Workshop, WMC 2006, Leiden, The Netherlands, July 17-21, 2006, Revised, Selected, and Invited Papers, Lecture Notes in Computer Science 4361. Springer, pp. 154–169. Available at http://dx.doi.org/10.1007/11963516_10.
  2. Oana Andrei & Dorel Lucanu (2009): Strategy-Based Proof Calculus for Membrane Systems. In: Roşu, pp. 23–43. Available at http://dx.doi.org/10.1016/j.entcs.2009.05.011.
  3. Lacramioara Astefanoaei, Frank S. de Boer & Mehdi Dastani (2009): Rewriting Agent Societies Strategically. In: Proceedings of the 2009 IEEE/WIC/ACM International Conference on Web Intelligence and International Conference on Intelligent Agent Technology - Workshops, Milan, Italy, September 15-18, 2009. IEEE, pp. 441–444. Available at http://dx.doi.org/10.1109/WI-IAT.2009.321.
  4. Lacramioara Astefanoaei, Frank S. de Boer & Mehdi Dastani (2010): Strategic executions of choreographed timed normative multi-agent systems. In: Wiebe van der Hoek, Gal A. Kaminka, Yves Lespérance, Michael Luck & Sandip Sen: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2010, Toronto, Canada, May 10-14, 2010, Volume 1-3. IFAAMAS, pp. 965–972. Available at http://doi.acm.org/10.1145/1838206.1838336.
  5. Lacramioara Astefanoaei, Mehdi Dastani, John-Jules Ch. Meyer & Frank S. de Boer (2009): On the Semantics and Verification of Normative Multi-Agent Systems. Journal of Universal Computer Science 15(13), pp. 2629–2652. Available at http://www.jucs.org/jucs_15_13/on_the_semantics_and.
  6. Leo Bachmair & Nachum Dershowitz (1994): Equational Inference, Canonical Proofs, and Proof Orderings. Journal of the ACM 41(2), pp. 236–276. Available at http://doi.acm.org/10.1145/174652.174655.
  7. Emilie Balland, Paul Brauner, Radu Kopetz, Pierre-Etienne Moreau & Antoine Reilles (2006): TOM Manual. Available at http://tom.loria.fr.
  8. Peter Borovanský, Claude Kirchner, Hélène Kirchner & Pierre-Etienne Moreau (2002): ELAN from a rewriting logic point of view. Theoretical Computer Science 285(2), pp. 155–185.
  9. Peter Borovanský, Claude Kirchner, Hélène Kirchner & Christophe Ringeissen (2001): Rewriting with Strategies in ELAN: A Functional Semantics. International Journal of Foundations of Computer Science 12, pp. 69–95.
  10. Peter Borovanský, Claude Kirchner, Hélène Kirchner & Christophe Ringeissen (2001): Rewriting with Strategies in ELAN: A Functional Semantics. International Journal of Foundations of Computer Science 12(1), pp. 69–95. Available at http://dx.doi.org/10.1142/S0129054101000412.
  11. Adel Bouhoula, Jean-Pierre Jouannaud & José Meseguer (2000): Specification and proof in membership equational logic. Theoretical Computer Science 236(1-2), pp. 35–132. Available at http://dx.doi.org/10.1016/S0304-3975(99)00206-6.
  12. BPEL (2007): Web Services Business Process Execution Language (WS-BPEL). Version 2.0. OASIS Standard.
  13. BPMN (2011): Business Process Model and Notation (BPMN). Version 2.0. OMG Specification.
  14. Christiano Braga, Edward Hermann Haeusler, José Meseguer & Peter D. Mosses (2000): Maude Action Tool: Using Reflection to Map Action Semantics to Rewriting Logic. In: Teodor Rus: Algebraic Methodology and Software Technology. 8th International Conference, AMAST 2000, Iowa City, Iowa, USA, May 20-27, 2000, Proceedings, Lecture Notes in Computer Science 1816. Springer, pp. 407–421. Available at http://dx.doi.org/10.1007/3-540-45499-3_29.
  15. Christiano Braga & Alberto Verdejo (2007): Modular Structural Operational Semantics with Strategies. In: Rob van Glabbeek & Peter D. Mosses: Proceedings of the Third Workshop on Structural Operational Semantics, SOS 2006, Bonn, Germany, August 26, 2006, Electronic Notes in Theoretical Computer Science 175(1). Elsevier, pp. 3–17. Available at http://dx.doi.org/10.1016/j.entcs.2006.10.024.
  16. Roberto Bruni, Alberto Lluch-Lafuente & Ugo Montanari (2009): Hierarchical Design Rewriting with Maude. In: Roşu, pp. 45–62. Available at http://dx.doi.org/10.1016/j.entcs.2009.05.012.
  17. Luca Cardelli & Andrew D. Gordon (1998): Mobile Ambients. In: Maurice Nivat: Foundations of Software Science and Computation Structures, First International Conference, FoSSaCS'98 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98 Lisbon, Portugal, March 28–April 4, 1998 Proceedings, Lecture Notes in Computer Science 1378. Springer, pp. 140–155.
  18. Fabricio Chalub & Christiano Braga (2007): Maude MSOS Tool. In: Denker & Talcott, pp. 133–146. Available at http://dx.doi.org/10.1016/j.entcs.2007.06.012.
  19. Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Mart\'ı-Oliet, José Meseguer & Carolyn Talcott (2011): Maude Manual (Version 2.6). Available at http://maude.cs.uiuc.edu/maude2-manual.
  20. Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Mart\'ı-Oliet, José Meseguer & Carolyn L. Talcott (2007): All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic. Lecture Notes in Computer Science 4350. Springer. Available at http://dx.doi.org/10.1007/978-3-540-71999-1.
  21. Manuel Clavel & José Meseguer (1997): Internal Strategies in a Reflective Logic. In: Bernhard Gramlich & Hélène Kirchner: Proceedings of the CADE-14 Workshop on Strategies in Automated Deduction, Townsville, Australia, pp. 1–12.
  22. Grit Denker & Carolyn Talcott (2007): Proceedings of the Sixth International Workshop on Rewriting Logic and its Applications, WRLA 2006, Vienna, Austria, April 1-2, 2006. Electronic Notes in Theoretical Computer Science 176(4). Elsevier.
  23. Steven Eker, Narciso Mart\'ı-Oliet, José Meseguer & Alberto Verdejo (2007): Deduction, Strategies, and Rewriting. In: Myla Archer, Thierry Boy de la Tour & César Muñoz: Proceedings of the 6th International Workshop on Strategies in Automated Deduction, STRATEGIES 2006, Seattle, WA, USA, August 16, 2006, Electronic Notes in Theoretical Computer Science 174(11). Elsevier, pp. 3–25. Available at http://dx.doi.org/10.1016/j.entcs.2006.03.017.
  24. Steven Eker, José Meseguer & Ambarish Sridharanarayanan (2003): The Maude LTL Model Checker and Its Implementation. In: Thomas Ball & Sriram K. Rajamani: Model Checking Software, 10th International SPIN Workshop. Portland, OR, USA, May 9-10, 2003, Proceedings, Lecture Notes in Computer Science 2648. Springer, pp. 230–234. Available at http://dx.doi.org/10.1007/3-540-44829-2_16.
  25. Laura Henche (2009): Introducción a la notación BPMN y su relación con las estrategias del lenguaje Maude. Facultad de Informática, Universidad Complutense de Madrid, Spain.
  26. Mercedes Hidalgo-Herrero & Yolanda Ortega-Mallén (2002): An Operational Semantics for the Parallel Language Eden. Parallel Processing Letters 12(2), pp. 211–228.
  27. Mercedes Hidalgo-Herrero, Yolanda Ortega-Mallén & Fernando Rubio (2005): Towards Improving Skeletons in Eden. In: Gerhard R. Joubert, Wolfgang E. Nagel, Frans J. Peters, Oscar G. Plata, P. Tirado & Emilio L. Zapata: Parallel Computing: Current & Future Issues of High-End Computing, Proceedings of the International Conference ParCo 2005, 13-16 September 2005, Department of Computer Architecture, University of Malaga, Spain, John von Neumann Institute for Computing Series 33. Central Institute for Applied Mathematics, Jülich, Germany, pp. 843–850.
  28. Mercedes Hidalgo-Herrero, Alberto Verdejo & Yolanda Ortega-Mallén (2007): Using Maude and Its Strategies for Defining a Framework for Analyzing Eden Semantics. In: Sergio Antoy: Proceedings of the Sixth International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2006, Seattle, WA, USA, August 11, 2006, Electronic Notes in Theoretical Computer Science 174(10). Elsevier, pp. 119–137. Available at http://dx.doi.org/10.1016/j.entcs.2007.02.051.
  29. Bjarne Holen, Einar Broch Johnsen & Arild Waaler (2009): Proof Search for the First-Order Connection Calculus in Maude. In: Roşu, pp. 173–188. Available at http://dx.doi.org/10.1016/j.entcs.2009.05.019.
  30. Gérard P. Huet (1981): A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm. Journal of Computer and System Sciences 23(1), pp. 11–21. Available at http://dx.doi.org/10.1016/0022-0000(81)90002-7.
  31. Hélène Kirchner & Pierre-Etienne Moreau (1995): Prototyping Completion with Constraints Using Computational Systems. In: Jieh Hsiang: Rewriting Techniques and Applications, 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995, Proceedings, Lecture Notes in Computer Science 914. Springer, pp. 438–443. Available at http://dx.doi.org/10.1007/3-540-59200-8_79.
  32. Pierre Lescanne (1989): Completion Procedures as Transition Rules + Control. In: J. D\'ıaz & F. Orejas: TAPSOFT'89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989, Lecture Notes in Computer Science 351. Springer, pp. 28–41.
  33. Rita Loogen, Yolanda Ortega-Mallén & Ricardo Peña (2005): Parallel Functional Programming in Eden. Journal of Functional Programming 15(1), pp. 431–475.
  34. Dorel Lucanu (2009): Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions. In: Aart Middeldorp: Proceedings of the Eighth International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2008, Castle of Hagenberg, Austria, July 14, 2008, Electronic Notes in Theoretical Computer Science 237. Elsevier, pp. 107–125. Available at http://dx.doi.org/10.1016/j.entcs.2009.03.038.
  35. Narciso Mart\'ı-Oliet & José Meseguer (2002): Rewriting logic as a logical and semantic framework. In: Dov M. Gabbay & Franz Guenthner: Handbook of Philosophical Logic, Second Edition, Volume 9. Kluwer Academic Publishers, pp. 1–87.
  36. Narciso Mart\'ı-Oliet, José Meseguer & Alberto Verdejo (2004): Towards a Strategy Language for Maude. In: Narciso Mart\'ı-Oliet: Proceedings of the Fifth International Workshop on Rewriting Logic and its Applications, WRLA 2004, Barcelona, Spain, March 27-April 4, 2004, Electronic Notes in Theoretical Computer Science 117. Elsevier, pp. 417–441. Available at http://dx.doi.org/10.1016/j.entcs.2004.06.020.
  37. Narciso Mart\'ı-Oliet, José Meseguer & Alberto Verdejo (2009): A Rewriting Semantics for Maude Strategies. In: Roşu, pp. 227–247. Available at http://dx.doi.org/10.1016/j.entcs.2009.05.022.
  38. Hamza Merouani, Farid Mokhati & Hassina Seridi-Bouchelaghem (2010): Towards formalizing web service composition in Maude's strategy language. In: Ayman Alnsour & Shadi Aljawarneh: Proceedings of the 1st International Conference on Intelligent Semantic Web-Services and Applications, ISWSA 2010, Amman, Jordan, June 14-16, 2010. ACM, pp. 15. Available at http://doi.acm.org/10.1145/1874590.1874605.
  39. José Meseguer (1992): Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science 96(1), pp. 73–155. Available at http://dx.doi.org/10.1016/0304-3975(92)90182-F.
  40. José Meseguer & Christiano Braga (2004): Modular Rewriting Semantics of Programming Languages. In: Charles Rattray, Savi Maharaj & Carron Shankland: Algebraic Methodology and Software Technology, 10th International Conference, AMAST 2004, Stirling, Scotland, UK, July 12-16, 2004, Proceedings, Lecture Notes in Computer Science 3116. Springer, pp. 364–378. Available at http://dx.doi.org/10.1007/978-3-540-27815-3_29.
  41. José Meseguer & Grigore Roşu (2007): The rewriting logic semantics project. Theoretical Computer Science 373(3), pp. 213–237. Available at http://dx.doi.org/10.1016/j.tcs.2006.12.018.
  42. Fernando Rosa-Velardo, Clara Segura & Alberto Verdejo (2006): Typed Mobile Ambients in Maude. In: Horatiu Cirstea & Narciso Mart\'ı-Oliet: Proceedings of the 6th International Workshop on Rule-Based Programming, RULE 2005, Nara, Japan, April 23, 2005, Electronic Notes in Theoretical Computer Science 147(1). Elsevier, pp. 135–161. Available at http://dx.doi.org/10.1016/j.entcs.2005.06.041.
  43. Grigore Roşu (2009): Proceedings of the Seventh International Workshop on Rewriting Logic and its Applications, WRLA 2008, Budapest, Hungary, March 29-30, 2008. Electronic Notes in Theoretical Computer Science 238(3). Elsevier.
  44. Gustavo Santos-Garc\'ıa & Miguel Palomino (2007): Solving Sudoku Puzzles with Rewriting Rules. In: Denker & Talcott, pp. 79–93. Available at http://dx.doi.org/10.1016/j.entcs.2007.06.009.
  45. Gustavo Santos-Garc\'ıa, Miguel Palomino & Alberto Verdejo (2009): Rewriting Logic Using Strategies for Neural Networks: An Implementation in Maude. In: Juan M. Corchado, Sara Rodríguez, James Llinas & José M. Molina: Proceedings of the International Symposium on Distributed Computing and Artificial Intelligence, DCAI 2008, University of Salamanca, Spain, October 22-24, 2008, Advances in Soft Computing 50. Springer, pp. 424–433. Available at http://dx.doi.org/10.1007/978-3-540-85863-8_50.
  46. Irek Ulidowski & Iain Phillips (2002): Ordered SOS Process Languages for Branching and Eager Bisimulations. Information and Computation 178, pp. 180–213.
  47. Eelco Visser (2001): Stratego: A Language for Program Transformation Based on Rewriting Strategies. In: Aart Middeldorp: Rewriting Techniques and Applications, 12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001, Proceedings, Lecture Notes in Computer Science 2051. Springer, pp. 357–362.
  48. Eelco Visser (2004): Program Transformation with Stratego/XT: Rules, Strategies, Tools, and Systems in StrategoXT-0.9. In: C. Lengauer: Domain-Specific Program Generation, Lecture Notes in Computer Science 3016. Springer, pp. 216–238.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org