A rewriting logic sampler

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

Volumn 3722 LNCS, Issue , 2005, Pages 1-28

  Meseguer, José ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; ENGINEERING RESEARCH; SECURITY OF DATA;

BIOINFORMATICS; COMPUTATIONAL LOGICS; PROBABILISTIC SYSTEMS;

PROBABILISTIC LOGICS;

EID: 33646420329     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560647_1     Document Type: Conference Paper

References (110)

1. G. Agha, C. Gunter, M. Greenwald, S. Khanna, J. Meseguer, K. Sen, and P. Thati. Formal modeling and analysis of DoS using probabilistic rewrite theories. In Workshop on Foundations of Computer Security (FCS'05) (Affiliated with LICS'05), 2005.
2. G. Agha, J. Meseguer, and K. Sen. PMaude: Rewrite-based specification language for probabilistic object systems. In 3rd Workshop on Quantitative Aspects of Programming Languages (QAPL'05), 2005.
3. W. Ahrendt, A. Roth, and R. Sasse. Automatic validation of transformation rules for Java verification against a rewriting semantics. Manuscript, June 2005.
4. D. Basin, M. Clavel, and J. Meseguer. Reflective metalogical frameworks. ACM Transactions on Computational Logic, 2004.
5. D. Basin, M. Clavel, and J. Meseguer. Rewriting logic as a metalogical framework. In S. Kapoor and S. Prasad, editors, Twentieth Conference on the Foundations of Software Technology and Theoretical Computer Science, New Delhi, India, December 13-15, 2000, Proceedings, volume 1974 of Lecture Notes in Computer Science, pages 55-80. Springer-Verlag, 2000.
6. D. Basin and G. Denker. Maude versus Haskell: An experimental comparison in security protocol analysis. In Futatsugi [52], pages 235-256. http://www.elsevier.nl/locate/entcs/volume36.html.
7. P. Borovanský, C. Kirchner, H. Kirchner, and P.-E. Moreau. ELAN from a rewriting logic point of view. Theoretical Computer Science, 285:155-185, 2002.
8. C. Braga. 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.
9. C. Braga and J. Meseguer. Modular rewriting semantics in practice, in Proc. WRLA'04, ENTCS.
10. R. Bruni and J. Meseguer. Generalized rewrite theories. In J. Baeten, J. Lenstra, J. Parrow, and G. Woeginger, editors, Proceedings of ICALP 2003, 30th International Colloquium on Automata, Languages and Programming, volume 2719 of Springer LNCS, pages 252-266, 2003.
11. I. Cervesato and M.-O. Stehr. Representing the msr cryptoprotocol specification language in an extension of rewriting logic with dependent types. In P. Degano, editor, Proc. Fifth International Workshop on Rewriting Logic and its Applications (WRLA'2004). Elsevier ENTCS, 2004. Barcelona, Spain, March 27-28, 2004.
12. F. Chalub. An implementation of modular SOS in maude. Master's thesis, Universidade Federal Fluminense, May 2005. http://www.ic.uff.br/~frosario/ dissertation.pdf.
13. F. Chalub and C. Braga. A Modular Rewriting Semantics for CML. Journal of Universal Computer Science, 10(7):789-807, July 2004. http://www.jucs.org/ jucs_10_7/a_modular_rewriting_semantics.
14. F. Chen, G. Roşu, and R. P. Venkatesan. Rule-based analysis of dimensional safety. In Rewriting Techniques and Applications (RTA '03), volume 2706 of Springer LNCS, pages 197-207, 2003.
15. M. Clavel. Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications. CSLI Publications, 2000.
16. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, and J. Meseguer. Metalevel computation in Maude. In Kirchner and Kirchner [60], pages 3-24. http://www.elsevier.nl/locate/entcs/volume15.html.
17. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Quesada. Maude: specification and programming in rewriting logic. Theoretical Computer Science, 285:187-243, 2002.
18. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and C. Talcott. Maude 2.0 Manual. June 2003, http://maude.cs.uiuc. edu.
19. M. Clavel, F. Durán, S. Eker, and J. Meseguer. Building equational proving tools by reflection in rewriting logic. In CAFE: An Industrial-Strength Algebraic Formal Method, pages 1-31. Elsevier, 2000. http://maude.cs.uiuc.edu.
20. M. Clavel, F. Durán, S. Eker, J. Meseguer, and M.-O. Stehr, Maude as a formal meta-tool. In J. M. Wing, J. Woodcock, and J. Davies, editors, FM'99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999 Proceedings, Volume II, volume 1709 of Lecture Notes in Computer Science, pages 1684-1703. Springer-Verlag, 1999.
21. M. Clavel, F. Durán, and N. Martí-Oliet. Polytypic programming in Maude. In Futatsugi [52], pages 339-360. http://www.elsevier.nl/ locate/entcs/volume36.html.
22. M. Clavel and J. Meseguer. Reflection and strategies in rewriting logic. In J. Meseguer, editor, Proceedings First International Workshop on Rewriting Logic and its Applications, WRLA'96, Asilomar, California, September 3-6, 1996, volume 4 of Electronic Notes in Theoretical Computer Science, pages 125-147. Elsevier, Sept. 1996. http://www.elsevier.nl/locate/entcs/volume4.html.
23. M. Clavel and J. Meseguer. Reflection in conditional rewriting logic. Theoretical Computer Science, 285:245-288, 2002.
24. M. Clavel, J. Meseguer, and M. Palomino. Reflection in membership equational logic, many-sorted equational logic, horn logic with equality, and rewriting logic. In F. Gadducci and U. Montanari, editors, Proc. 4th. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, 2002.
25. M. Clavel and M. Palomino. The ITP tool's manual. Universidad Complutense, Madrid, April 2005, http://maude.sip.ucm.es/itp/.
26. M. Clavel and J. Santa-Cruz. ASIP+ITP: A verification tool based on algebraic semantics. To appear in Proc. PROLE'05, http://maude.sip.ucm.es/ ~clavel/pubs/.
27. M. d'Amorim and G. Roşu. An Equational Specification for the Scheme Language. In Proceedings of the 9th Brazilian Symposium on Programming Languages (SBLP'05), to appear 2005.
28. Also Technical Report No. UIUCDCS-R-2005-2567, April 2005.
29. G. Denker, J. Meseguer, and C. Talcott. Rewriting semantics of meta-objects and composable distributed services. ENTCS, Elsevier, 2000. Proc. 3rd. Intl. Workshop on Rewriting Logic and its Applications.
30. G. Denker, J. Meseguer, and C. L. Talcott. Protocol specification and analysis in Maude. In N. Heintze and J. Wing, editors, Proceedings of Workshop on Formal Methods and Security Protocols, June 25, 1998, Indianapolis, Indiana, 1998. http://www.cs.bell-labs.com/who/nch/fmsp/index.html.
31. G. Denker, J. Meseguer, and C. L. Talcott. Formal specification and analysis of active networks and communication protocols: The Maude experience. In D. Maughan, G. Koob, and S. Saydjari, editors, Proceedings DARPA Information Survivability Conference and Exposition, DISCEX 2000, Hilton Head Island, South Carolina, January 25-27, 2000, pages 251-265. IEEE Computer Society Press, 2000. http://schafercorp-ballston.com/discex/.
32. G. Denker and J. Millen. 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.
33. G. Denker and J. Millen. CAPSL intermediate language. In N. Heintze and E. Clarke, editors, Proceedings of Workshop on Formal Methods and Security Protocols, FMSP'99, July 1999, Trento, Italy, 1999. http://www.cs.bell-labs.com/ who/nch/fmsp99/program.html.
34. G. Denker and J. Millen. CAPSL integrated protocol environment. In D. Maughan, G. Koob, and S. Saydjari, editors, Proceedings DARPA Information Survivability Conference and Exposition, DISCEX 2000, Hilton Head Island, South Carolina, January 25-27, 2000, pages 207-222. IEEE Computer Society Press, 2000. http://schafercorp-ballston.com/discex/.
35. G. Denker and J. Millen. The CAPSL integrated protocol environment. Technical Report SRI-CSL-2000-02, Computer Science Laboratory, SRI International. 2000. http://www.csl.sri.com/~denker/pub_99.html.
36. F. Durán. A reflective module algebra with applications to the Maude language. Ph.D. Thesis, University of Malaga, 1999.
37. F. Durán. Coherence checker and completion tools for Maude specifications. Manuscript, Computer Science Laboratory, SRI International, http://maude.cs.uiuc.edu/papers, 2000.
38. F. Durán. The extensibility of Maude's module algebra. In T. Rus, editor, Algebraic Methodology and Software Technology, 8th International Conference, AMAST 2000, Iowa City, Iowa, USA, May 20-27, 2000, Proceedings, volume 1816 of Lecture Notes in Computer Science, pages 422-437. Springer-Verlag, 2000.
39. F. Durán. Termination checker and Knuth-Bendix completion tools for Maude equational specifications. Manuscript, Computer Science Laboratory, SRI International, http://maude.cs.uiuc.edu/papers, 2000.
40. F. Durán, S. Lucas, J. Meseguer, C. Marché, and X. Urbain. Proving termination of membership equational programs. In P. Sestoft and N. Heintze, editors, Proc. of ACM SIGPLAN 2004 Symposium on Partial Evaluation and Program Manipulation, PEPM'04, pages 147-158. ACM Press, 2004.
41. F. Durán and J. Meseguer. An extensible module algebra for Maude. In Kirchner and Kirchner [60], pages 185-206. http://www.elsevier.nl/locate/ entcs/volume15.html.
42. F. Durán and J. Meseguer. A Church-Rosser checker tool for Maude equational specifications. Manuscript, Computer Science Laboratory, SRI International, http://maude.cs.uiuc.edu/papers, 2000.
43. F. Durán and J. Meseguer. On parameterized theories and views in Full Maude 2.0. In K. Futatsugi, editor, Proc. 3rd. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, 2000.
44. S. Eker, M. Knapp, K. Laderoute, P. Lincoln, J. Meseguer, and K. Sonmez. Pathway logic: Symbolic analysis of biological signaling. In Proceedings of the Pacific Symposium on Biocomputing, pages 400-412, January 2002.
45. S. Eker, M. Knapp, K. Laderoute, P. Lincoln, and C. Talcott. Pathway Logic: executable models of biological networks. In F. Gadducci and U. Montanari, editors, Proc. 4th. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, 2002.
46. S. Eker, J. Meseguer, and A. Sridharanarayanan. The Maude LTL model checker. In F. Gadducci and U. Montanari, editors, Proc. 4th. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, 2002.
47. th Intl. SPIN Workshop, volume 2648, pages 230-234. Springer LNCS, 2003.
48. S. Escobar, C. Meadows, and J. Meseguer. A rewriting-based inference system for the NRL Protocol Analyzer. Submitted for publication, 2005.
49. S. Escobar, J. Meseguer, and P. Thati. Natural narrowing for general term rewriting systems. In J. Giesl, editor, Proceedings of the 16th Intl. Conference on Term Rewriting and Applications, RTA 2005, pages 279-293. Springer LNCS Vol. 3467, 2005.
50. A. Farzan, F. Cheng, J. Meseguer, and G. Roşu. Formal analysis of Java programs in JavaFAN. in Proc. CAV'04, Springer LNCS, 2004.
51. A. Farzan and J. Meseguer. Partial order reduction for rewriting semantics of programming languages. Technical Report UIUCDCS-R-2005-2598, CS Dept., University of Illinois at Urbana-Champaign, June 2005.
52. A. Farzan, J. Meseguer, and G. Roşu. Formal JVM code analysis in JavaFAN. in Proc. AMAST'04, Springer LNCS 3116, 132-147, 2004.
53. K. Futatsugi, editor. Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, volume 36 of Electronic Notes in Theoretical Computer Science. Elsevier, 2000. http://www.elsevier.nl/locate/entcs/volume36.html.
54. K. Futatsugi and R. Diaconescu. CafeOBJ Report. World Scientific, AMAST Series, 1998.
55. P. Glynn. The role of generalized semi-Markov processes in simulation output analysis, 1983.
56. C. Gunter, A. Goodloe, and M.-O. Stehr. Formal prototyping in early stages of protocol design. In In Proceedings of the Workshop on Issues in the Theory of Security (WITS'05). January 10-11, 2005, Long Beach, California. To appear in the ACM Digital Library. Paper available at http://formal.cs.uiuc.edu/ stehr/13a-wits.pdf.
57. S. Gutierrez-Nolasco, N. Venkatasubramanian, M.-O. Stehr, and C. L. Talcott. Exploring adaptability of secure group communication using formal prototyping techniques. In Proceedings of the 3rd Workshop on Reflective and Adaptive Middleware (RM2004). October 19, 2004, Toronto, Ontario, Canada. To appear in ACM Digital Library. Extended version available at http://formal.cs.uiuc.edu/stehr/spread_eng.html.
58. J. Hendrix, J. Meseguer, and M. Clavel. A sufficient completeness reasoning tool for partial specifications. In J. Giesl, editor, Proceedings of the 16th Intl. Conference on Term Rewriting and Applications, RTA 2005, pages 165-174. Springer LNCS Vol. 3467, 2005.
59. G. Holzmann. The Spin Model Checker - Primer and Reference Manual. Addison-Wesley, 2003.
60. E. B. Johnsen, O. Owe, and E. W. Axelsen. A runtime environment for concurrent objects with asynchronous method calls. In N. Martí-Oliet, editor, Proc. 5th. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, 2004.
61. C. Kirchner and H. Kirchner, editors. Proceedings Second International Workshop on Rewriting Logic and its Applications, WRLA '98, Pont-à- Mousson, Prance, September 1-4, 1998, volume 15 of Electronic Notes in Theoretical Computer Science. Elsevier, 1998. http://www.elsevier.nl/locate/ entcs/volume15.html.
62. W. Kolch. Meaningful relationships: the regulation of the Ras/Raf/MEK/ERK pathway by protein interactions. Biochem. J., 351:289-305, 2000.
63. P. Kosiuczenko and M. Wirsing. Timed rewriting logic with application to object-oriented specification. Technical report, Institut für Informatik, Universität München, 1995.
64. N. Kumar, K. Sen, J. Meseguer, and G. Agha. Probabilistic rewrite theories: Unifying models, logics and tools. Technical Report UIUCDCS-R-2003-2347, University of Illinois at Urbana-Champaign, May 2003.
65. N. Kumar, K. Sen, J. Meseguer, and G. Agha. A rewriting based model of probabilistic distributed object systems. Proc. of Formal Methods for Open Object-Based Distributed Systems, FMOODS 2003, Springer LNCS Vol. 2884, 2003.
66. E. Lien. Formal modeling and analysis of the NORM multicast protocol in Real-Time Maude. Master's thesis, Dept. of Linguistics, University of Oslo, 2004. http://wo.uio.no/as/WebObjects/theses.woa/wo/0.3.9.
67. N. Martí-Oliet and J. Meseguer. Rewriting logic as a logical and semantic framework. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, 2nd. Edition, pages 1-87. Kluwer Academic Publishers, 2002. First published as SRI Tech. Report SRI-CSL-93-05, August 1993.
68. N. Martí-Oliet and J. Meseguer. Rewriting logic: roadmap and bibliography. Theoretical Computer Science, 285:121-154, 2002.
69. C. Meadows. The NRL protocol analyzer: An overview. Journal of Logic Programming, 26(2):113-131, 1996.
70. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73-155, 1992.
71. J. Meseguer. Rewriting logic as a semantic framework for concurrency: a progress report. In Proc. CONCUR'96, Pisa, August 1996, pages 331-372. Springer LNCS 1119, 1996.
72. J. Meseguer. Membership algebra as a logical framework for equational specification. In F. Parisi-Presicce, editor, Proc. WADT'97, pages 18-61. Springer LNCS 1376, 1998.
73. J. Meseguer. Research directions in rewriting logic. In U. Berger and H. Schwichtenberg, editors, Computational Logic, NATO Advanced Study Institute, Marktoberdorf, Germany, July 29 - August 6, 1997. Springer-Verlag, 1999.
74. J. Meseguer. Software specification and verification in rewriting logic. In M. Broy and M. Pizka, editors, Models, Algebras, and Logic of Engineering Software, NATO Advanced Study Institute, Marktoberdorf, Germany, July 30 - August 11, 2002, pages 133-193. IOS Press, 2003.
75. J. Meseguer. Localized fairness: A rewriting semantics. In J. Giesl, editor, Proceedings of the 16th Intl. Conference on Term Rewriting and Applications, RTA 2005, pages 250-263. Springer LNCS Vol. 3467, 2005.
76. J. Meseguer and C. Braga. Modular rewriting semantics of programming languages, in Proc. AM AST'04, Springer LNCS 3116, 364-378, 2004.
77. J. Meseguer and G. Roşu. Rewriting logic semantics: From language specifications to formal analysis tools. In Proc. Intl. Joint Conf. on Automated Reasoning IJCAR'04, Cork, Ireland, July 2004, Pages 1-44. Springer LNAI 3097, 2004.
78. J. Meseguer and G. Roşu. The rewriting logic semantics project. In Proc. of SOS 2005. Elsevier, ENTCS, 2005. To appear.
79. J. Meseguer and C. Talcott. Semantic models for distributed object reflection. In Proceedings of ECOOP'02, Malaga, Spain, June 2002, pages 1-36. Springer LNCS 2374, 2002.
80. J. Meseguer and P. Thati. Symbolic reachability analysis using narrowing and its application to the verification of cryptographic protocols. In N. Martí-Oliet, editor, Proc. 5th. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, 2004.
81. P. D. Mosses. Modular structural operational semantics. J. Log. Algebr. Program., 60-61:195-228, 2004.
82. P. Ölveczky, M. Keaton, J. Meseguer, C. Talcott, and S. Zabele. Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude. In Proc. of FASE'01, 4th Intl. Conf. on Fundamental Approaches to Software Engineering, Springer LNCS. Springer-Verlag, 2001.
83. P. Ölveczky and J. Meseguer. Real-Time Maude 2.0. in Proc. WRLA '04, ENTCS.
84. P. C. Ölveczky. Specification and Analysis of Real-Time and Hybrid Systems in Rewriting Logic. PhD thesis, University of Bergen, Norway, 2000. http://maude.csl.sri.com/papers.
85. P. C. Ölveczky, P. Kosiuczenko, and M. Wirsing. An object-oriented algebraic steam-boiler control specification. In J.-R. Abrial, E. Börger, and H. Langmaack, editors, The Steam-Boiler Case Study Book, pages 379-402. Springer-Verlag, 1996. Vol. 1165.
86. P. C. Ölveczky and J. Meseguer. Specifying real-time systems in rewriting logic. In J. Meseguer, editor, Proc. First Intl. Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science. Elsevier, 1996. http://www.elsevier.nl/cas/tree/store/tcs/ free/noncas/pc/volume4.htm.
87. P. C. Ölveczky and J. Meseguer. Real-Time Maude: a tool for simulating and analyzing real-time and hybrid systems. ENTCS, Elsevier, 2000. Proc. 3rd. Intl. Workshop on Rewriting Logic and its Applications.
88. P. C. Ölveczky and J. Meseguer. Specification of real-time and hybrid systems in rewriting logic. Theoretical Computer Science, 285:359-405, 2002
89. M. Palomino. A predicate abstraction tool for maude. Documentation and tool available at http://maude.sip.ucm.es/~miguelpt/bibliography.html.
90. E. Parzen. Modern Probability Theory and its Applications. Wiley, 1960.
91. M. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, 1994.
92. G. Roşu, R. P. Venkatesan, J. Whittle, and L. Leustean, Certifying optimality of state estimation programs. In Computer Aided Verification (CAV'03), pages 301-314. Springer, 2003. LNCS 2725.
93. D. E. Rodríguez. Case studies in the specification and analysis of protocols in Maude. In Futatsugi [52], pages 257-275. http://www.elsevier.nl/ locate/entcs/volume36.html.
94. R. Sasse. 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, http://www.ubka.uni-karlsruhe.de/cgi-bin/psview?document=ira/2005/16.
95. R. Segala. Modelling and Verification of Randomized Distributed Real Time Systems. PhD thesis, Massachusetts Institute of Technology, 1995.
96. K. Sen, M. Viswanathan, and G. Agha. On statistical model checking of stochastic systems. In 17th conference on Computer Aided Verification (CAV'05), volume 3576 of Lecture Notes in Computer Science (To Appear), Edinburgh, Scotland, July 2005. Springer.
97. L. Steggles and P. Kosiuczenko. A timed rewriting logic semantics for SDL: a case study of the alternating bit protocol. Proc. 2nd Intl. Workshop on Rewriting Logic and its Applications, ENTCS, Vol. 15, North Holland, 1998.
98. M.-O. Stehr, I. Cervesato, and S. Reich. An execution environment for the MSR cryptoprotocol specification language, http://formal.cs.uiuc.edu/stehr/msr. html.
99. M.-O. Stehr and C. Talcott. PLAN in Maude: Specifying an active network programming language. In F. Gadducci and U. Montanari, editors, Proc. 4th. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, 2002.
100. M.-O. Stehr and C. L. Talcott. Practical techniques for language design and prototyping. In J. L. Fiadeiro, U. Montanari, and M. Wirsing, editors, Abstracts Collection of the Dagstuhl Seminar 05081 on Foundations of Global Computing. February 20 - 25, 2005. Schloss Dagstuhl, Wadern, Germany., 2005.
101. W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton, 1994.
102. C. Talcott, S. Eker, M. Knapp, P. Lincoln, and K. Laderoute. Pathway logic modeling of protein functional domains in signal transduction. In Proceedings of the Pacific Symposium on Biocomputing, January 2004.
103. P. Thati and J. Meseguer. Complete symbolic reachability analysis using back-and-forth narrowing. To appear in Proc. CALCO 2005, Springer LNCS, 2005.
104. P. Thati, K. Sen, and N. Martí-Oliet. An executable specification of asynchronous Pi-Calculus semantics and may testing in Maude 2.0. In F. Gadducci and U. Montanari, editors, Proc. 4th. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, 2002.
105. S. Thordvalsen. Modeling and analysis of the OGDC wireless sensor network algorithm in Real-Time Maude. Master's thesis, Dept. of Informatics, University of Oslo, 2005. http://heim.ifi.uio.no/~peterol/RealTimeMaude/OGDC/.
106. A. Verdejo. Maude como marco semántico ejecutable. PhD thesis, Facultad de Informática, Universidad Complutense, Madrid, Spain, 2003.
107. A. Verdejo and N. Martí-Oliet. Executable structural operational semantics in Maude. Manuscript, Dto. Sistemas Informáticos y Programación, Universidad Complutense, Madrid, August 2003.
108. A. Verdejo and N. Martí-Oliet. Implementing CCS in Maude. In Proc. FORTE/PSTV 2000, pages 351-366. IFIP, vol. 183, 2000.
109. A. Verdejo and N. Martí-Oliet. Implementing CCS in Maude 2. In F. Gadducci and U. Montanari, editors, Proc. 4th. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, 2002.
110. P. Viry. Equational rules for rewriting logic. Theoretical Computer Science, 285:487-517, 2002.