The Maude 2.0 system

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

Volumn 2706, Issue , 2003, Pages 76-87

  Clavel, Manuel ^a   Duràn, Francisco ^b   Eker, Steven ^c   Lincoln, Patrick ^c   Martì Oliet, Narciso ^a   Meseguer, Josè ^d   Talcott, Carolyn ^c  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^b UNIVERSITY OF MÁLAGA   (Spain)

^c SRI INTERNATIONAL   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

FORMAL TOOLS; IMPLEMENTATION TECHNIQUES; MEMBERSHIP EQUATIONAL LOGIC; META LEVELS; MODEL CHECKER; OPERATIONAL SEMANTICS; REWRITING LOGIC; REWRITING MODULO;

MODEL CHECKING;

EID: 84928563923     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44881-0_7     Document Type: Conference Paper

References (27)

1. P. Borovansky, C. Kirchner, H. Kirchner, and P.-E. Moreau. ELAN from a rewriting logic point of view. Theoretical Computer Science, 285:155–185, 2002.
2. R. Bruni and J. Meseguer. Generalized rewrite theories. To appear in Procs. of ICALP’03. LNCS. Springer, 2003.
3. M. Clavel. Reflection in Rewriting Logic: Metalo gical Foundations and Metaprogramming Applications. CSLI Publications, 2000.
4. M. Clavel, F. Duràn, S. Eker, P. Lincoln, N. Martì-Oliet, J. Meseguer, and J. Quesada. Maude Manual, 1999. http://maude.cs.uiuc.edu.
5. M. Clavel, F. Duràn, S. Eker, P. Lincoln, N. Martì-Oliet, J. Meseguer, and J. Quesada. The Maude system. In Procs. of RTA’99. LNCS 1631, pp. 240–243. Springer, 1999.
6. 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.
7. M. Clavel, F. Duràn, S. Eker, J. Meseguer, and M.-O. Stehr. Maude as a formal meta-tool. In Procs. of FM’99. LNCS 1709, pp. 1684–1703. Springer, 1999.
8. M. Clavel and J. Meseguer. Reflection in conditional rewriting logic. Theoretical Computer Science, 285:245–288, 2002.
9. J. R. Driscoll, N. Sarnak, D. Sleator, and R. Tarjan. Making data structures persistent. Journal of Computer and System Science, 38:86–124, 1989.
10. S. Eker. Term rewriting with operator evaluation strategy. In Procs. of WRLA’98. ENTCS 15. Elsevier, 1998.
11. S. Eker. Associative-commutative rewriting on large terms. This volume.
12. S. Eker, M. Knapp, K. Laderoute, P. Lincoln, J. Meseguer, and K. Sonmez. Pathway logic: Symbolic analysis of biological signaling. In Procs. of the Pacific Symposium on Biocomputing, pp. 400–412, 2002.
13. S. Eker, M. Knapp, K. Laderoute, P. Lincoln, and C. Talcott. Pathway logic: Executable models of biological networks. In Procs. of WRLA’02. ENTCS 71. Elsevier, 2002.
14. K. Etessami and G. J. Holzmann. Optimizing Büchi automata. In Procs. of CONCUR’00. LNCS 1877, pp. 153–167. Springer, 2000.
15. K. Futatsugi and R. Diaconescu. CafeOBJ Report. World Scientific, AMAST Series, 1998.
16. P. Gastin and D. Oddoux. Fast LTL to Büchi automata translation. In Procs. of CAV’01. LNCS 2102, pp. 53–65. Springer, 2001.
17. R. Gerth, D. Peled, M. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Protocol Specification Testing and Verification, pp. 3–18. Chapman and Hall, 1995.
18. G.J. Holzmann, D. Peled, and M. Yannakakis. On nested depth first search. Design: An International Journal, 13(3):289–307, 1998.
19. S. Lucas. Termination of rewriting with strategy annotations. In Procs. of LPAR’01. LNAI 2250, pp. 669–684. Springer, 2001.
20. N. Martì-Oliet and J. Meseguer. Rewriting logic: roadmap and bibliography. Theoretical Computer Science, 285:121–154, 2002.
21. J. Meseguer, M. Palomino, and N. Martì-Oliet. Equational abstractions. To appear in Procs. of CADE’03. LNCS. Springer, 2003.
22. J. Meseguer. Membership algebra as a logical framework for equational specification. In Procs. of WADT’97. LNCS 1376, pp. 18–61. Springer, 1998.
23. F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In Procs. of CAV’00. LNCS 1633, pp. 247–263. Springer, 2000.
24. C. Talcott. To be presented at the DARPA FTN Winter 2003 PI meeting, TX, USA, 2003.
25. P. Thati, K. Sen, and N. Martì-Oliet. An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0. In Procs. of WRLA’02. ENTCS 71. Elsevier, 2002.
26. A. Verdejo and N. Martì-Oliet. Implementing CCS in Maude 2. In Procs. of WRLA’02. ENTCS 71. Elsevier, 2002.
27. P. Viry. Equational rules for rewriting logic. Theoretical Computer Science, 285:487–517, 2002.