Maude: Specification and programming in rewriting logic

Theoretical Computer Science

Volumn 285, Issue 2, 2002, Pages 187-243

  Clavel, M ^a   Duran F ^b   Eker, S ^c   Lincoln, P ^c   Marti Oliet N ^d   Meseguer, J ^c   Quesada, J F ^e  

^a UNIVERSITY OF NAVARRA   (Spain)

^b UNIVERSITY OF MÁLAGA   (Spain)

^c SRI INTERNATIONAL   (United States)

^d UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^e Centro Informatico Cientifico de Andalucia   (Spain)

Author keywords

Functional modules; Internal strategies; Maude; Parameterization; Reflection; Rewriting logic; System modules

Indexed keywords

COMPUTER SCIENCE; HIGH LEVEL LANGUAGES; OBJECT ORIENTED PROGRAMMING; PROGRAM COMPILERS;

OBJECT-ORIENTED MODULES;

FORMAL LOGIC;

EID: 0037190144     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00359-0     Document Type: Article

References (68)

1. Algebraic foundations of systems specification
2. Rewriting logic as a metalogical framework
3. Characterization of computable data types by means of a finite equational specification method
4. Controlling rewriting by rewriting
5. Rewriting as a unified specification tool for logic and control: The ELAN language
6. An overview of ELAN
7. ELAN: A logical framework based on computational systems
8. Specification and proof in membership equational logic
9. The semantics of Clear, a specification language
10. CCS semantics via proved transition systems and rewriting logic
11. Metalevel computation in Maude
12. Maude: Specification and programming in rewriting logic
13. A Maude tutorial, Tutorial distributed as documentation of the Maude system
14. Towards Maude 2.0
15. Building equational proving tools by reflection in rewriting logic
16. Maude as a formal meta-tool
17. Principles of Maude
18. Reflection in conditional rewriting logic
19. Formal specification and analysis of active networks and communication protocols: The Maude experience
20. Rewrite systems
21. CafeOBJ Report
22. Component-based algebraic specification and verification in CafeOBJ
23. An overview of CafeOBJ
24. Logical support for modularization
25. The extensibility of Maude's module algebra
26. Principles of mobile Maude
27. An extensible module algebra for Maude
28. Parameterized theories and views in Full Maude 2.0
29. Fast matching in combination of regular equational theories
30. Term rewriting with operator evaluation strategy
31. Proc. 3rd Int. Workshop on rewriting logic and its applications, WRLA 2000
32. Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
33. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
34. Introducing OBJ
35. Completion of a set of rules modulo a set of equations
36. Proc. 2nd Int. Workshop on rewriting logic and its applications, WRLA'98
37. Designing constraint logic programming languages using computational systems
38. Rewriting logic as a logical and semantic framework
39. Conditional rewriting logic as a unified model of concurrency
40. A logical theory of concurrent objects and its realization in the Maude language
41. Solving the inheritance anomaly in concurrent object-oriented programming
42. Proc. 1st Int. Workshop on rewriting logic and its applications, WRLA'96
43. Rewriting logic as a semantic framework for concurrency: A progress report
44. Membership algebra as a logical framework for equational specification
45. Research directions in rewriting logic
46. Rewriting logic and Maude: A wide-spectrum semantic framework for object-based distributed systems
47. Rewriting logic and Maude: Concepts and applications
48. Order-sorted algebra solves the constructor-selector, multiple representation and coercion problems
49. A partial order event model for concurrent objects
50. Combining matching algorithms: The regular case
51. Real-time Maude: A tool for simulating and analyzing real-time and hybrid systems
52. Specification of real-time and hybrid systems in rewriting logic
53. Level-confluence of conditional rewrite systems with extra variables in right-hand sides
54. An actor rewriting theory
55. Interaction semantics for components of distributed systems
56. Towards a toolkit for actor system specification
57. Actor theories in rewriting logic
58. Rewriting: An effective model of concurrency