All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic | Guide books

All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logicJanuary 2007

Authors:
Manuel Clavel
Universidad Complutense de Madrid, Departamento de Sistemas Informáticos y Computación, Madrid, Spain
,
Francisco Durán
Universidad de Málaga, Departamento de Lenguajes y Ciencias de la Computación, Málaga, Spain
,
Steven Eker
SRI International, Computer Science Laboratory, Menlo Park, CA
,
Patrick Lincoln
SRI International, Computer Science Laboratory, Menlo Park, CA
,
Narciso Martí-Oliet
Universidad Complutense de Madrid, Departamento de Sistemas Informáticos y Computación, Madrid, Spain
,
José Meseguer
University of Illinois at Urbana-Champaign, Department of Computer Science, Urbana, IL
,
Carolyn Talcott
SRI International, Computer Science Laboratory, Menlo Park, CA

Publisher:

Springer-Verlag
Berlin, Heidelberg

ISBN:978-3-540-71940-3

Published:01 January 2007

Pages:

756

Available at Amazon

Bibliometrics

Sections

2007

Abstract

No abstract available.

References

Agha, G.: Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge (1986) Google Scholar
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.pdfGoogle Scholar
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 Google Scholar
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)Google Scholar
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)Google Scholar
Albarrán, A., Durán, 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)Google Scholar
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)Google Scholar
lbarrá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 2001Google Scholar
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)Google Scholar
Baker, H. G., Hewitt, C.: Laws for communicating parallel processes. In: Proceedings of the 1977 IFIP Congress, pp. 987-992. IFIP Press (1977)Google Scholar
Ball, W. W. R., Coxeter, H. S. M.: Mathematical Recreations and Essays. Dover (1987)Google Scholar
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.htmlGoogle Scholar
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)Google Scholar
Basin, D., Clavel, M., Meseguer, J.: Reflective metalogical frameworks. ACM Transactions on Computational Logic 5(3), 528-576 (2004) Google ScholarDigital Library
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/15710661Google Scholar
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) Google Scholar
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)Google ScholarCross Ref
Blaha, M., Rumbaugh, J.: Object-oriented modeling and design with UML, 2nd edn. Prentice-Hall, Englewood Cliffs (2005)Google Scholar
Boehm, H.-J., Atkinson, R. R., Plass, M. F.: Ropes: An alternative to strings. Software Practice and Experience 25(12), 1315-1330 (1995) Google ScholarDigital Library
Bogomolny, A.: Interactive mathematics miscellany and puzzles, http://www.cut-the-knot.org/games.shtml.Google Scholar
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)Google Scholar
Borovansky, P., Kirchner, C., Kirchner, H., Moreau, P.-E.: ELAN from a rewriting logic point of view. Theoretical Computer Science 285(2), 155-185 (2002) Google ScholarDigital Library
Bouhoula, A., Jouannaud, J.-P., Meseguer, J.: Specification and proof in membership equational logic. Theoretical Computer Science 236, 35-132 (2000) Google ScholarDigital Library
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)Google Scholar
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)Google ScholarDigital Library
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 Google Scholar
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.gzGoogle Scholar
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)Google Scholar
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)Google Scholar
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/15710661Google Scholar
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 Informatica, Università di Pisa, http://www.di.unipi.it/~bruni/publications/techrep98.ps.gz Google Scholar
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) Google Scholar
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) Google ScholarDigital Library
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) Google Scholar
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) Google Scholar
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/15710661Google Scholar
Carrano, F. M., Prichard, J. J.: Data Abstraction and Problem Solving with C++, 3rd edn. Addison-Wesley, Reading (2002)Google Scholar
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)Google Scholar
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)Google Scholar
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)Google Scholar
Cervesato, I., Durgin, N., Lincoln, P. D., Mitchell, J. C., Scedrov, A.: A meta-notation 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) Google ScholarCross Ref
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 Google Scholar
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) Google ScholarDigital Library
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.Google Scholar
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_semanticsGoogle Scholar
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/15710661Google Scholar
Chen, F., Rosu, 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)Google ScholarDigital Library
Cirstea, H.: Calcul de Réécriture: Fondements et Applications. PhD thesis, Université Henri Poincaré - Nancy I (2000)Google Scholar
Cirstea, H., Kirchner, C.: Combining higher-order and first-order computations using ρ-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)Google Scholar
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/15710661Google Scholar
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)Google Scholar
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)Google Scholar
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)Google Scholar
Clarke, E. M., Grumberg, O., Peled, D. A.: Model Checking. MIT Press, Cambridge (1999) Google Scholar
Clavel, M.: Reflection in General Logics and in Rewriting Logic, with Applications to the Maude Language. PhD thesis, Universidad de Navarra, Spain (February 1998)Google Scholar
Clavel, M.: Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications. CSLI Publications (2000) Google Scholar
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/maude1/manual/Google Scholar
Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J. F.: A tutorial on Maude. SRI International (March 2000), http://maude.cs.uiuc.edu/maude1/tutorial/Google Scholar
Clavel, M., Durán, 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/15710661Google Scholar
Clavel, M., Durán, 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) Google ScholarDigital Library
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.cs.uiuc.edu/papers/Google Scholar
Clavel, M., Durán, 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.cs.uiuc.edu/papers/Google Scholar
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/Google Scholar
Clavel, M., Durán, 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)Google Scholar
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)Google Scholar
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 Google Scholar
Clavel, M., Meseguer, J.: Reflection in conditional rewriting logic. Theoretical Computer Science 285(2), 245-288 (2002) Google ScholarDigital Library
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)Google Scholar
Clavel, M., Palomino, M., Riesco, A.: Introducing the ITP tool: a tutorial. Journal of Universal Computer Science 12(11), 1618-1650 (2006)Google Scholar
Clavel, M., Palomino, M., Santa-Cruz, J.: Integrating decision procedures in reflective rewriting-based theorem provers. In: Antoy, S., Toyama, Y. (eds.) Proceedings 4th InternationalWorkshop 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.pdfGoogle Scholar
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)Google Scholar
Contejean, E., Devie, H.: An efficient incremental algorithm for solving systems of linear diophantine equations. Information and Computation 113(1), 143-172 (1994) Google ScholarDigital Library
Coquand, T., Huet, G.: The calculus of constructions. Information and Computation 76(2/3), 95-120 (1988) Google ScholarDigital Library
d'Amorim, M., Rosu, G.: An equational specification for the Scheme language. Journal of Universal Computer Science 11(7), 1327-1348 (2005)Google Scholar
Degano, P., Gadducci, F., Priami, C.: A causal semantics for CCS via rewriting logic. Theoretical Computer Science 275(1-2), 271-304 (2002) Google ScholarDigital Library
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)Google Scholar
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)Google Scholar
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)Google Scholar
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)Google Scholar
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)Google Scholar
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.htmlGoogle Scholar
Denker, G., Millen, J.: CAPSL intermediate language. In: Heintze, N., Clarke, E. (eds.) Proceedings ofWorkshop on Formal Methods and Security Protocols, FMSP'99, July 1999, Trento, Italy (1999)Google Scholar
Denker, G., Millen, J.: CAPSL integrated protocol environment. 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. 207-222. IEEE Computer Society Press, Los Alamitos (2000)Google Scholar
Denker, G., Millen, J.: The CAPSL integrated protocol environment. Computer Science Laboratory, SRI International. Technical Report SRI-CSL-2000- 02 (2000)Google Scholar
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/15710661Google Scholar
Denker, G., Talcott, C. L.: Formal checklists for remote agent dependability. In: Martí-Oliet, N. (ed.) Proceedings Fifth InternationalWorkshop 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 Google Scholar
Denker, G., Talcott, C. L.: A formal framework for goal net analysis. In:Workshop on Verification and Validation of Planning Systems, AAAI (2005)Google Scholar
Deplagne, E.: Sequent calculus viewed modulo. In: Pilièere, C. (ed.) Proceedings of the Fifth ESSLLI Student Session, pp. 66-76 (2000)Google Scholar
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) Google Scholar
van Deursen, A.: Executable Language Definitions. PhD thesis, University of Amsterdam (1994)Google Scholar
van Deursen, A., Heering, J., Klint, P. (eds.): Language Prototyping: An Algebraic Specification Approach. World Scientific (1996) Google Scholar
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)Google Scholar
Dowek, G., Hardin, T., Kirchner, C.: Higher order unification via explicit substitutions. Information and Computation 157(1/2), 183-235 (2000) Google ScholarDigital Library
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) Google ScholarDigital Library
Dowek, G., Hardin, T., Kirchner, C.: Theorem proving modulo. Journal of Automated Reasoning 31(1), 33-72 (2003) Google ScholarCross Ref
Durán, F.: Coherence checker and completion tools for Maude specifications. Manuscript, Computer Science Laboratory, SRI International (2000), http://www.lcc.uma.es/~duran/ChC/Google Scholar
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/Google Scholar
Durán, F.: A Reflective Module Algebra with Applications to the Maude Language. PhD thesis, University of Málaga, Spain (1999), http://maude.cs.uiuc.edu/papers/Google Scholar
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)Google ScholarDigital Library
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) Google Scholar
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)Google Scholar
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 Google Scholar
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/15710661Google Scholar
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) Google Scholar
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) Google Scholar
Durán, F., Meseguer, J.: A Church-Rosser checker tool for Maude equational specifications. Manuscript, Computer Science Laboratory, SRI International (2000), http://www.lcc.uma.es/~duran/CRC/Google Scholar
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 1-4, 1998. Electronic Notes in Theoretical Computer Science, vol. 15, pp. 174-195. Elsevier, Amsterdam (1998), http://www.sciencedirect.com/science/journal/15710661Google Scholar
Durán, F., Meseguer, J.: The Maude specification of Full Maude. Technical report, Computer Science Laboratory, SRI International (Feb. 1999), http://maude.cs.uiuc.edu/papers/Google Scholar
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/15710661Google Scholar
Durán, F., Meseguer, J.: Structured theories and institutions. Theoretical Computer Science 309(1-3), 357-380 (2003) Google ScholarDigital Library
Durán, F., Meseguer, J.: Maude's module algebra. Science of Computer Programming 66(2), 125-153 (2007) Google ScholarDigital Library
Durán, F., Roldán, M., Vallecillo, A.: Using Maude to write and execute ODP information viewpoint specifications. Computer Standards and Interfaces 27(6), 597-620 (2005) Google ScholarDigital Library
Durán, F., Vallecillo, A.: Formalizing ODP enterprise specifications in Maude. Computer Standards and Interfaces 25(2), 83-102 (2003) Google ScholarDigital Library
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.com/science/journal/15710661Google Scholar
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.pdfGoogle Scholar
Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 1, Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science, vol. 6. Springer, Heidelberg (1985)Google ScholarCross Ref
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/15710661Google Scholar
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/15710661Google Scholar
Eker, S.: Associative-commutative rewriting on large terms. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 14-29. Springer, Heidelberg (2003)Google Scholar
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/15710661Google Scholar
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/15710661Google Scholar
Enderton, H. B.: A Mathematical Introduction to Logic, 2nd edn. Academic Press, London (2000)Google Scholar
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) Google ScholarDigital Library
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 Google Scholar
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) Google ScholarDigital Library
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)Google Scholar
Farzan, A., Cheng, F., Meseguer, J., Rosu, 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)Google Scholar
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 Google Scholar
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)Google Scholar
Farzan, A., Meseguer, J., Rosu, 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)Google Scholar
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) Google Scholar
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) Google Scholar
Ferrari, G., Montanari, U.: Tile formats for located and mobile systems. Information and Computation 156(1/2), 173-235 (2000) Google ScholarDigital Library
Fischer, B., Rosu, G.: Interpreting abstract interpretations in membership equational logic. Technical report, Research Institute for Advanced Computer Science. Technical Report RIACS 01.16 (2001)Google Scholar
Fomin, D., Genkin, S., Itenberg, I.: Mathematical Circles: The Russian Experience. Mathematical World, vol. 7. American Mathematical Association (1996)Google Scholar
Frühwirth, T., Abdennadher, S.: Essentials of Constraint Programming. Springer, Heidelberg (2003) Google Scholar
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/15710661Google Scholar
Futatsugi, K., Diaconescu, R.: CafeOBJ Report. AMAST Series. World Scientific (1998)Google Scholar
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/15710661Google Scholar
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) Google Scholar
Gadducci, F., Montanari, U.: Comparing logics for rewriting: Rewriting logic, action calculi and tile logic. Theoretical Computer Science 285(2), 319-358 (2002) Google ScholarDigital Library
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/15710661Google Scholar
Genesereth, M. R., Nilsson, N. J.: Logical Foundations of Artificial Intelligence. Morgan Kaufmann, San Francisco (1987) Google Scholar
Glynn, P.: On the role of generalized semi-Markov processes in simulation output analysis. In: Proceedings of the 1983 Winter Simulation Conference, pp. 38-42 (1983) Google Scholar
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) Google ScholarDigital Library
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)Google Scholar
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) Google Scholar
Goodloe, A., Gunter, C. A., 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) Google ScholarDigital Library
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)Google Scholar
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) Google ScholarDigital Library
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)Google Scholar
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)Google Scholar
Havelund, K., Rosu, 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)Google Scholar
Havelund, K., Rosu, G.: Monitoring Java programs with Java PathExplorer. In: Havelund, K., Rosu, G. (eds.) Proceedings First Workshop on Runtime Verification, RV'2001, 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/15710661Google Scholar
Havelund, K., Rosu, G.: Monitoring programs using rewriting. Technical report, Research Institute for Advanced Computer Science (2001)Google Scholar
Havelund, K., Rosu, G.: Testing linear temporal logic formulae on finite execution traces. Technical Report RIACS 01.08, Research Institute for Advanced Computer Science (May 2001) Google ScholarDigital Library
ayes, 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)Google Scholar
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)Google Scholar
Hendrix, J., Meseguer, J.: On the completeness of context-sensitive order-sorted specifications. Technical Report UIUCDCS-R-2007-2812, Computer Science Dept., University of Illinois at Urbana-Champaign (Feb. 2007)Google Scholar
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)Google Scholar
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.cs.uiuc.edu/tools/scc/Google Scholar
Hendrix, J., Ohsaki, H., Viswanathan, M.: Propositional tree automata. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 50-65. Springer, Heidelberg (2006)Google Scholar
Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery 32(1), 137-172 (1985) Google ScholarDigital Library
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)Google Scholar
Horowitz, E., Sahni, S.: Fundamentals of Data Structures in Pascal. Fourth Edition. Computer Science Press (1994)Google Scholar
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)Google Scholar
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)Google Scholar
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 Google Scholar
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)Google ScholarCross Ref
Kapur, D., Zhang, H.: An overview of rewrite rule laboratory (RRL). J. Computer and Mathematics with Applications 29(2), 91-114 (1995)Google ScholarCross Ref
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)Google Scholar
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/15710661Google Scholar
Kaufmann, M., Manolios, P., Moore, J. S.: Computer-Aided Reasoning: An Approach. Kluwer Academic Publishers, Dordrecht (2000) Google Scholar
Kernighan, B. W., Ritchie, D. M.: The C Programming Language, 2nd edn. Prentice-Hall, Englewood Cliffs (1988) Google Scholar
Kirchner, C.: Order-sorted equational unification. Technical Report 954, INRIA Lorraine & LORIA, Nancy, France (Dec. 1988)Google Scholar
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/15710661Google Scholar
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)Google Scholar
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)Google Scholar
Kolch, W.: Meaningful relationships: The regulation of the Ras/ Raf/ MEK/ ERK pathway by protein interactions. Biochemical Journal 351, 289-305 (2000)Google ScholarCross Ref
Kosiuczenko, P., Wirsing, M.: Timed rewriting logic with application to object-oriented specification. Technical report, Institut für Informatik, Universität München (1995)Google Scholar
Kotz, D., Gray, R.: Mobile agents and the future of the internet. ACM Operating Systems Review 33(3), 7-13 (1999) Google ScholarDigital Library
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)Google Scholar
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)Google Scholar
Laneve, C., Montanari, U.: Axiomatizing permutation equivalence in the λ-calculus. In: Kirchner, H., Levi, G. (eds.) Algebraic and Logic Programming. LNCS, vol. 632, pp. 350-363. Springer, Heidelberg (1992) Google Scholar
Laneve, C., Montanari, U.: Axiomatizing permutation equivalence. Mathematical Structures in Computer Science 6, 219-249 (1996)Google ScholarCross Ref
Lange, D., Oshima, M.: Seven good reasons for mobile agents. Communications of the ACM 42, 88-89 (1999) Google ScholarDigital Library
Lescanne, P.: From λσ to λv, 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) Google Scholar
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/15710661Google Scholar
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.9Google Scholar
Lucas, S.: Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming 1(4), 446-453 (1998)Google Scholar
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)Google Scholar
Lucas, S.: Context-sensitive rewriting strategies. Information and Computation 178(1), 294-343 (2002) Google ScholarDigital Library
Luo, Z.: Computation and Reasoning: A Type Theory for Computer Science. International Series of Monographs on Computer Science. Oxford University Press, Oxford (1994) Google Scholar
Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems - Specification. Springer, Heidelberg (1992) Google Scholar
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/15710661Google Scholar
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) Google Scholar
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)Google Scholar
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)Google Scholar
Martí-Oliet, N., Meseguer, J.: Rewriting logic: roadmap and bibliography. Theoretical Computer Science 285(2), 121-154 (2002) Google ScholarDigital Library
Martí-Oliet, N., Meseguer, J., Palomino, M.: Algebraic simulations (Submitted for publication, 2007), http://maude.sip.ucm.es/~miguelpt/bibliographyGoogle Scholar
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)Google Scholar
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 Google Scholar
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 Google Scholar
Martin-Löf, P.: Intuitionistic Type Theory. Bibliopolis (1984)Google Scholar
Mason, I. A., Talcott, C. L.: 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) Google Scholar
Mason, I. A., Talcott, C. L.: Actor languages: Their syntax, semantics, translation, and equivalence. Theoretical Computer Science 228(1) (1999)Google Scholar
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/15710661Google Scholar
Mason, I. A., Talcott, C. L.: IOP: The InterOperability Platform & IMaude: An interactive extension of 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. 315-333. Elsevier, Amsterdam (2005), http://www.sciencedirect.com/science/journal/15710661 Google Scholar
Mason, I. A., Talcott, C. L.: The InterOperability Platform Manual (2006), http://mcs.une.edu.au/~iop/Data/Manual/manual.pdfGoogle Scholar
Meadows, C.: The NRL protocol analyzer: An overview. Journal of Logic Programming 26(2), 113-131 (1996)Google ScholarCross Ref
Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96(1), 73-155 (1992) Google ScholarDigital Library
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) Google Scholar
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/15710661Google Scholar
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) Google ScholarDigital Library
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) Google Scholar
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)Google Scholar
Meseguer, J.: A rewriting logic sampler. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 1-28. Springer, Heidelberg (2005)Google Scholar
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)Google Scholar
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)Google Scholar
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) Google Scholar
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) Google Scholar
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)Google Scholar
Meseguer, J., Rosu, 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)Google Scholar
Meseguer, J., Rosu, 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 Google Scholar
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)Google Scholar
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.gzGoogle Scholar
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) Google ScholarDigital Library
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.htmlGoogle Scholar
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)Google Scholar
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 Google Scholar
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) Google ScholarDigital Library
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989) Google Scholar
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/15710661Google Scholar
Mosses, P. D.: Logical specification of operational semantics. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 32-49. Springer, Heidelberg (1999)Google Scholar
Mosses, P. D.: Modular structural operational semantics. Journal of Logic and Algebraic Programming 60-61, 195-228 (2004)Google ScholarDigital Library
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)Google Scholar
Najm, E., Stefani, J.-B.: A formal semantics for the ODP computational model. Computer Networks and ISDN Systems 27, 1305-1329 (1995) Google ScholarDigital Library
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) Google Scholar
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)Google Scholar
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) Google ScholarDigital Library
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)Google Scholar
Object Management Group: Object Constraint Language specification (2004), http://www.omg.org/technology/documents/modeling spec catalog. htm#OCLGoogle Scholar
Object Management Group: Unified Modeling Language specification (2004), http://www.omg.org/technology/documents/modeling spec catalog. htm#UMLGoogle Scholar
Object Management Group: Mof 2.0 query/views/transformations final adopted specification (2005), http://www.omg.org/technology/documents/ modeling spec catalog.htm#MOF_ QVTGoogle Scholar
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)Google ScholarDigital Library
Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1998) Google Scholar
Ölveczky, P. C.: Specification and Analysis of Real-Time and Hybrid Systems in Rewriting Logic. PhD thesis, University of Bergen, Norway (2000), http://maude.cs.uiuc.edu/papers/Google Scholar
Ölveczky, 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)Google Scholar
Ö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) Google Scholar
Ölveczky, P. C., Kosiuczenko, P., Wirsing, M.: An object-oriented algebraic steam-boiler control specification. In: Abrial, J.-R., Börger, E., Langmaack, H. (eds.) Formal Methods for Industrial Applications. LNCS, vol. 1165, pp. 379-402. Springer, Heidelberg (1996) Google Scholar
Ö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://www.sciencedirect.com/science/journal/15710661Google Scholar
Ölveczky, P. C., Meseguer, J.: Specification of real-time and hybrid systems in rewriting logic. Theoretical Computer Science 285(2), 359-405 (2002) Google ScholarDigital Library
Ö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)Google Scholar
Ö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 Google Scholar
Ölveczky, P. C., Meseguer, J.: Semantics and pragmatics of Real-Time Maude. Higher-Order and Symbolic Computation 20(1-2), 161-196 (2007) Google ScholarDigital Library
Ö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) Google ScholarDigital Library
Ö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)Google ScholarCross Ref
Palomino, M.: Reflexión, Abstracción y Simulación en la Lógica de Reescritura. PhD thesis, Universidad Complutense de Madrid, Spain (March 2005)Google Scholar
Palomino, M., Martí-Oliet, N., Verdejo, A.: Playing with Maude. In: Abdennadher, S., Ringeissen, C. (eds.) Proceedings Fifth InternationalWorkshop 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/15710661Google Scholar
Peña, R.: Diseñno de Programas. Formalismo y Abstracción. Tercera Edición. Prentice-Hall, Madrid (2005)Google Scholar
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) Google Scholar
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/15710661Google Scholar
Pita, I., 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)Google Scholar
Pita, I., Martí-Oliet, N.: A Maude specification of an object-oriented model for telecommunication networks. Theoretical Computer Science 285(2), 407-439 (2002) Google ScholarDigital Library
Plotkin, G. D.: A structural approach to operational semantics. Journal of Logic and Algebraic Programming 60-61, 17-139 (2004)Google ScholarCross Ref
Pollack, R.: Implicit syntax. In: Huet, G., Plotkin, G. (eds.) Proceedings of the First Workshop on Logical Frameworks (May 1990)Google Scholar
Pollack, R.: Closure under alpha-conversion. In: Barendregt, H., Nipkow, T. (eds.) TYPES 1993. LNCS, vol. 806, pp. 313-332. Springer, Heidelberg (1994) Google ScholarDigital Library
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.pdfGoogle Scholar
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) Google ScholarDigital Library
Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, Chichester (1994) Google Scholar
Quesada, J. F.: The SCP Parsing Algorithm Based on Syntactic Constraint Propagation. PhD thesis, Universidad de Sevilla, Spain (1997)Google Scholar
Quesada, J. F.: The Maude parser: Parsing and meta-parsing β-extended context-free grammars. Technical Report, SRI International, Computer Science Laboratory (1999)Google Scholar
Rabhi, F., Lapalme, G.: Algorithms. A Functional Programming Approach. Addison-Wesley, Reading (1999) Google Scholar
Reich, S.: Implementing and extending the MSR crypto-protocol specification language. Diplomarbeit. Universität Hamburg, Fachbereich Informatik (April 2006)Google Scholar
Reisig, W.: Petri Nets. Springer, Heidelberg (1985)Google Scholar
Rodríguez, 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/15710661Google Scholar
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 Google Scholar
Rosu, G., Havelund, K.: Generating optimal monitors from temporal formulae. Technical report, Research Institute for Advanced Computer Science (2001)Google Scholar
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)Google Scholar
Rumbaugh, J., Jacobson, I., Booch, G.: The Unified Modeling Language Reference Manual, 2nd edn. Addison-Wesley, Reading (2004)Google Scholar
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/16Google Scholar
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 Google Scholar
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)Google Scholar
Schmidt, K.: LoLA: Low Level Petri net Analyzer (2004), http://www.informatik.hu-berlin.de/~kschmidt/lola.htmlGoogle Scholar
Segala, R.: Modelling and Verification of Randomized Distributed Real Time Systems. PhD thesis, Massachusetts Institute of Technology (1995) Google Scholar
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)Google Scholar
Shklarsky, D. O., Chentzov, N. N., Yaglom, I. M.: The USSR Olympiad Problem Book. Dover (1993)Google Scholar
Siekmann, J., Szabó, P.: A Noetherian and confluent rewrite system for idempotent semigroups. Semigroup Forum 25, 83-110 (1982)Google ScholarCross Ref
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/15710661Google Scholar
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)Google Scholar
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/15710661Google Scholar
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)Google Scholar
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/Google Scholar
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) Google ScholarDigital Library
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) Google ScholarDigital Library
Stehr, M.-O., Cervesato, I., Reich, S.: An execution environment for the MSR cryptoprotocol specification language (2004), http://formal.cs.uiuc.edu/stehr/msr.htmlGoogle Scholar
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.htmlGoogle Scholar
Stehr, M.-O., Meseguer, J.: Pure type systems in rewriting logic: Specifying typed higher-order languages in a first-order logical framework. In: Owe, O., Krogdahl, S., Lyche, T. (eds.) From Object-Orientation to Formal Methods. LNCS, vol. 2635, pp. 334-375. Springer, Heidelberg (2004)Google Scholar
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) Google Scholar
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.gzGoogle Scholar
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/15710661Google Scholar
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/300Google Scholar
Stewart, W. J.: Introduction to the Numerical Solution of Markov Chains. Princeton (1994)Google Scholar
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/15710661Google Scholar
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) Google Scholar
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)Google Scholar
Talcott, C. L.: Composable semantic models for actor theories. Higher-Order and Symbolic Computation 11(3), 281-343 (1998) Google ScholarCross Ref
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)Google Scholar
Talcott, C. L.: Actor theories in rewriting logic. Theoretical Computer Science 285(2), 441-485 (2002) Google ScholarDigital Library
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)Google Scholar
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/Google Scholar
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)Google Scholar
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/15710661Google Scholar
The Open Group. The Single UNIX Specification Version 3 Homepage (2004), http://www.unix-systems.orgGoogle Scholar
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/Google Scholar
Tomás, A. P.: On Solving Linear Diophantine Constraints. PhD thesis, Universidade do Porto (1997)Google Scholar
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) Google Scholar
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)Google ScholarCross Ref
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) Google Scholar
Verdejo, A.: Maude como Marco Semántico Ejecutable. PhD thesis, Universidad Complutense de Madrid, Spain (2003)Google Scholar
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/ccsGoogle Scholar
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)Google Scholar
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) Google Scholar
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/15710661Google Scholar
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) Google ScholarDigital Library
Verdejo, A., Martí-Oliet, N.: Executable structural operational semantics in Maude. Journal of Logic and Algebraic Programming 67(1-2), 226-293 (2006)Google ScholarCross Ref
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/15710661Google Scholar
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) Google Scholar
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/15710661Google Scholar
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/15710661Google Scholar
Viry, P.: Equational rules for rewriting logic. Theoretical Computer Science 285(2), 487-517 (2002) Google ScholarDigital Library
Vittek, M.: ELAN: Un Cadre Logique pour le Prototypage de Langages de Programmation avec Contraintes. PhD thesis, Université Henri Poincaré - Nancy I (November 1994)Google Scholar
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)Google Scholar
Warmer, J., Kleppe, A.: The Object Constraint Language: Getting Your Models Ready for MDA, 2nd edn. Addison-Wesley, Reading (2003) Google Scholar
Weiss, M. A.: Data Structures and Problem Solving Using Java. Addison-Wesley, Reading (1998) Google Scholar
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/15710661Google Scholar
Wirsing, M., Knapp, A.: A formal approach to object-oriented software engineering. Theoretical Computer Science 285(2), 519-560 (2002) Google ScholarDigital Library
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) Google Scholar

Cited By

Contributors

Manuel Clavel
Eastern International University
- Publication Years1999 - 2023
- Publication counts32
- Citation count860
- Available for Download5
- Downloads (cumulative)1,772
- Downloads (12 months)68
- Downloads (6 weeks)18
- Average Downloads per Article354
- Average Citation per Article27
View Full Profile
Francisco Durán
University of Malaga
- Publication Years1999 - 2024
- Publication counts70
- Citation count859
- Available for Download7
- Downloads (cumulative)1,369
- Downloads (12 months)384
- Downloads (6 weeks)80
- Average Downloads per Article196
- Average Citation per Article12
View Full Profile
Steven Eker
SRI International
- Publication Years1994 - 2024
- Publication counts23
- Citation count668
- Available for Download1
- Downloads (cumulative)231
- Downloads (12 months)193
- Downloads (6 weeks)32
- Average Downloads per Article231
- Average Citation per Article29
View Full Profile
Patrick Lincoln
SRI International
- Publication Years1988 - 2016
- Publication counts66
- Citation count1,899
- Available for Download14
- Downloads (cumulative)24,386
- Downloads (12 months)1,224
- Downloads (6 weeks)255
- Average Downloads per Article1,742
- Average Citation per Article29
View Full Profile
Narciso Martí-Oliet
Complutense University of Madrid
- Publication Years1989 - 2024
- Publication counts56
- Citation count805
- Available for Download3
- Downloads (cumulative)341
- Downloads (12 months)242
- Downloads (6 weeks)43
- Average Downloads per Article114
- Average Citation per Article14
View Full Profile
José Meseguer
University of Illinois Urbana-Champaign
- Publication Years1981 - 2024
- Publication counts262
- Citation count4,151
- Available for Download39
- Downloads (cumulative)9,363
- Downloads (12 months)2,002
- Downloads (6 weeks)364
- Average Downloads per Article240
- Average Citation per Article16
View Full Profile
Carolyn L Talcott
SRI International
- Publication Years1981 - 2024
- Publication counts158
- Citation count1,106
- Available for Download20
- Downloads (cumulative)5,544
- Downloads (12 months)456
- Downloads (6 weeks)108
- Average Downloads per Article277
- Average Citation per Article7
View Full Profile

Comments

Recommendations

Web Services and Interoperability for the Maude Termination Tool

This paper presents the Maude Termination Tool (MTT) version 1.5. MTT takes Maude programs as inputs and tries to prove them terminating by applying different transformation techniques and by using existing termination tools as back-ends. MTT can use as ...
Unification and Narrowing in Maude 2.4
RTA '09: Proceedings of the 20th International Conference on Rewriting Techniques and Applications

Maude is a high-performance reflective language and system supporting both equational and rewriting logic specification and programming for a wide range of applications, and has a relatively large worldwide user and open-source developer base. This ...
The linear temporal logic of rewriting Maude model checker
WRLA'10: Proceedings of the 8th international conference on Rewriting logic and its applications

This paper presents the foundation, design, and implementation of the Linear Temporal Logic of Rewriting model checker as an extension of the Maude system. The Linear Temporal Logic of Rewriting (LTLR) extends linear temporal logic with spatial action ...

Save to Binder

Sections

References

Cited By

Save to Binder

Recommendations

Web Services and Interoperability for the Maude Termination Tool

Unification and Narrowing in Maude 2.4

The linear temporal logic of rewriting Maude model checker