All about maude - A high-performance logical framework how to specify, program and verify systems in rewriting logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4350 LNCS, Issue , 2007, Pages 1-819

  Clavel, Manuel ^a   Duran, Francisco ^b   Eker, Steven ^c   Lincoln, Patrick ^c   Martí Oliet, Narciso ^a   Meseguer, José ^d   Talcott, Carolyn ^c  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^b UNIVERSITY OF MÁLAGA   (Spain)

^c SRI INTERNATIONAL   (United States)

^d University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38049179424     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (338)

1. Agha, G.: Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge (1986)
2. Agha, G., Gunter, C., Greenwald, M., Khanna, S., Meseguer, J., Sen, K., Thati, P.: Formal modeling and analysis of DoS using probabilistic rewrite theories. In: Sabelfeld, A. (ed.) Proceedings Workshop on Foundations of Computer Security, FCS'05 (affiliated with LICS'05), Chicago, IL, June 30-July 1, 2005, pp. 91-102 (2005), http://www.cs.chalmers.se/~andrei/FCS05/fcs05.pdf
3. Agha, G., Meseguer, J., Sen, K.: PMaude: Rewrite-based specification language for probabilistic object systems. In: Cerone, A., Wiklicky, H. (eds.) Proceedings Third Workshop on Quantitative Aspects of Programming Languages, QAPL'05, Edinburgh, UK, April 2005. Electronic Notes in Theoretical Computer Science, vol. 153(2), pp. 213-239. Elsevier, Amsterdam (2007), http://www.sciencedirect.com/science/journal/15710661
4. Ahrendt, W., Roth, A., Sasse, R.: Automatic validation of transformation rules for Java verification against a rewriting semantics. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 412-426. Springer, Heidelberg (2005)
5. Al-Turki, M.: A rewriting logic approach to the semantics of Orc. Master's thesis, Computer Science Department, University of Illinois at Urbana-Champaign (December 2005)
6. Albarrán, A., Duran, F., Vallecillo, A.: From Maude specifications to SOAP distributed implementations: A smooth transition. In: VI Jornadas Ingeniería del Software y Bases de Datos (JISBD'01), pp. 419-433 (2001)
7. Albarrán, A., Durán, F., Vallecillo, A.: Maude meets CORBA. In: Proceedings 2nd Argentine Symposium on Software Engineering, Buenos Aires, Argentina, September 10-11, 2001 (2001)
8. Albarrán, A., Durán, F., Vallecillo, A.: On the smooth implementation of component-based system specifications. In: Proceedings 6th ECOOP International Workshop on Component-Oriented Programming, WCOP'01, Budapest, Hungary, June 2001
9. van Baalen, J., Caldwell, J.L., Mishra, S.: Specifying and checking fault-tolerant agent-based protocols using Maude. In: Rash, J.L., Rouff, C.A., Truszkowski, W., Gordon, D.F., Hinchey, M.G. (eds.) FAABS 2000. LNCS (LNAI), vol. 1871, pp. 180-193. Springer, Heidelberg (2001)
10. Baker, H.G., Hewitt, C.: Laws for communicating parallel processes. In: Proceedings of the 1977 IFIP Congress, pp. 987-992. IFIP Press (1977)
11. Ball, W.W.R., Coxeter, H.S.M.: Mathematical Recreations and Essays. Dover (1987)
12. Basin, D., Clavel, M., Meseguer, J.: Reflective metalogical frameworks. In: Proceedings of LFM'99: Workshop on Logical Frameworks and Metalanguages, Paris, France, September 28, 1999 (1999), http://www.site.uottawa.ca/~afelty/ LFM99/index.html
13. Basin, D., Clavel, M., Meseguer, J.: Rewriting logic as a metalogical framework. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 55-80. Springer, Heidelberg (2000)
14. Basin, D., Clavel, M., Meseguer, J.: Reflective metalogical frameworks. ACM Transactions on Computational Logic 5(3), 528-576 (2004)
15. Basin, D., Denker, G.: Maude versus Haskell: An experimental comparison in security protocol analysis. In: Futatsugi, K. (ed.) Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000. Electronic Notes in Theoretical Computer Science, vol. 36, pp. 235-256. Elsevier, Amsterdam (2000), http://www. sciencedirect.com/science/journal/15710661
16. Bergstra, J., Tucker, J.: Characterization of computable data types by means of a finite equational specification method. In: de Bakker, J.W., van Leeuwen, J. (eds.) Automata, Languages and Programming. LNCS, vol. 85, pp. 76-90. Springer, Heidelberg (1980)
17. Berkling, K.J., Fehr, E.: A consistent extension of the lambda-calculus as a base for functional programming languages. Information and Control 55, 89-101 (1982)
18. Blaha, M., Rumbaugh, J.: Object-oriented modeling and design with UML, 2nd edn. Prentice-Hall, Englewood Cliffs (2005)
19. Bochm, H.-J., Atkinson, R.R., Plass, M.F.: Ropes: An alternative to strings. Software Practice and Experience 25(12), 1315-1330 (1995)
20. Bogomolny, A.: Interactive mathematics miscellany and puzzles, http://www.cut-the-knot.org/games.shtml.
21. Boronat, A., Carsí, J.A, Ramos, I.: Algebraic specification of a model transformation engine. In: Baresi, L., Heckel, R. (eds.) FASE 2006 and ETAPS 2006. LNCS, vol. 3922, pp. 262-277. Springer, Heidelberg (2006)
22. Borovanský, P., Kirchner, C., Kirchner, H., Moreau, P.-E.: ELAN from a rewriting logic point of view. Theoretical Computer Science 285(2), 155-185 (2002)
23. Bouhoula, A., Jouannaud, J.-P., Meseguer, J.: Specification and proof in membership equational logic. Theoretical Computer Science 236, 35-132 (2000)
24. Braga, C.: Rewriting Logic as a Semantic Framework for Modular Structural Operational Semantics. PhD thesis, Departamento de Informática, Pontificia Universidade Católica de Rio de Janeiro, Brasil (2001)
25. Braga, C., Haeusler, H., Meseguer, J., Mosses, P.: Maude Action Tool: Using reflection to map action semantics to rewriting logic. In: Rus, T. (ed.) AMAST 2000. LNCS, vol. 1816, pp. 407-421. Springer, Heidelberg (2000)
26. Braga, C., Meseguer, J.: Modular rewriting semantics in practice. In: Martí-Oliet, N. (ed.) Proceedings Fifth International Workshop on Rewriting Logic and its Applications, WRLA 2004, Barcelona, Spain, March 27-28, 2004. Electronic Notes in Theoretical Computer, vol. 117, pp. 393-416. Elsevier, Amsterdam (2005), http://www.sciencedirect.com/science/journal/15710661
27. Bruni, R.: Tile Logic for Synchronized Rewriting of Concurrent Systems. PhD thesis, Dipartimento di Informatica, Università di Pisa. Technical Report TD-1/99 (1999), http://www.di.unipi.it/phd/tesi/tesi_1999/TD-1-99.ps.gz
28. Bruni, R., Meseguer, J.: Generalized rewrite theories. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 252-266. Springer, Heidelberg (2003)
29. Bruni, R., Meseguer, J., Montanari, U.: Implementing tile systems: Some examples from process calculi. In: Degano, P., Vaccaro, U., Pirillo, G. (eds.) Proceedings 6th Italian Conference on Theoretical Computer Science, ICTCS'98, pp. 168-179. World Scientific (1998)
30. Bruni, R., Meseguer, J., Montanari, U.: Internal strategies in a rewriting implementation of tile systems. In: Kirchner, C., Kirchner, H. (eds.) Proceedings Second International Workshop on Rewriting Logic and its Applications, WRLA'98, Pont-à-Mousson, France, September 1-4, 1998. Electronic Notes in Theoretical Computer Science, vol. 15, pp. 95-116. Elsevier, Amsterdam (1998), http://www.sciencedirect.com/science/journal/15710661
31. Bruni, R., Meseguer, J., Montanari, U.: Process and term tile logic. Technical Report SRI-CSL-98-06, Computer Science Laboratory, SRI International, July 1998. Also TR-98-09, Dipartimento di Informática, Università di Pisa, http://www.di.unipi.it/"bruni/publications/techrep98.ps.gz
32. Bruni, R., Meseguer, J., Montanari, U.: Executable tile specifications for process calculi. In: Finance, J.-P. (ed.) FASE 1999 and ETAPS 1999. LNCS, vol. 1577, pp. 60-76. Springer, Heidelberg (1999)
33. Burstall, R., Goguen, J.A.: The semantics of Clear, a specification language. In: Bjorner, D. (ed.) Abstract Software Specifications. LNCS, vol. 86, pp. 292-332. Springer, Heidelberg (1980)
34. Butler, F., Cervesato, I., Jaggard, A.D., Scedrov, A.: A formal analysis of some properties of Kerberos 5 using MSR. In: Fifteenth Computer Security Foundations Workshop - CSFW-15, Cape Breton, NS, Canada, 24-26 June 2002, pp. 175-190. IEEE Computer Society Press, Los Alamitos (2002)
35. Calder, M., Shankland, C.: A symbolic semantics and bisimulation for Full LOTOS. In: Kim, M., Chin, B., Kang, S., Lee, D. (eds.) Proceedings of FORTE 2001, 21st International Conference on Formal Techniques for Networked and Distributed Systems, pp. 184-200. Kluwer Academic Publishers, Dordrecht (2001)
36. Carabetta, G., Degano, P., Gadducci, F.: CCS semantics via proved transition systems and rewriting logic. In: Kirchner, C., Kirchner, H. (eds.) Proceedings Second International Workshop on Rewriting Logic and its Applications, WRLA'98, Pont-à-Mousson, France, September 1-4, 1998. Electronic Notes in Theoretical Computer Science, vol. 15, pp. 253-272. Elsevier, Amsterdam (1998), http://www.sciencedirect.com/science/journal/ 15710661
37. Carrano, F.M., Prichard, J.J.: Data Abstraction and Problem Solving with C++, 3rd edn. Addison-Wesley, Reading (2002)
38. Cervesato, I.: A specification language for crypto-protocols based on multiset rewriting, dependent types and subsorting. In: Workshop on Specification, Analysis and Validation for Emerging Technologies, pp. 1-22 (2001)
39. Cervesato, I.: Typed MSR: Syntax and examples. In: Gorodetski, V.I., Skormin, V.A., Popyack, L.J. (eds.) MMM-ACNS 2001. LNCS, vol. 2052, pp. 159-177. Springer, Heidelberg (2001)
40. Cervesato, I.: Data access specification and the most powerful symbolic attacker in MSR. In: Okada, M., Pierce, B.C., Scedrov, A., Tokuda, H., Yonezawa, A. (eds.) ISSS 2002. LNCS, vol. 2609, pp. 384-416. Springer, Heidelberg (2003)
41. Cervesato, I., Durgin, N., Lincoln, P.D., Mitchell, J.C., Scedrov, A.: A metanotation for protocol analysis. In: 12th Computer Security Foundations Workshop CSFW-12, Mordano, Italy, 28-30 June 1999, pp. 55-69. IEEE Computer Society Press, Los Alamitos (1999)
42. Cervesato, I., Stehr, M.-O.: Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types. In: Martí-Oliet, N. (ed.) Proceedings Fifth International Workshop on Rewriting Logic and its Applications, WRLA 2004, Barcelona, Spain, March 27-28, 2004. Electronic Notes in Theoretical Computer Science, vol. 117, pp. 183-207. Elsevier, Amsterdam (2005), http://www.sciencedirect.com/science/journal/ 15710661
43. Cervesato, I., Stehr, M.-O.: Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types. Higher-Order and Symbolic Computation 20(1-2), 3-35 (2007)
44. Chalub, F.: An Implementation of Modular SOS in Maude. Master's thesis, Universidade Federal Fluminense (May 2005), http://www.ic.uff.br/-frosario/ dissertation.pdf.
45. Chalub, F., Braga, C.: A modular rewriting semantics for CML. Journal of Universal Computer Science 10(7), 789-807 (2004), http://www.jucs.org/jucs_10_7/ a_modular_rewriting_semantics
46. Chalub, F., Braga, C.: Maude MSOS tool. In: Denker, G., Talcott, C. (eds.) Proceedings Sixth International Workshop on Rewriting Logic and its Applications, WRLA 2006, Vienna, Austria, April 1-2, 2006. Electronic Notes in Theoretical Computer Science, pp. 3-17. Elsevier, Amsterdam (2007), http://www.sciencedirect.com/science/journal/15710661
47. Chen, F., Roşu, G., Venkatesan, R.P.: Rule-based analysis of dimensional safety. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 197-207. Springer, Heidelberg (2003)
48. Cirstea, H.: Calcul de Réécriture: Fondements et Applications. PhD thesis, Université Henri Poincaré - Nancy I (2000)
49. Cirstea, H., Kirchner, C.: Combining higher-order and first-order computations using p-calculus: Towards a semantics of ELAN. In: Gabbay, D., de Rijke, M. (eds.) Frontiers of Combining Systems 2, pp. 95-121. Research Studies Press/Wiley, Chichester (1999)
50. Cirstea, H., Kirchner, C.: The simply typed rewriting calculus. In: Futatsugi, K. (ed.) Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000. Electronic Notes in Theoretical Computer Science, vol. 36, pp. 23-41. Elsevier, Amsterdam (2000), http://www.sciencedirect.com/science/journal/15710661
51. Cirstea, H., Kirchner, C.: The rewriting calculus -Part I. Logic Journal of the Interest Group in Pure and Applied Logics 9(3), 363-399 (2001)
52. Cirstea, H., Kirchner, C.: The rewriting calculus -Part II. Logic Journal of the Interest Group in Pure and Applied Logics 9(3), 401-434 (2001)
53. Cirstea, H., Kirchner, C., Liquori, L.: The rho cube. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001 and ETAPS 2001. LNCS, vol. 2030, pp. 168-183. Springer, Heidelberg (2001)
54. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)
55. Clavel, M.: Reflection in General Logics and in Rewriting Logic, with Applications to the Maude Language. PhD thesis, Universidad de Navarra, Spain (February 1998)
56. Clavel, M.: Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications. CSLI Publications (2000)
57. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: specification and programming in rewriting logic. SRI International (January 1999), http://maude.cs.uiuc.edu/ maudel/manual/
58. Clavel, M., Duran, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: A tutorial on Maude. SRI International (March 2000), http://maude.es.uiuc.edu/maudel/tutorial/
59. Clavel, M., Duran, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Towards Maude 2.0. In: Futatsugi, K. (ed.) Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000. Electronic Notes in Theoretical Computer Science, vol. 36, pp. 294-315. Elsevier, Amsterdam (2000), http://www.sciencedirect.com/science/journal/15710661
60. Clavel, M., Duran, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: specification and programming in rewriting logic. Theoretical Computer Science 285(2), 187-243 (2002)
61. Clavel, M., Durán, F., Eker, S., Meseguer, J.: Building equational proving tools by reflection in rewriting logic. In: Proceedings of the CafeOBJ Symposium '98, Numazu, Japan, CafeOBJ Project (April 1998), http://maude.es. uiuc.edu/papers/
62. Clavel, M., Duran, F., Eker, S., Meseguer, J.: Design and implementation of the Cafe prover and the Church-Rosser checker tools. Technical report. Computer Science Laboratory, SRI International (March 1998), http://maude.es.uiuc.edu/papers/
63. Clavel, M., Durán, F., Eker, S., Meseguer, J.: Building equational proving tools by reflection in rewriting logic. In: Futatsugi, K., Nakagawa, A.T., Tamai, T. (eds.) CAFE: An Industrial-Strength Algebraic Formal Method, Elsevier, Amsterdam (2000), http://maude.cs.uiuc.edu/papers/
64. Clavel, M., Duran, F., Eker, S., Meseguer, J., Stehr, M.-O.: Maude as a formal meta-tool. In: Woodcock, J.C.P., Davies, J., Wing, J.M. (eds.) FM 1999. LNCS, vol. 1709, pp. 1684-1703. Springer, Heidelberg (1999)
65. Clavel, M., Egea, M.: ITP/OCL: A rewriting-based validation tool for UML+OCL static class diagrams. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, pp. 368-373. Springer, Heidelberg (2006)
66. Clavel, M., Meseguer, J.: Reflection and strategies in rewriting logic. In: Meseguer, J. (ed.) Proceedings First International Workshop on Rewriting Logic and its Applications, WRLA'96, Asilomar, California, September 3-6, 1996. Electronic Notes in Theoretical Computer Science, vol. 4, pp. 126-148. Elsevier, Amsterdam (1996), http://www.sciencedirect.com/science/journal/15710661
67. Clavel, M., Meseguer, J.: Reflection in conditional rewriting logic. Theoretical Computer Science 285(2), 245-288 (2002)
68. Clavel, M., Meseguer, J., Palomino, M.: Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic. In: Gadducci, F., Montanari, U. (eds.) Proceedings Fourth International Workshop on Rewriting Logic and its Applications, WRLA 2002, Pisa, Italy, September 19-21, 2002. Electronic Notes in Theoretical Computer Science, vol. 71, pp. 91-107. Elsevier, Amsterdam (2004)
69. Clavel, M., Palomino, M., Riesco, A.: Introducing the ITP tool: a tutorial. Journal of Universal Computer Science 12(11), 1618-1650 (2006)
70. Clavel, M., Palomino, M., Santa-Cruz, J.: Integrating decision procedures in reflective rewriting-based theorem provers. In: Antoy, S., Toyama, Y. (eds.) Proceedings 4th International Workshop on Reduction Strategies in Rewriting and Programming (WRS'04), Aachen, Germany, June 2004, pp. 15-24 (2004), http://www-i2.informatik.rwth-aachen.de/WRS04/WRS-proceedings.pdf
71. Clavel, M., Santa-Cruz, J.: ASIP + ITP: A verification tool based on algebraic semantics. In: López-Fraguas, F.J. (ed.) V Jornadas sobre Programación y Lenguajes, PROLE 2005, pp. 149-158. Thomson, Madrid (2005)
72. Contejean, E., Devie, H.: An efficient incremental algorithm for solving systems of linear diophantine equations. Information and Computation 113(1), 143-172 (1994)
73. Coquand, T., Huet, G.: The calculus of constructions. Information and Computation 76(2/3), 95-120 (1988)
74. d'Amorim, M., Roşu, G.: An equational specification for the Scheme language. Journal of Universal Computer Science 11(7), 1327-1348 (2005)
75. Degano, P., Gadducci, F., Priami, C.: A causal semantics for CCS via rewriting logic. Theoretical Computer Science 275(1-2), 271-304 (2002)
76. Denker, G., García-Luna-Aceves, J.J., Meseguer, J., Ölveczky, P.C., Raju, J., Smith, B., Talcott, C.L.: Specification and analysis of a reliable broadcasting protocol in Maude. In: Hajek, B., Sreenivas, R.S. (eds.) Proceedings 37th Allerton Conference on Communication, Control and Computation, pp. 738-747. University of Illinois (1999)
77. Denker, G., García-Luna-Aceves, J.J., Meseguer, J., Ölveczky, P.C., Raju, J., Smith, B., Talcott, C.L.: Specifying a reliable broadcasting protocol in Maude. Technical report, Computer Science Laboratory, SRI International (1999)
78. Denker, G., Meseguer, J., Talcott, C.L.: Protocol specification and analysis in Maude. In: Heintze, N., Wing, J. (eds.) Proceedings of Workshop on Formal Methods and Security Protocols, June 25, 1998, Indianapolis, Indiana (1998)
79. Denker, G., Meseguer, J., Talcott, C.L.: Formal specification and analysis of active networks and communication protocols: The Maude experience. In: Maughan, D., Koob, G., Saydjari, S. (eds.) Proceedings DARPA Information Survivability Conference and Exposition, DISCEX 2000, Hilton Head Island, South Carolina, January 25-27, 2000, pp. 251-265. IEEE Computer Society Press, Los Alamitos (2000)
80. Denker, G., Meseguer, J., Talcott, C.L.: Rewriting semantics of meta-objects and composable distributed services. In: Futatsugi, K. (ed.) Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000. Electronic Notes in Theoretical Computer Science, vol. 36, pp. 407-427. Elsevier, Amsterdam (2000)
81. Denker, G., Millen, J.: CAPSL and CIL language design: A common authentication protocol specification language and its intermediate language. Technical Report SRI-CSL-99-02, Computer Science Laboratory, SRI International (1999), http://www.csl.sri.com/-denker/pub_99.html
82. Denker, G., Millen, J.: CAPSL intermediate language. In: Heintze, N., Clarke, E. (eds.) Proceedings of Workshop on Formal Methods and Security Protocols, FMSP'99, July 1999, Trento, Italy (1999)
83. Denker, G., Millen, J.: CAPSL integrated protocol environment. In: Maughan, D., Koob, G., Saydjari, S. (eds.) Proceedings DARPA Information Surviv-ability Conference and Exposition, DISCEX 2000, Hilton Head Island, South Carolina, January 25-27, 2000, pp. 207-222. IEEE Computer Society Press, Los Alamitos (2000)
84. Denker, G., Millen, J.: The CAPSL integrated protocol environment. Computer Science Laboratory, SRI International. Technical Report SRI-CSL-2000-02 (2000)
85. Denker, G., Talcott, C. (eds.): Proceedings Sixth International Workshop on Rewriting Logic and its Applications, WRLA 2006, Vienna, Austria, April 1-2, 2006. Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam (2007), http://www.sciencedirect.com/science/journal/15710661
86. Denker, G., Talcott, C.L.: Formal checklists for remote agent dependability. In: Martí-Oliet, N. (ed.) Proceedings Fifth International Workshop on Rewriting Logic and its Applications. WRLA 2004, Barcelona, Spain, March 27-28, 2004. Electronic Notes in Theoretical Computer Science, vol. 117, pp. 229-248. Elsevier, Amsterdam (2005), http://www.sciencedirect.com/science/ journal/15710661
87. Denker, G., Talcott, C.L.: A formal framework for goal net analysis. In: Workshop on Verification and Validation of Planning Systems, AAAI (2005)
88. Deplagne, E.: Sequent calculus viewed modulo. In: Pilière, C. (ed.) Proceedings of the Fifth ESSLLI Student Session, pp. 66-76 (2000)
89. Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pp. 243-320. North-Holland, Amsterdam (1990)
90. van Deursen, A.: Executable Language Definitions. PhD thesis, University of Amsterdam (1994)
91. van Deursen, A., Heering, J., Klint, P. (eds.): Language Prototyping: An Algebraic Specification Approach. World Scientific (1996)
92. Domenjoud, E.: Solving systems of linear diophantine equations: An algebraic approach. In: Tarlecki, A. (ed.) Mathematical Foundations of Computer Science 1991. LNCS, vol. 520, pp. 9-13. Springer, Heidelberg (1991)
93. Dowek, G., Hardin, T., Kirchner, C.: Higher order unification via explicit substitutions. Information and Computation 157(1/2), 183-235 (2000)
94. Dowek, G., Hardin, T., Kirchner, C.: HOL-λσ: An intentional first-order expression of higher-order logic. Mathematical Structures in Computer Science 11(1), 21-45 (2001)
95. Dowek, G., Hardin, T., Kirchner, C.: Theorem proving modulo. Journal of Automated Reasoning 31(1), 33-72 (2003)
96. Durán, F.: Coherence checker and completion tools for Maude specifications. Manuscript, Computer Science Laboratory, SRI International (2000), http://www.Ice.uma.es/-duran/ChC/
97. Durán, F.: Termination checker and Knuth-Bendix completion tools for Maude equational specifications. Manuscript, Computer Science Laboratory, SRI International (2000), http://maude.cs.uiuc.edu/papers/
98. Durán, F.: A Reflective Module Algebra with Applications to the Maude Language. PhD thesis, University of Málaga, Spain (1999), http://maude.es.uiuc.edu/papers/
99. Durán, F.: The extensibility of Maude's module algebra. In: Rus, T. (ed.) AMAST 2000. LNCS, vol. 1816, pp. 422-437. Springer, Heidelberg (2000)
100. Durán, F., Eker, S., Lincoln, P., Meseguer, J.: Principles of Mobile Maude. In: Kotz, D., Mattern, F. (eds.) MA 2000, ASA/MA 2000, and ASA 2000. LNCS, vol. 1882, pp. 73-85. Springer, Heidelberg (2000)
101. Durán, F., Escobar, S., Lucas, S.: Towards (constructor) normal forms for Maude within Full Maude. In: Lucas, S., Gallardo, M.-M., Pimentel, E. (eds.) IV Jornadas sobre Programación y Lenguajes, PROLE 2004, pp. 125-136 (2004)
102. Durán, F., Escobar, S., Lucas, S.: New evaluation commands for Maude within Full Maude. In: Martí-Oliet, N. (ed.) Proceedings Fifth International Workshop on Rewriting Logic and its Applications. WRLA 2004, Barcelona, Spain, March 27 28, 2004. Electronic Notes in Theoretical Computer Science, vol. 117, pp. 263-284. Elsevier, Amsterdam (2005), http://www. sciencedirect.com/science/journal/15710661
103. Durán, F., Escobar, S., Lucas, S.: On-demand evaluation for Maude. In: Abdennadher, S., Ringeissen, C. (eds.) Proceedings Fifth International Workshop on Rule-Based Programming. RULE 2004, Aachen, Germany. Electronic Notes in Theoretical Computer Science, vol. 124(1), pp. 25-39. Elsevier, Amsterdam (2005), http://www.sciencedirect.com/science/journal/15710661
104. Durán, F., Lucas, S., Meseguer, J., Marché, C., Urbain, X.: Proving termination of membership equational programs. In: Sestoft, P., Heintze, N. (eds.) Proceedings ACM SIGPLAN 2004 Symposium on Partial Evaluation and Program Manipulation, PEPM'04, pp. 147-158. ACM Press, New York (2004)
105. Durán, F., Lucas, S., Meseguer, J., Marché, C., Urbain, X.: Proving operational termination of membership equational programs. Higher-Order and Symbolic Computation (to appear, 2007)
106. Durán, F., Meseguer, J.: A Church-Rosser checker tool for Maude equational specifications. Manuscript, Computer Science Laboratory, SRI International (2000), http://www.lce.uma.es/~duran/CRC/
107. Durán, F., Meseguer, J.: An extensible module algebra for Maude. In: Kirchner, C., Kirchner, H. (eds.) Proceedings Second International Workshop on Rewriting Logic and its Applications. WRLA'98, Pont-à-Mousson, France, September 14, 1998. Electronic Notes in Theoretical Computer Science, vol. 15, pp. 174-195. Elsevier, Amsterdam (1998), http://www.sciencedirect.com/science/ journal/15710661
108. Durán, F., Meseguer, J.: The Maude specification of Full Maude. Technical report, Computer Science Laboratory, SRI International (Feb. 1999), http://maude.es.uiuc.edu/papers/
109. Durán, F., Meseguer, J.: Parameterized theories and views in Full Maude 2.0. In: Futatsugi, K. (ed.) Proceedings Third International Workshop on Rewriting Logic and its Applications. WRLA 2000, Kanazawa, Japan, September 18-20, 2000. Electronic Notes in Theoretical Computer Science, vol. 36, pp. 316-338. Elsevier, Amsterdam (2000), http://www.sciencedirect.com/science/ journal/15710661
110. Durán, F., Meseguer, J.: Structured theories and institutions. Theoretical Computer Science 309(1-3), 357-380 (2003)
111. Durán, F., Meseguer, J.: Maude's module algebra. Science of Computer Programming 66(2), 125-153 (2007)
112. Durán, F., Roldan, M., Vallecillo, A.: Using Maude to write and execute ODP information viewpoint specifications. Computer Standards and Interfaces 27(6), 597-620 (2005)
113. Durán, F., Vallecillo, A.: Formalizing ODP enterprise specifications in Maude. Computer Standards and Interfaces 25(2), 83-102 (2003)
114. Durán, F., Verdejo, A.: A conference reviewing system in Mobile Maude. In: Gadducci, F., Montanari, U. (eds.) Proceedings Fourth International Workshop on Rewriting Logic and its Applications. WRLA 2002, Pisa, Italy, September 19-21, 2002. Electronic Notes in Theoretical Computer Science, vol. 71, pp. 79-95. Elsevier, Amsterdam (2004), http://www.sciencedirect.eom/science/ journal/15710661
115. Egea, M.: ITP/OCL: A theorem prover-based tool for UML+OCL class diagrams. Master's thesis, Facultad de Informática, Universidad Complutense de Madrid (Sept. 2005), http://maude.sip.ucm.es/~marina/pubs/dea.pdf
116. Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 1, Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science, vol. 6. Springer, Heidelberg (1985)
117. Eker, S.: Fast matching in combination of regular equational theories. In: Meseguer, J. (ed.) Proceedings First International Workshop on Rewriting Logic and its Applications. WRLA'96, Asilomar, California, September 3-6, 1996. Electronic Notes in Theoretical Computer Science, vol. 4, pp. 90-109. Elsevier, Amsterdam (1996), http://www.sciencedirect.com/science/journal/15710661
118. Eker, S.: Term rewriting with operator evaluation strategies. In: Kirchner, C., Kirchner, H. (eds.) Proceedings Second International Workshop on Rewriting Logic and its Applications. WRLA'98, Pont-à-Mousson, France, September 1-4, 1998. Electronic Notes in Theoretical Computer Science, vol. 15, pp. 311-330. Elsevier, Amsterdam (1998), http://www.sciencedirect.com/science/ journal/15710661
119. Eker, S.: Associative-commutative rewriting on large terms. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 14-29. Springer, Heidelberg (2003)
120. Eker, S., Knapp, M., Laderoute, K., Lincoln, P., Talcott, C.: Pathway Logic: Executable models of biological networks. In: Gadducci, F., Montanari, U. (eds.) Proceedings Fourth International Workshop on Rewriting Logic and its Applications. WRLA 2002, Pisa, Italy, September 19-21, 2002. Electronic Notes in Theoretical Computer Science, vol. 71, pp. 125-142, Elsevier, Amsterdam (2004), http://www.sciencedirect.com/science/journal/15710661
121. Eker, S., Meseguer, J., Sridharanarayanan, A.: The Maude LTL model checker. In: Gadducci, F., Montanari, U. (eds.) Proceedings Fourth International Workshop on Rewriting Logic and its Applications. WRLA 2002, Pisa, Italy, September 19-21, 2002. Electronic Notes in Theoretical Computer Science, vol. 71, pp. 143-168. Elsevier, Amsterdam (2004), http ://www.sciencedirect.com/ science/journal/15710661
122. Enderton, H.B.: A Mathematical Introduction to Logic, 2nd edn. Academic Press, London (2000)
123. Escobar, S., Meadows, C., Meseguer, J.: A rewriting-based inference system for the NRL protocol analyzer: Grammar generation. In: Proceedings FMSE'05, Formal Methods in Security Engineering, Alexandria, Virginia, November 2005, pp. 1-12. ACM Press, New York (2005)
124. Escobar, S., Meadows, C., Meseguer, J.: Equational cryptographic reasoning in the Maude-NRL Protocol Analyzer. In: Fernández, M., Kirchner, C. (eds.) Proceedings First International Workshop on Security and Rewriting Techniques, SecReT 2006, Venice, Italy, July 15, 2006. Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam (2007), http://www.sciencedirect.com/science/journal/15710661
125. Escobar, S., Meadows, C., Meseguer, J.: A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties. Theoretical Computer Science 367(1-2), 162-202 (2006)
126. Escobar, S., Meseguer, J., Thati, P.: Natural narrowing for general term rewriting systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 279-293. Springer, Heidelberg (2005)
127. Farzan, A., Cheng, F., Meseguer, J., Roşu, G.: Formal analysis of Java programs in JavaFAN. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 501-505. Springer, Heidelberg (2004)
128. Farzan, A., Meseguer, J.: Partial order reduction for rewriting semantics of programming languages. In: Denker, G., Talcott, C. (eds.) Proceedings Sixth International Workshop on Rewriting Logic and its Applications. WRLA 2006, Vienna, Austria, April 1-2, 2006. Electronic Notes in Theoretical Computer Science, pp. 56-75. Elsevier, Amsterdam (2007), http://www.sciencedirect.com/ science/journal/15710661
129. Farzan, A., Meseguer, J.: State space reduction of rewrite theories using invisible transitions. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, pp. 142-157. Springer, Heidelberg (2006)
130. Farzan, A., Meseguer, J., Roşu, G.: Formal JVM code analysis in JavaFAN. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 132-147. Springer, Heidelberg (2004)
131. Fernández, J.L., Toval, A.: Can intuition become rigorous? Foundations for UML model verification tools. In: Titsworth, F.M. (ed.) International Symposium on Software Reliability Engineering, pp. 344-355. IEEE Computer Society Press, Los Alamitos (2000)
132. Fernández, J.L., Toval, A.: Seamless formalizing the UML semantics through metamodels. In: Siau, K., Halpin, T. (eds.) Unified Modeling Language: Systems Analysis, Design, and Development Issues, pp. 224-248. Idea Group Publishing (2001)
133. Ferrari, G., Montanari, U.: Tile formats for located and mobile systems. Information and Computation 156(1/2), 173-235 (2000)
134. Fischer, B., Roşu, G.: Interpreting abstract interpretations in membership equational logic. Technical report, Research Institute for Advanced Computer Science. Technical Report RIACS 01.16 (2001)
135. Fomin, D., Genkin, S., Itenberg, I.: Mathematical Circles: The Russian Experience. Mathematical World, vol. 7. American Mathematical Association (1996)
136. Frühwirth, T., Abdennadher, S.: Essentials of Constraint Programming. Springer, Heidelberg (2003)
137. Futatsugi, K. (ed.): Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000. Electronic Notes in Theoretical Computer Science, vol. 36. Elsevier, Amsterdam (2000), http://www.sciencedirect.com/science/journal/ 15710661
138. Futatsugi, K., Diaconescu, R.: CafeOBJ Report. AMAST Series. World Scientific (1998)
139. Gadducci, F., Montanari, U.: Tiles, rewriting rules, and CCS. In: Meseguer, J. (ed.) Proceedings First International Workshop on Rewriting Logic and its Applications. WRLA'96, Asilomar, California, September 3-6, 1996. Electronic Notes in Theoretical Computer Science, vol. 4, pp. 1-19. Elsevier, Amsterdam (1996), http://www.sciencedirect.com/science/journal/15710661
140. Gadducci, F., Montanari, U.: The tile model. In: Plotkin, G., Stirling, C., Tofte, M. (eds.) Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 133-166. MIT Press, Cambridge (2000)
141. Gadducci, F., Montanari, U.: Comparing logics for rewriting: Rewriting logic, action calculi and tile logic. Theoretical Computer Science 285(2), 319-358 (2002)
142. Gadducci, F., Montanari, U. (eds.): Proceedings Fourth International Workshop on Rewriting Logic and its Applications, WRLA 2002, Pisa, Italy, September 19-21, 2002. Electronic Notes in Theoretical Computer Science, vol. 71. Elsevier, Amsterdam (2004), http://www.sciencedirect.com/science/journal/ 15710661
143. Genesereth, M.R., Nilsson, N.J.: Logical Foundations of Artificial Intelligence. Morgan Kaufmann, San Francisco (1987)
144. Glynn, P.: On the role of generalized semi-Markov processes in simulation
145. Goguen, J., Meseguer, J.: Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science 105, 217-273 (1992)
146. Goguen, J., Winkler, T., Meseguer, J., Futatsugi, K., Jouannaud, J.-P.: Introducing OBJ. In: Goguen, J.A., Malcolm, G. (eds.) Software Engineering with OBJ: Algebraic Specification in Action, pp. 3-167. Kluwer Academic Publishers, Dordrecht (2000)
147. Goguen, J.A., Jouannaud, J.-P., Meseguer, J.: Operational semantics for order-sorted algebra. In: Brauer, W. (ed.) Automata, Languages and Programming. LNCS, vol. 194, pp. 221-231. Springer, Heidelberg (1985)
148. Goodloe, A., Gunter, CA., Stehr, M.-O.: Formal prototyping in early stages of protocol design. In: Proceedings Workshop on Issues in the Theory of Security (WITS'05), Long Beach, California, January 2005, pp. 67-80. ACM Press, New York (2005)
149. Grimeland, M.: Modeling and analysis of time-dependent security protocols in Real-Time Maude. Master's thesis, Dept. of Informatics, University of Oslo (June 2006)
150. Gutierrez-Nolasco, S., Venkatasubramanian, N., Stehr, M.-O., Talcott, C.: Exploring adaptability of secure group communication using formal prototyping techniques. In: Proceedings Third Workshop on Adaptive and Reflective Middleware (RM2004), Toronto, Ontario, Canada, October 19, 2004, pp. 232-237. ACM Press, New York (2004)
151. Harman, N. A.: Correctness and verification of hardware systems using Maude. Technical Report 3-2000, Department of Computer Science, University of Wales at Swansea (2000)
152. Neal, A.: Harman: Verifying a simple pipelined microprocessor using Maude. In: Cerioli, M., Reggio, G. (eds.) WADT 2001 and CoFI WG Meeting 2001. LNCS, vol. 2267, pp. 128-151. Springer, Heidelberg (2002)
153. Havelund, K., Roşu, G.: Java PathExplorer -A runtime verification tool. In: Proceedings 6th International Symposium on Artificial Intelligence, Robotics and Automation in Space, ISAIRAS'01, Montreal, Canada, June 18-22 (2001)
154. Havelund, K., Roşu, G.: Monitoring Java programs with Java PathExplorer. In: Havelund, K., Rosu, G. (eds.) Proceedings First Workshop on Runtime Verification, RV'200'1, Paris, France, July 23, 2001. Electronic Notes in Theoretical Computer Science, vol. 55(2), pp. 200-217. Elsevier, Amsterdam (2001), http://www.sciencedirect.com/science/journal/15710661
155. Havelund, K., Roşu, G.: Monitoring programs using rewriting. Technical report, Research Institute for Advanced Computer Science (2001)
156. Havelund, K., Roşu, G.: Testing linear temporal logic formulae on finite execution traces. Technical Report RIACS 01.08, Research Institute for Advanced Computer Science (May 2001)
157. Hayes, P.J.: What the frame problem is and isn't. In: Pylyshyn, Z.W. (ed.) The Robot's Dilemma: The Frame Problem in Artificial Intelligence, pp. 123-137. Ablex Publishing, Greenwich (1987)
158. Hendrix, J., Clavel, M., Meseguer, J.: A sufficient completeness reasoning tool for partial specifications. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 165-174. Springer, Heidelberg (2005)
159. Hendrix, J., Meseguer, J.: On the completeness of context-sensitive ordersorted specifications. Technical Report UIUCDCS-R-2007-2812, Computer Science Dept., University of Illinois at Urbana-Champaign (Feb. 2007)
160. Hendrix, J., Meseguer, J., Ohsaki, H.: A sufficient completeness checker for linear order-sorted specifications modulo axioms. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 151-155. Springer, Heidelberg (2006)
161. Hendrix, J., Ohsaki, H., Meseguer, J.: Sufficient completeness checking with propositional tree automata. Technical Report UIUCDCS-R-2005-2635, University of Illinois at Urbana-Champaign (2005), http://maude.es.uiuc.edu/ tools/scc/
162. Hendrix, J., Ohsaki, H., Viswanathan, M.: Propositional tree automata. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 50-65. Springer, Heidelberg (2006)
163. Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery 32(1), 137-172 (1985)
164. Hidalgo-Herrero, M., Verdejo, A., Ortega-Mallén, Y.: Looking for Eden through Maude and its strategies. In: López-Fraguas, F.J. (ed.) V Jornadas sobre Programación y Lenguajes, PROLE 2005, pp. 13-23. Thomson, Madrid (2005)
165. Horowitz, E., Sahni, S.: Fundamentals of Data Structures in Pascal. Fourth Edition. Computer Science Press (1994)
166. Ishikawa, H., Futatsugi, K., Watanabe, T.: An operational semantics of GAEA in CafeOBJ. In: Futatsugi, K., Goguen, J.A., Meseguer, J. (eds.) OBJ/CafeOBJ/Maude Workshop at Formal Methods '99: Formal Specification, Proof, and Applications, pp. 213-227. Theta (1999)
167. Ishikawa, H., Meseguer, J., Watanabe, T., Futatsugi, K., Nakashima, H.: On the semantics of GAEA -An object-oriented specification of a concurrent reflective language in rewriting logic. In: Proceedings IMSA'97, pp. 70-109. Information-Technology Promotion Agency, Japan (1997)
168. Johnsen, E.B., Owe, O., Axelsen, E.W.: A runtime environment for concurrent objects with asynchronous method calls. In: Martí-Oliet, N. (ed.) Proceedings Fifth International Workshop on Rewriting Logic and its Applications, WRLA 2004, Barcelona, Spain, March 27-28, 2004. Electronic Notes in Theoretical Computer Science, vol. 117, pp. 375-392. Elsevier, Amsterdam (2005), http://www.sciencedirect.com/science/journal/15710661
169. Kapur, D., Subramaniam, M.: New uses of linear arithmetic in automated theorem proving by induction. Journal of Automated Reasoning 16(1-2), 39-78 (1996)
170. Kapur, D., Zhang, H.: An overview of rewrite rule laboratory (RRL). J. Computer and Mathematics with Applications 29(2), 91-114 (1995)
171. Kasera, S., Bhattacharyya, S., Keaton, M., Kiwior, D., Kurose, J., Towsley, D., Zabele, S.: Scalable fair reliable multicast using active services. Technical Report TR 99-44, University of Massachusetts, Amherst, CMPSCI (1999)
172. Katelman, M., Meseguer, J.: A rewriting semantics for ABEL with applications to hardware/software co-design and analysis. In: Denker, G., Talcott, C (eds.) Proceedings Sixth International Workshop on Rewriting Logic and its Applications, WRLA 2006, Vienna, Austria, April 1-2, 2006. Electronic Notes in Theoretical Computer Science. Elsevier, pp. 95-109. Elsevier, Amsterdam (2007), http ://www.sciencedirect.com/science/journal/15710661
173. Kaufmann, M., Manolios, P., Moore, J.S.: Computer-Aided Reasoning: An Approach. Kluwer Academic Publishers, Dordrecht (2000)
174. Kernighan, B.W., Ritchie, D.M.: The C Programming Language, 2nd edn. Prentice-Hall, Englewood Cliffs (1988)
175. Kirchner, C.: Order-sorted equational unification. Technical Report 954, INRIA Lorraine & LORIA, Nancy, France (Dec. 1988)
176. Kirchner, C., Kirchner, H. (ed.): Proceedings Second International Workshop on Rewriting Logic and its Applications, WRLA'98, Pont-à- Mousson, France, September 1-4, 1998. Electronic Notes in Theoretical Computer Science, vol. 15. Elsevier, Amsterdam (1998), http://www.sciencedirect.com/ science/journal/15710661
177. Knapp, A.: Generating rewrite theories from UML collaborations. In: Futatsugi, K., Nakagawa, A.T., Tamai, T. (eds.) Cafe: An Industrial-Strength Algebraic Formal Method, pp. 97-120. Elsevier, Amsterdam (2000)
178. Knapp, A.: A Formal Approach to Object-Oriented Software Engineering. PhD thesis, Institut für Informatik, Universität München, 2000. Shaker Verlag, Aachen (2001)
179. Kolch, W.: Meaningful relationships: The regulation of the Ras/ Raf/ MEK/ ERK pathway by protein interactions. Biochemical Journal 351, 289-305 (2000)
180. Kosiuczenko, P., Wirsing, M.: Timed rewriting logic with application to object-oriented specification. Technical report, Institut für Informatik, Universität München (1995)
181. Kotz, D., Gray, R.: Mobile agents and the future of the internet. ACM Operating Systems Review 33(3), 7-13 (1999)
182. Kumar, N., Sen, K., Meseguer, J., Agha, G.: Probabilistic rewrite theories: Unifying models, logics and tools. Technical Report UIUCDCS-R-2003-2347, Computer Science Dept., University of Illinois at Urbana-Champaign (May 2003)
183. Kumar, N., Sen, K., Meseguer, J., Agha, G.: A rewriting based model of probabilistic distributed object systems, In: Najm, E., Nestmann, U., Stevens, P. (eds.) FMOODS 2003. LNCS, vol. 2884, pp. 32-46. Springer, Heidelberg (2003)
184. Laneve, C., Montanari, U.: Axiomatizing permutation equivalence in the Acalculus. In: Kirchner, H., Levi, G. (eds.) Algebraic and Logic Programming. LNCS, vol. 632, pp. 350-363. Springer, Heidelberg (1992)
185. Laneve, C., Montanari, U.: Axiomatizing permutation equivalence. Mathematical Structures in Computer Science 6, 219-249 (1996)
186. Lange, D., Oshima, M.: Seven good reasons for mobile agents. Communications of the ACM 42, 88-89 (1999)
187. Lescanne, P.: From λσ to λσ, a journey through calculi of explicit substitutions. In: Boehm, H. (ed.) Conference Record of POPL'94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, Oregon, January 17-21, 1994, pp. 60-69. ACM Press, New York (1994)
188. Leucker, M., Noll, T.: Rewriting logic as a framework for generic verification tools. In: Futatsugi, K. (ed.) Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000. Electronic Notes in Theoretical Computer Science, vol. 36, pp. 117-133. Elsevier, Amsterdam (2000), http://www.sciencedirect.com/ science/journal/15710661
189. Lien, E.: Formal modeling and analysis of the NORM multicast protocol in Real-Time Maude. Master's thesis, Department of Linguistics, University of Oslo (April 2004), http://wo.uio.no/as/WebObjects/theses.woa/wo/0.3.9
190. Lucas, S.: Context-sensitive computations in functional and functional logic programs, Journal of Functional and Logic Programming 1(4), 446-453 (1998)
191. Lucas, S.: Termination of rewriting with strategy annotations. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 669-684. Springer, Heidelberg (2001)
192. Lucas, S.: Context-sensitive rewriting strategies. Information and Computation 178(1), 294-343 (2002)
193. Luo, Z.: Computation and Reasoning: A Type Theory for Computer Science. International Series of Monographs on Computer Science. Oxford University Press, Oxford (1994)
194. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems -Specification. Springer, Heidelberg (1992)
195. Martí-Oliet, N. (ed.): Proceedings Fifth International Workshop on Rewriting Logic and its Applications, WRLA 2004, Barcelona, Spain, March 27-28, 2004. Electronic Notes in Theoretical Computer Science, vol. 117. Elsevier, Amsterdam (2005), http://www.sciencedirect.com/science/journal/15710661
196. Martí-Oliet, N., Meseguer, J.: General logics and logical frameworks. In: Gabbay, D.M. (ed.) What is a Logical System? Studies in Logic and Computation, vol. 4, pp. 355-392. Oxford University Press, Oxford (1994)
197. Martí-Oliet, N., Meseguer, J.: Action and change in rewriting logic. In: Pareschi, R., Fronhöfer, B. (eds.) Dynamic Worlds: From the Frame Problem to Knowledge Management. Applied Logic Series, vol. 12, pp. 1-53. Kluwer Academic Publishers, Dordrecht (1999)
198. Martí-Oliet, N., Meseguer, J.: Rewriting logic as a logical and semantic framework. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 9, 2nd edn., pp. 1-87. Kluwer Academic Publishers, Dordrecht (2002)
199. Martí-Oliet, N., Meseguer, J.: Rewriting logic: roadmap and bibliography. Theoretical Computer Science 285(2), 121-154 (2002)
200. Martí-Oliet, N., Meseguer, J., Palomino, M.: Algebraic simulations (Submitted for publication, 2007), http://maude.sip.ucm.es/~miguelpt/ bibliography
201. Martí-Oliet, N., Meseguer, J., Palomino, M.: Theoroidal maps as algebraic simulations. In: Fiadeiro, J.L., Mosses, P.D., Orejas, F. (eds.) WADT 2004. LNCS, vol. 3423, pp. 126-143. Springer, Heidelberg (2005)
202. Martí-Oliet, N., Meseguer, J, Verdejo, A.: Towards a strategy language for Maude. In: Martí-Oliet, N. (ed.) Proceedings Fifth International Workshop on Rewriting Logic and its Applications, WRLA 2004, Barcelona, Spain, March 27-28, 2004. Electronic Notes in Theoretical Computer Science, vol. 117, pp. 417-441. Elsevier, Amsterdam (2005), http://www. sciencedirect.com/science/journal/15710661
203. Martí-Oliet, N., Palomino, M., Verdejo, A.: A tutorial on specifying data structures in Maude. In: Lucas, S. (ed.) Proceedings Fourth Spanish Conference on Programming and Computer Languages, PROLE 2004, Málaga, Spain, 10-12 November 2004. Electronic Notes in Theoretical Computer Science, vol. 137(1), pp. 105-132. Elsevier, Amsterdam (2005), http://www.sciencedirect.com/science/journal/15710661
204. Martin-Löf, P.: Intuitionistic Type Theory. Bibliopolis (1984)
205. Mason, I.A., Talcott, CL.: A semantics preserving actor translation. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 369-378. Springer, Heidelberg (1997)
206. Mason, I.A., Talcott, C.L.: Actor languages: Their syntax, semantics, translation, and equivalence. Theoretical Computer Science 228(1) (1999)
207. Mason, I.A., Talcott, C.L.: Simple network protocol simulation within Maude. In: Futatsugi, K. (ed.) Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000. Electronic Notes in Theoretical Computer Science, vol. 36, pp. 277-294. Elsevier, Amsterdam (2000), http://www.sciencedirect.com/science/ journal/15710661
208. Mason, I.A., Talcott, C.L.: IOP: The Interoperability Platform & IMaude: An interactive extension of Maude. In: Marti-Oliet, N. (ed.) Proceedings Fifth International Workshop on Rewriting Logic and its Applications, WRLA 2004, Barcelona, Spain, March 27-28, 2004. Electronic Notes in Theoretical Computer Science, vol. 117, pp. 315-333. Elsevier, Amsterdam (2005), http ://www.sciencedirect.com/science/journal/15710661
209. Mason, I.A., Talcott, CL.: The Interoperability Platform Manual (2006), http ://mes.une.edu.au/~iop/Data/Manual/manual.pdf
210. Meadows, C.: The NRL protocol analyzer: An overview. Journal of Logic Programming 26(2), 113-131 (1996)
211. Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96(1), 73-155 (1992)
212. Meseguer, J.: A logical theory of concurrent objects and its realization in the Maude language. In: Agha, G., Wegner, P., Yonezawa, A. (eds.) Research Directions in Concurrent Object-Oriented Programming, pp. 314-390. MIT Press, Cambridge (1993)
213. Meseguer, J. (ed.): Proceedings First International Workshop on Rewriting Logic and its Applications, WRLA'96, Asilomar, California, September 3-6, 1996. Electronic Notes in Theoretical Computer Science, vol. 4. Elsevier, Amsterdam (1996). http://www.sciencedirect.com/science/journal/15710661
214. Meseguer, J.: Rewriting logic as a semantic framework for concurrency; A progress report. In: Sassone, V, Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 331-372. Springer, Heidelberg (1996)
215. Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18-61. Springer, Heidelberg (1998)
216. Meseguer, J.: Research directions in rewriting logic. In: Berger, U., Schwichtenberg, H. (eds.) Computational Logic, Proceedings of the NATO Advanced Study Institute on Computational Logic held in Marktoberdorf, Germany, July 29 - August 6, 1997. NATO ASI Series F: Computer and Systems Sciences, vol. 165, pp, 347-398. Springer, Heidelberg (1998)
217. Meseguer, J.: A rewriting logic sampler. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 1-28. Springer, Heidelberg (2005)
218. Meseguer, J., Braga, C.: Modular rewriting semantics of programming languages. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 364-378. Springer, Heidelberg (2004)
219. Meseguer, J., Futatsugi, K., Winkler, T.: Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents. In: Proceedings of the 1992 International Symposium on New Models for Software Architecture, Tokyo, Japan, November 1992, pp. 61-106. Research Institute of Software Engineering (1992)
220. Meseguer, J., Goguen, J.: Initiality, induction and computability. In: Nivat, M., Reynolds, J. (eds.) Algebraic Methods in Semantics, pp. 459-541. Cambridge University Press, Cambridge (1985)
221. Meseguer, J., Montanari, U.: Mapping tile logic into rewriting logic. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 62-91. Springer, Heidelberg (1998)
222. Meseguer, J., Palomino, M., Martí-Oliet, N.: Equational abstractions. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 2-16. Springer, Heidelberg (2003)
223. Meseguer, J., Ro̧u, G.: Rewriting logic semantics: From language specifications to formal analysis tools. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 1-44. Springer, Heidelberg (2004)
224. Meseguer, J., Roşu, G.: The rewriting logic semantics project. In: Mosses, P.D., Ulidowski, I. (eds.) Proceedings Second Workshop on Structural Operational Semantics, SOS 2005, Lisbon, Portugal, July 10, 2005. Electronic Notes in Theoretical Computer Science, vol. 156(1), pp. 27-56. Elsevier, Amsterdam (2007), http://www.sciencedirect.com/science/journal/15710661
225. Meseguer, J., Sharykin, R.: Specification and analysis of distributed object-based stochastic hybrid systems. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol. 3927, pp. 460-475. Springer, Heidelberg (2006)
226. Meseguer, J., Stehr, M.-O., Talcott, C.L.: Specifying the PLAN language in Maude (2000), Slides available at: http://www-formal.stanford.edu/clt/Talks/ 00sep-utokyo-talk.ps.gz
227. Meseguer, J., Talcott, C.: Semantic models for distributed object reflection. In: Magnusson, B. (ed.) ECOOP 2002. LNCS, vol. 2374, pp. 1-36. Springer, Heidelberg (2002)
228. Meseguer, J., Talcott, C.L.: Using rewriting logic to interoperate architectural description languages (I and II). Lectures at the Santa Fe and Seattle DARPA-EDCS Workshops, March and July (1997), http ://www-formal. stanford.edu/clt/ArpaNsf/adl-interop.html
229. Meseguer, J., Talcott, C.L.: A partial order event model for concurrent objects. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 415-430. Springer, Heidelberg (1999)
230. Meseguer, J., Thati, P.: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. In: Martí-Oliet, N. (ed.) Proceedings Fifth International Workshop on Rewriting Logic and its Applications, WRLA 2004, Barcelona, Spain, March 27-28, 2004. Electronic Notes in Theoretical Computer Science, vol. 117, pp. 153-182. Elsevier, Amsterdam (2005), http://www.sciencedirect.com/science/Journal/ 15710661
231. Meseguer, J., Thati, P.: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. Higher-Order and Symbolic Computation 20(1-2), 123-160 (2007)
232. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
233. Mosses, P.D.: Semantics, modularity, and rewriting logic. In: Kirchner, C., Kirchner, H. (eds.) Proceedings Second International Workshop on Rewriting Logic and its Applications, WRLA'98, Pont-à-Mousson, France, September 1-4, 1998. Electronic Notes in Theoretical Computer Science, vol. 15, pp. 404-421, Elsevier, Amsterdam (1998), http://www.sciencedirect.com/science/ journal/15710661
234. Mosses, P.D.: Logical specification of operational semantics. In: Flum, J., Rodriguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 32-49. Springer, Heidelberg (1999)
235. Mosses, P.D.: Modular structural operational semantics. Journal of Logic and Algebraic Programming 60-61, 195-228 (2004)
236. Najm, E., Stefani, J.-B.: A formal operational semantics for the ODP computational model with signals, explicit binding, and reactive objects. Manuscript, ENST, Paris, France (1994)
237. Najm, E., Stefani, J.-B.: A formal semantics for the ODP computational model. Computer Networks and ISDN Systems 27, 1305-1329 (1995)
238. Najm, E., Stefani, J.-B.: Computational models for open distributed systems, In: Bowman, H., Derrick, J. (eds.) Proceedings Second IFIP Conference on Formal Methods for Open Object-Based Distributed Systems. FMOODS'97, Canterbury, Kent, UK, July 21-23, 1997, pp. 157-176. Chapman & Hall, Boca Raton (1997)
239. Nakajima, S.: Encoding mobility in CafeOBJ: An exercise of describing mobile code-based software architecture. In: Proceedings of the CafeOBJ Symposium '98, Numazu, Japan, CafeOBJ Project (April 1998)
240. Nakajima, S., Futatsugi, K.: An object-oriented modeling method for algebraic specifications in CafeOBJ. In: Proceedings, 19th International Conference on Software Engineering, Boston, Massachussets, May 1997, pp. 34-44. IEEE Computer Society Press, Los Alamitos (1997)
241. Naumov, P., Stehr, M.-O., Meseguer, J.: The HOL/NuPRL proof translator - A practical approach to formal interoperability. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol. 2152, pp. 329-345. Springer, Heidelberg (2001)
242. Object Management Group: Object Constraint Language specification (2004), http://www.omg.org/technology/documents/modeling.spec.catalog.htm#OCL
243. Object Management Group: Unified Modeling Language specification (2004), http://www.omg.org/technology/documents/modeling.spec.catalog.htm#UML
244. Object Management Group: Mof 2.0 query/views/transformations final adopted specification (2005), http://www.omg.org/technology/documents/ modeling.spec.catalog. htm#MOF-QVT
245. Ohsaki, H.: Beyond regularity: Equational tree automata for associative and commutative theories. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 539-553. Springer, Heidelberg (2001)
246. Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1998)
247. Olveczky, P.C.: Specification and Analysis of Real-Time and Hybrid Systems in Rewriting Logic. PhD thesis, University of Bergen, Norway (2000), http://maude.es.uiuc.edu/papers/
248. Olveczky, P.C., Caccamo, M.: Formal simulation and analysis of the CASH scheduling algorithm in Real-Time Maude. In: Baresi, L., Heckel, R. (eds.) FASE 2006 and ETAPS 2006. LNCS, vol. 3922, pp. 357-372. Springer, Heidelberg (2006)
249. Ölveczky, P.C., Keaton, M., Meseguer, J., Talcott, C.L., Zabele, S.: Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude. In: Hussmann, H. (ed.) FASE 2001 and ETAPS 2001. LNCS, vol. 2029, pp. 333-347. Springer, Heidelberg (2001)
250. Ölveczky, P.C., Kosiuczenko, P., Wirsing, M.: An object-oriented algebraic steam-boiler control specification. In: Abrial, J.-R., Borger, E., Langmaack, H. (eds.) Formal Methods for Industrial Applications. LNCS, vol. 1165, pp. 379-402. Springer, Heidelberg (1996)
251. Ölveczky, P.C., Meseguer, J.: Real-Time Maude: A tool for simulating and analyzing real-time and hybrid systems. In: Futatsugi, K. (ed.) Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000. Electronic Notes in Theoretical Computer Science, vol. 36, pp. 361-382. Elsevier, Amsterdam (2000), http://wwv.sciencedirect.com/science/journal/15710661
252. Olveczky, P.C., Meseguer, J.: Specification of real-time and hybrid systems in rewriting logic. Theoretical Computer Science 285(2), 359-405 (2002)
253. Ölveczky, P.C., Meseguer, J.: Specification and analysis of real-time systems using Real-Time Maude. In: Wermelinger, M., Margaria-Steffen, T. (eds.) FASE 2004 and ETAPS 2004. LNCS, vol. 2984, pp. 354-358. Springer, Heidelberg (2004)
254. Ölveczky, P.C., Meseguer, J.: Abstraction and completeness for Real-Time Maude. In: Denker, G., Talcott, C (eds.) Proceedings Sixth International Workshop on Rewriting Logic and its Applications, WRLA 2006, Vienna, Austria, April 1-2, 2006. Electronic Notes in Theoretical Computer Science, pp. 128-153. Elsevier, Amsterdam (2007), http://www.sciencedirect.com/ science/journal/15710661
255. Ölveczky, P.C., Meseguer, J.: Semantics and pragmatics of Real-Time Maude. Higher-Order and Symbolic Computation 20(1-2), 161-196 (2007)
256. Ölveczky, P.C., Meseguer, J., Talcott, C.L.: Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude. Formal Methods in System Design 29(3), 253-293 (2006)
257. Ölveczky, P.C., Thorvaldsen, S.: Formal modeling and analysis of wireless sensor network algorithms in Real-Time Maude. In: 20th International Parallel and Distributed Processing Symposium, IPDPS 2006, Rhodes Island, Greece, April 2006, IEEE Computer Society Press, Los Alamitos (2006)
258. Palomino, M.: Reflexión, Abstracción y Simulación en la Lógica de Reescritura. PhD thesis, Universidad Complutense de Madrid, Spain (March 2005)
259. Palomino, M., Martí-Oliet, N., Verdejo, A.: Playing with Maude. In: Abdennadher, S., Ringeissen, C (eds.) Proceedings Fifth International Workshop on Rule-Based Programming, RULE 2004, Aachen, Germany. Electronic Notes in Theoretical Computer Science, vol. 124(1), pp. 3-23. Elsevier, Amsterdam (2005), http://www.sciencedirect.com/science/journal/15710661
260. Peña, R.: Diseño de Programas. Formalismo y Abstracción. Tercera Edición. Prentice-Hall, Madrid (2005)
261. Petersson, K., Smith, J., Nordström, B.: Programming in Martin-Löf's Type Theory. An Introduction. International Series of Monographs on Computer Science. Clarendon Press, Oxford (1990)
262. Pita, I., Martí-Oliet, N.: A Maude specification of an object oriented database model for telecommunication networks. In: Meseguer, J. (ed.) Proceedings First International Workshop on Rewriting Logic and its Applications, WRLA'96, Asilomar, California, September 3-6, 1996. Electronic Notes in Theoretical Computer Science, vol. 4, pp. 404-422. Elsevier, Amsterdam (1996), http://www.sciencedirect.com/science/journal/15710661
263. Pita, L, Martí-Oliet, N.: Using reflection to specify transaction sequences in rewriting logic. In: Fiadeiro, J.L. (ed.) WADT 1998. LNCS, vol. 1589, pp. 261-276. Springer, Heidelberg (1999)
264. Pita, I., Martí-Oliet, N.: A Maude specification of an object-oriented model for telecommunication networks. Theoretical Computer Science 285(2), 407-439 (2002)
265. Plotkin, G.D.: A structural approach to operational semantics. Journal of Logic and Algebraic Programming 60-61, 17-139 (2004)
266. Pollack, R.: Implicit syntax. In: Huet, G., Plotkin, G. (eds.) Proceedings of the First Workshop on Logical Frameworks (May 1990)
267. Pollack, R.: Closure under alpha-conversion. In: Barendregt, H., Nipkow, T. (eds.) TYPES 1993. LNCS, vol. 806, pp. 313-332. Springer, Heidelberg (1994)
268. Porter, D.: An interpreter for JLambda. A thesis submitted for the degree of BCompSci (Honours), University of New England (2004), http://mcs.une.edu.au/ ~iop/Data/Papers/dporter-honours-thesis.pdf
269. Pottier, L.: Minimal solutions of linear diophantine systems: bounds and algorithms. In: Book, R.V. (ed.) Rewriting Techniques and Applications. LNCS, vol. 488, pp. 162-173. Springer, Heidelberg (1991)
270. Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, Chichester (1994)
271. Quesada, J.F.: The SCP Parsing Algorithm Based on Syntactic Constraint Propagation. PhD thesis, Universidad de Sevilla, Spain (1997)
272. Quesada, J.F.: The Maude parser: Parsing and meta-parsing β-extended context-free grammars. Technical Report, SRI International, Computer Science Laboratory (1999)
273. Rabhi, F., Lapalme, G.: Algorithms. A Functional Programming Approach. Addison-Wesley, Reading (1999)
274. Reich, S.: Implementing and extending the MSR crypto-protocol specification language. Diplomarbeit. Universität Hamburg, Fachbereich Informatik (April 2006)
275. Reisig, W.: Petri Nets. Springer, Heidelberg (1985)
276. Rodriguez, D.E.: Case studies in the specification and analysis of protocols in Maude. In: Futatsugi, K. (ed.) Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000. Electronic Notes in Theoretical Computer Science, vol. 36, pp. 257-275. Elsevier, Amsterdam (2000), http://www.sciencedirect.com/ science/journal/15710661
277. Rosa-Velardo, F., Segura, C., Verdejo, A.: Typed mobile ambients in Maude. In: Cirstea, H., Martí-Oliet, N. (eds.) Proceedings 6th International Workshop on Rule-Based Programming, RULE 2005, Nara, Japan. Electronic Notes in Theoretical Computer Science, vol. 147, pp. 135-161. Elsevier, Amsterdam (2006), http://www.sciencedirect.com/science/journal/ 15710661
278. Roşu, G., Havelund, K.: Generating optimal monitors from temporal formulae. Technical report, Research Institute for Advanced Computer Science (2001)
279. Rosu, G., Venkatesan, R.P., Whittle, J., Leustean, L.: Certifying optimality of state estimation programs. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 301-314. Springer, Heidelberg (2003)
280. Rumbaugh, J., Jacobson, I., Booch, G.: The Unified Modeling Language Reference Manual, 2nd edn. Addison-Wesley, Reading (2004)
281. Sasse, R.: Taclets vs. rewriting logic - relating semantics of Java. Master's thesis, Fakultät für Informatik, Universität Karlsruhe, Germany, May 2005. Technical Report in Computing Science No. 2005-16 (2005), http://www. ubka.uni-karlsruhe.de/cgi-bin/psview?document-ira/2005/16
282. Sasse, R., Meseguer, J.: Java+ITP: A verification tool based on Hoare logic and algebraic semantics. In: Denker, G., Talcott, C (eds.) Proceedings Sixth International Workshop on Rewriting Logic and its Applications, WRLA 2006, Vienna, Austria, April 1-2, 2006. Electronic Notes in Theoretical Computer Science, pp. 202-222. Elsevier, Amsterdam (2007), http://www.sciencedirect.com/ science/journal/15710661
283. Sasse, R., Meseguer, J.: Java+ITP: A verification tool based on Hoare logic and algebraic semantics. Technical Report UIUCDCS-R-2006-2685, Department of Computer Science, University of Illinois at Urbana-Champaign, USA (February 2006)
284. Schmidt, K.: LoLA: Low Level Petri net Analyzer (2004), http ://www.informatik.hu-berlin.de/~kschmidt/lola.html
285. Segala, R.: Modelling and Verification of Randomized Distributed Real Time Systems. PhD thesis, Massachusetts Institute of Technology (1995)
286. Sen, K., Viswanathan, M., Agha, G.: On statistical model checking of stochastic systems. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 266-280. Springer, Heidelberg (2005)
287. Shklarsky, D.O., Chentzov, N.N., Yaglom, I.M.: The USSR Olympiad Problem Book. Dover (1993)
288. Siekmann, J., Szabó, P.: A Noetherian and confluent rewrite system for idem-potent semigroups, Semigroup Forum 25, 83-110 (1982)
289. Steggles, L., Kosiuczenko, P.: A timed rewriting logic semantics for SDL: a case study of the alternating bit protocol. In: Kirchner, C, Kirchner, H. (eds.) Proceedings Second International Workshop on Rewriting Logic and its Applications, WRLA'98, Pont-à-Mousson, France, September 1-4, 1998. Electronic Notes in Theoretical Computer Science, vol. 15, pp. 295-316. Elsevier, Amsterdam (1998), http://www.sciencedirect.com/science/journal/ 15710661
290. Steggles, L.J.: Rewriting logic and Elan: Prototyping tools for Petri nets with time. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 363-381. Springer, Heidelberg (2001)
291. Stehr, M.-O.: CINNI -A generic calculus of explicit substitutions and its application to λ-, ζ- and π-calculi. In: Futatsugi, K. (ed.) Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000. Electronic Notes in Theoretical Computer Science, vol. 36, pp. 71-92. Elsevier, Amsterdam (2000), http://www.sciencedirect.com/science/journal/15710661
292. Stehr, M.-O.: A rewriting semantics for algebraic nets. In: Girault, C., Valk, R. (eds.) Petri Nets for System Engineering - A Guide to Modelling, Verification, and Applications, pp. 318-338. Springer, Heidelberg (2001)
293. Stehr, M.-O.: Programming, Specification, and Interactive Theorem Proving - Towards a Unified Language based on Equational Logic, Rewriting Logic, and Type Theory. PhD thesis, Universität Hamburg, Fachbereich Informatik, Germany (2002), http://www.sub.uni-hamburg.de/disse/810/
294. Stehr, M.-O.: The open calculus of constructions (Part I): An equational type theory with dependent types for programming, specification, and interactive theorem proving. Fundamenta Informaticae 68(1-2), 131-174 (2005)
295. Stehr, M.-O.: The open calculus of constructions (Part II): An equational type theory with dependent types for programming, specification, and interactive theorem proving. Fundamenta Informaticae 68(3), 249-288 (2005)
296. Stehr, M.-O., Cervesato, I., Reich, S.: An execution environment for the MSR cryptoprotocol specification language (2004), http ://formal.cs.uiuc.edu/ stehr/msr.html
297. Stehr, M.-O., Meseguer, J.: Pure type systems in rewriting logic. In: Proceedings of LFM'99: Workshop on Logical Frameworks and Meta-languages, Paris, France, September 28 (1999), http://www.site.uottawa.ca/~afelty/LFM99/index. html
298. Stehr, M.-O., Meseguer, J.: Pure type systems in rewriting logic:
299. Stehr, M.-O., Meseguer, J., Ölveczky, P.C.: Rewriting logic as a unifying framework for Petri nets. In: Ehrig, H., Juhás, G., Padberg, J., Rozenberg, G. (eds.) Unifying Petri Nets. LNCS, vol. 2128, pp. 250-303. Springer, Heidelberg (2001)
300. Stehr, M.-O., Naumov, P., Meseguer, J.: A proof-theoretic approach to the HOL-Nuprl connection with applications to proof translation. In: Cerioli, M., Mosses, P.D., Reggio, G. (eds.) Preliminary Proceedings WADT/CoFI'01, 15th International Workshop on Algebraic Development Techniques and General Workshop of the CoFI WG (2001), http ://formal.cs.uiuc.edu/stehr/holnuprl-ext.ps.gz
301. Stehr, M.-O., Talcott, C.: PLAN in Maude: Specifying an active network programming language. In: Gadducci, F., Montanari, U. (eds.) Proceedings Fourth International Workshop on Rewriting Logic and its Applications, WRLA 2002, Pisa, Italy, September 19-21, 2002. Electronic Notes in Theoretical Computer Science, vol. 71, pp. 221-241. Elsevier, Amsterdam (2004), http ://www.sciencedirect. com/science/journal/15710661
302. Stehr, M.-O., Talcott, C.L.: Practical techniques for language design and prototyping. In: Luiz Fiadeiro, J., Montanari, U., Wirsing, M. (eds.) Foundations of Global Computing, number 05081 in Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum (IBFI), Schloss Dagstuhl, Germany (2006), http ://drops.dagstuhl.de/opus/volltexte/2006/300
303. Stewart, W.J.: Introduction to the Numerical Solution of Markov Chains. Princeton (1994)
304. Talcott, C.L.: An actor rewriting theory. In: Meseguer, J. (ed.) Proceedings First International Workshop on Rewriting Logic and its Applications, WRLA'96, Asilomar, California, September 3-6, 1996. Electronic Notes in Theoretical Computer Science, vol. 4, pp. 360-383. Elsevier, Amsterdam (1996), http://www.sciencedirect.com/science/journal/15710661
305. Talcott, C.L.: Composable semantic models for actor theories. In: Ito, T., Abadi, M. (eds.) TACS 1997. LNCS, vol. 1281, pp. 321-364. Springer, Heidelberg (1997)
306. Talcott, C.L.: Interaction semantics for components of distributed systems. In: Najm, E., Stefani, J.-B. (eds.) Proceedings IFIP Conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS'96, pp. 154-169. Chapman & Hall (1997)
307. Talcott, C.L.: Composable semantic models for actor theories. Higher-Order and Symbolic Computation 11(3), 281-343 (1998)
308. Talcott, C.L.: Towards a toolkit for actor system specification. In: Rus, T. (ed.) AMAST 2000. LNCS, vol. 1816, pp. 391-406. Springer, Heidelberg (2000)
309. Talcott, C.L.: Actor theories in rewriting logic. Theoretical Computer Science 285(2), 441-485 (2002)
310. Talcott, C.L., Dill, D.L.: The pathway logic assistant. In: Plotkin, G. (ed.) Third International Workshop on Computational Methods in Systems Biology, pp. 228-239 (2005)
311. Talcott, C.L., Eker, S., Knapp, M., Lincoln, P., Laderoute, K.: Pathway logic modeling of protein functional domains in signal transduction. In: Altman, R.B., Dunker, A.K., Hunter, L., Klein, T.E. (eds.) Proceedings of the 9th Pacific Symposium on Biocomputing (PSB 2004), Fairmont Orchid, Hawaii, USA, January 6-10, 2004, pp. 568-580 (2004), http ://helix-web.Stanford.edu/psb04/
312. Thati, P., Meseguer, J.: Complete symbolic reachability analysis using back-and-forth narrowing. In: Fiadeiro, J.L., Harman, N., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 379-394. Springer, Heidelberg (2005)
313. Thati, P., Sen, K., Martí-Oliet, N.: An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0. In: Gadducci, F., Montanari, U. (eds.) Proceedings Fourth International Workshop on Rewriting Logic and its Applications, WRLA 2002, Pisa, Italy, September 19-21, 2002. Electronic Notes in Theoretical Computer Science, vol. 71, pp. 242-262. Elsevier, Amsterdam (2004), http://www.sciencedirect.com/science/journal/ 15710661
314. The Open Group. The Single UNIX Specification Version 3 Homepage (2004), http://www.unix-systems.org
315. Thorvaldsen, S., Ölveczky, P.C.: Formal modeling and analysis of the OGDC wireless sensor network algorithm in Real-Time Maude (2005), http ://www.ifi.uio.no/RealTimeMaude/OGDC/
316. Tomás, A.P.: On Solving Linear Diophantine Constraints. PhD thesis, Universidade do Porto (1997)
317. Toval, A., Fernández, J.L.: Formally modeling UML and its evolution: A holistic approach. In: Smith, S.F., Talcott, C.L. (eds.) Proceedings IFIP Conference on Formal Methods for Open Object-Based Distributed Systems IV, FMOODS 2000, September 6-8, 2000, Stanford, California, USA, pp. 183-206. Kluwer Academic Publishers, Dordrecht (2000)
318. Toval, A., Fernández, J.L.: Improving system reliability via rigorous software modeling: The UML case. In: Proceedings IEEE Aerospace Conference, vol. 6, pp. 6-17. IEEE Computer Society Press, Los Alamitos (2001)
319. Verdejo, A.: Building tools for LOTOS symbolic semantics in Maude. In: Peled, D.A., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol. 2529, pp. 292-397. Springer, Heidelberg (2002)
320. Verdejo, A.: Maude como Marco Semántico Ejecutable. PhD thesis, Universidad Complutense de Madrid, Spain (2003)
321. Verdejo, A., Martí-Oliet, N.: Executing and verifying CCS in Maude. Technical Report 99-00, Departamento de Sistemas Informáticos y Programación, Universidad Complutense de Madrid (February 2000), http://maude.csl.sri.com/casestudies/ccs
322. Verdejo, A., Martí-Oliet, N.: Executing E-LOTOS processes in Maude. In: Ehrig, H., Grosse-Rhode, M., Orejas, F. (eds.) INT 2000, Integration of Specification Techniques with Applications in Engineering, Extended Abstracts, pp. 49-53. Technical report 2000/04, Technische Universität Berlin (2000)
323. Verdejo, A., Martí-Oliet, N.: Implementing CCS in Maude. In: Bolognesi, T., Latella, D. (eds.) Formal Methods For Distributed System Development. FORTE/PSTV 2000 IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX) October 10-13, 2000, Pisa, Italy. International Federation for Information Processing, vol. 183, pp. 351-366. Kluwer Academic Publishers, Dordrecht (2000)
324. Verdejo, A., Martí-Oliet, N.: Implementing CCS in Maude 2. In: Gadducci, F., Montanari, U. (eds.) Proceedings Fourth International Workshop on Rewriting Logic and its Applications, WRLA 2002, Pisa, Italy, September 19-21, 2002. Electronic Notes in Theoretical Computer Science, vol. 71, pp. 263-281. Elsevier, Amsterdam (2004), http ://www.sciencedirect.com/science/journal/ 15710661
325. Verdejo, A., Martí-Oliet, N.: Two case studies of semantics execution in Maude: CCS and LOTOS. Formal Methods in System Design 27, 113-172 (2005)
326. Verdejo, A., Martí-Oliet, N.: Executable structural operational semantics in Maude. Journal of Logic and Algebraic Programming 67(1-2), 226-293 (2006)
327. Verdejo, A., Pita, I., Martí-Oliet, N.: The leader election protocol of IEEE 1394 in Maude. In: Futatsugi, K. (ed.) Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000. Electronic Notes in Theoretical Computer Science, vol. 36, pp. 385-406. Elsevier, Amsterdam (2000), http://www. sciencedirect.com/science/journal/15710661
328. Viry, P.: Rewriting: An effective model of concurrency. In: Halatsis, C., Philokyprou, G., Maritsas, D., Theodoridis, S. (eds.) PARLE 1994. LNCS, vol. 817, pp. 648-660. Springer, Heidelberg (1994)
329. Viry, P.: Input/output for ELAN. In: Meseguer, J. (ed.) Proceedings First International Workshop on Rewriting Logic and its Applications, WRLA'96, Asilomar, California, September 3-6, 1996. Electronic Notes in Theoretical Computer Science, vol. 4, pp. 51-64. Elsevier, Amsterdam (1996), http://www.sciencedirect.com/science/journal/15710661
330. Viry, P.: Adventures in sequent calculus modulo equations. In: Kirchner, C., Kirchner, H. (eds.) Proceedings Second International Workshop on Rewriting Logic and its Applications, WRLA'98, Pont-àMousson, France, September 1-4, 1998. Electronic Notes in Theoretical Computer Science, vol. 15, pp. 367-378. Elsevier, Amsterdam (1998), http ://www.sciencedirect.com/science/ journal/15710661
331. Viry, P.: Equational rules for rewriting logic. Theoretical Computer Science 285(2), 487-517 (2002)
332. Vittek, M.: ELAN: Un Cadre Logique pour le Prototypage de Langages de Programmation avec Contraintes. PhD thesis, Université Henri Poincaré - Nancy I (November 1994)
333. Wang, B.-Y., Meseguer, J., Gunter, C.A.: Specification and formal analysis of a PLAN algorithm in Maude. In: Hsiung, P.-A. (ed.) Proceedings International Workshop on Distributed System Validation and Verification, Taipei, Taiwan, April 2000, pp. 49-56 (2000)
334. Warmer, J., Kleppe, A.: The Object Constraint Language: Getting Your Models Ready for MDA, 2nd edn. Addison-Wesley, Reading (2003)
335. Weiss, M.A.: Data Structures and Problem Solving Using Java. Addison-Wesley, Reading (1998)
336. Wirsing, M., Knapp, A.: A formal approach to object-oriented software engineering. In: Meseguer, J. (ed.) Proceedings First International Workshop on Rewriting Logic and its Applications, WRLA'96, Asilomar, California, September 3-6, 1996. Electronic Notes in Theoretical Computer Science, vol. 4, pp. 321-359. Elsevier, Amsterdam (1996), http ://www.sciencedirect.com/science/ journal/15710661
337. Wirsing, M., Knapp, A.: A formal approach to object-oriented software engineering. Theoretical Computer Science 285(2), 519-560 (2002)
338. Zhang, H., Kapur, D., Krishnamoorthy, M.S.: A mechanizable induction principle for equational specifications. In: Lusk, E., Overbeek, R. (eds.) CADE 1988. LNCS, vol. 310, pp. 162-181. Springer, Heidelberg (1988)