Rewriting logic: Roadmap and bibliography

Theoretical Computer Science

Volumn 285, Issue 2, 2002, Pages 121-154

  Martí Oliet, Narciso ^a   Meseguer, José ^b  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIBLIOGRAPHIES; OBJECT ORIENTED PROGRAMMING; PROGRAM COMPILERS; PROGRAM INTERPRETERS; SEMANTICS; THEOREM PROVING;

THEOREM PROVING TOOLS;

FORMAL LOGIC;

EID: 0037190151     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00357-7     Document Type: Article

References (328)

1. From Maude specifications to SOAP distributed implementations: A smooth transition
2. Maude meets CORBA
3. On the smooth implementation of component-based system specifications
4. On the specification and validation of cooperative information systems using an extended Maude
5. Algebraic specification of concurrency
6. Labelled transition logic: An outline
7. On the relationship between labelled transition logic and rewriting logic
8. Algebraic specification of concurrent systems
9. Specifying and checking fault-tolerant agent-based protocols using Maude
10. Maude versus Haskell: An experimental comparison in security protocol analysis
11. Reflective metalogical frameworks
12. Rewriting logic as a metalogical framework
13. Verification of timed automata using rewrite rules and strategies
14. Implementation of higher-order unification based on calculus of explicit substitutions
15. Controlling rewriting: Study and implementation of a strategy formalism
16. Cooperation of constraint solvers: Using the new process control facilities of ELAN
17. Strategies of ELAN: Meta-interpretation and partial evaluation
18. Handling ELAN rewrite programs via an exchange format
19. Controlling rewriting by rewriting
20. Strategies and rewriting in ELAN
21. A functional view of rewriting and strategies for a semantics of ELAN
22. Rewriting as a unified specification tool for logic and control: The ELAN language
23. ELAN from the rewriting logic point of view
24. An overview of ELAN
25. ELAN: A logical framework based on computational systems
26. Rewriting with strategies in ELAN: A functional semantics
27. Specification and proof in membership equational logic
28. Specification and proof in membership equational logic
29. Maude action tool: Using reflection to map action semantics to rewriting logic
30. A logic for modular descriptions of asynchronous and synchronized concurrent systems
31. Cartesian closed double categories, their lambda-notation, and the pi-calculus
32. Bisimilarity congruences for open terms and term graphs via tile logic
33. Implementing tile systems: Some examples from process calculi
34. Internal strategies in a rewriting implementation of tile systems
35. Executable tile specifications for process calculi
36. Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
37. Open ended systems, dynamic bisimulation and tile logic
38. CCS semantics via proved transition systems and rewriting logic
39. An approach to solving binary CSP using computational systems
40. Binary CSP solving as an inference process
41. Constraint manipulation using rewrite rules and strategies
42. Building constraint satisfaction problem solvers using rewrite rules and strategies
43. Distributed logic objects: A fragment of rewriting logic and its implementation
44. Specifying authentication protocols in ELAN
45. Theorem proving using computational systems: The case of the B predicate prover
46. Using rewriting and strategies for describing the B predicate prover
47. Combining higher-order and first-order computations using ρ-calculus: Towards a semantics of ELAN
48. The simply typed rewriting calculus
49. The rewriting calculus - Part I
50. The rewriting calculus - Part II
51. Matching power
52. The rho cube
53. Reflection in general logics, rewriting logic, and Maude
54. Axiomatizing reflective logics and languages
55. Reflection and strategies in rewriting logic
56. Internal strategies in a reflective logic
57. Reflection in rewriting logic and its applications in the Maude language
58. Reflection in conditional rewriting logic
59. Metalevel computation in Maude
60. Maude as a metalanguage
61. Maude: Specification and programming in rewriting logic
62. The Maude system
63. A Maude tutorial, Tutorial distributed as documentation of the Maude system
64. Towards Maude 2.0
65. Using Maude
66. Maude: Specification and programming in rewriting logic
67. Building equational proving tools by reflection in rewriting logic
68. Building equational proving tools by reflection in rewriting logic
69. Maude as a formal meta-tool
70. Polytypic programming in Maude
71. Principles of Maude
72. CPO models for infinite term rewriting
73. Relating two categorical models of term rewriting
74. Tile transition systems as structured coalgebras
75. From rewrite theories to temporal logic theories
76. Translating TROLL light concepts to Maude
77. CAPSL intermediate language
78. CAPSL integrated protocol environment
79. Specification and analysis of a reliable broadcasting protocol in Maude
80. Protocol specification and analysis in Maude
81. Formal specification and analysis of active networks and communication protocols: The Maude experience
82. Rewriting semantics of meta-objects and composable distributed services
83. Sequent calculus viewed modulo
84. Foundations of behavioural specification in rewriting logic
85. The language, proof techniques, and methodologies for object-oriented algebraic specification
86. Logical foundations of CafeOBJ
87. Component-based algebraic specification and verification in CafeOBJ
88. CafeOBJ jewels
89. An overview of CafeOBJ
90. Higher order unification via explicit substitutions
91. HOL-λσ: An intentional first-order expression of higher-order logic
92. Actions and plans in ELAN
93. Modelling planning problems with rules and strategies
94. Objects, rules, and strategies in ELAN
95. Rule based programming with constraints and strategies
96. The extensibility of Maude's module algebra
97. An extensible module algebra for Maude
98. Structured theories and institutions
99. Parameterized theories and views in Full Maude 2.0
100. Maude's module algebra
101. Writing ODP enterprise specifications in Maude
102. Principles of mobile Maude
103. Fast matching in combination of regular equational theories
104. Term rewriting with operator evaluation strategy
105. Can intuition become rigorous? Foundations for UML model verification tools
106. Seamless formalizing the UML semantics through metamodels
107. A tile-based coordination view of asynchronous pi-calculus
108. Tiles for concurrent and located calculi
109. Tile formats for located and mobile systems
110. Towards a verification logic for rewriting logic
111. Interpreting abstract interpretations in membership equational logic
112. Proc. 3rd Internat. Workshop on rewriting logic and its applications, WRLA 2000
113. An overview of CAFE specification environment - An algebraic approach for creating, verifying, and maintaining formal specifications over networks
114. Cafe as an extensible specification environment
115. Enriched categories as models of computation
116. Tiles, rewriting rules, and CCS
117. The tile model
118. Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
119. Decidable approximations of sets of descendants and sets of normal forms
120. The OMRS project: State of the art and future developments
121. Behavioral and coinductive rewriting
122. An approach to declarative programming based on a rewriting logic
123. Verifying a microprocessor using Maude
124. Java PathExplorer - A runtime verification tool
125. Monitoring Java programs with Java PathExplorer
126. Testing linear temporal logic formulae on finite execution traces
127. Foundations for rewriting logic
128. Concurrent object composition in CafeOBJ
129. An operational semantics of GAEA in CafeOBJ
130. On the semantics of GAEA - An object-oriented specification of a concurrent reflective language in rewriting logic
131. Brute: Brute force rewriting engine
132. Membership equational logic, calculus of inductive constructions, and rewrite logic
133. On the use of constraints in automated deduction
134. Some extensions of rewriting
135. ELAN
136. Term rewriting
137. Termination and normalisation under strategy - Proofs in ELAN
138. Proc. 2nd Internat. Workshop on rewriting logic and its applications, WRLA'98
139. Prototyping completion with constraints using computational systems
140. A reflective extension of ELAN
141. Non-deterministic computations in ELAN
142. Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories
143. Combining symbolic constraint solvers on algebraic domains
144. Constraint solving by narrowing in combined algebraic domains
145. Rule-based constraint programming
146. Deduction with constraints for theory reasoning: Completeness and simplification problems
147. Implementing computational systems with constraints
148. Designing constraint logic programming languages using computational systems
149. Case studies with CafeOBJ
150. Generating rewrite theories from UML collaborations
151. Timed rewriting logic for the specification of time-sensitive systems
152. Timed rewriting logic with an application to object-based specification
153. Defining standard prolog in rewriting logic
154. Incremental specification based on the combination of data types
155. Discrete event systems in rewriting logic
156. Axiomatizing permutation equivalence in the λ-calculus
157. Axiomatizing permutation equivalence
158. Object-oriented specifications of distributed systems in the μ-calculus and Maude
159. Constructs, concepts, and criteria for reuse in concurrent object-oriented languages
160. Object-oriented specification of distributed systems
161. Modal μ-Maude - Properties and specification of concurrent objects
162. (Objects + concurrency) & reusability - A proposal to circumvent the inheritance anomaly
163. An object-oriented airport
164. Rewriting logic as a framework for generic verification tools
165. Strategic reflection
166. Specification, transformation, and programming of concurrent systems in rewriting logic
167. Compiling rewriting onto SIMD and MIMD/SIMD machines
168. Certifying domain-specific policies
169. Algebraic specification of object aggregation - An event oriented approach
170. Rewriting logic as a logical and semantic framework
171. General logics and logical frameworks
172. Rewriting logic as a logical and semantic framework
173. Action and change in rewriting logic
174. A semantics preserving actor translation
175. Simple network protocol simulation within Maude
176. A logical theory of concurrent objects
177. Rewriting as a unified model of concurrency
178. Conditional rewriting logic: Deduction, models and concurrency
179. Conditional rewriting logic as a unified model of concurrency
180. Multiparadigm logic programming
181. A logical theory of concurrent objects and its realization in the Maude language
182. Solving the inheritance anomaly in concurrent object-oriented programming
183. Proc. 1st Internat. Workshop on rewriting logic and its applications, WRLA'96
184. Rewriting logic as a semantic framework for concurrency: A progress report
185. Formal interoperability
186. A logical framework for distributed systems and communication protocols
187. Membership algebra as a logical framework for equational specification
188. Research directions in rewriting logic
189. Rewriting logic and Maude: A wide-spectrum semantic framework for object-based distributed systems
190. Rewriting logic and Maude: Concepts and applications
191. From abstract data types to logical frameworks
192. Mapping tile logic into rewriting logic
193. Using rewriting logic to interoperate architectural description languages (I and II)
194. Mapping OMRS to rewriting logic
195. A partial order event model for concurrent objects
196. Parallel programming in Maude
197. A logical semantics for object-oriented databases
198. Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents
199. Applications of term rewriting to cryptographic protocol analysis
200. Modelling conditional rewriting logic in structured categories
201. Can actors and pi-agents live together?
202. A choice-point library for backtrack programming
203. Compilation techniques for associative-commutative normalisation
204. A compiler for rewrite programs in associative-commutative theories
205. Semantics, modularity, and rewriting logic
206. Logical specification of operational semantics
207. A formal semantics for the ODP computational model
208. Computational models for open distributed systems
209. Encoding mobility in CafeOBJ: An exercise of describing mobile code-based software architecture
210. Using algebraic specification techniques in development of object-oriented frameworks
211. An object-oriented modeling method for algebraic specifications in CafeOBJ
212. The evaluation strategy for head normal form with and without on-demand flags
213. Cyber assistance for situated human information processing
214. The HOL/NuPRL proof translator - A practical approach to formal interoperability
215. On coherence properties in term rewriting models of concurrency
216. An abstract machine for order-sorted conditional term rewriting systems
217. Specification and verification of some classical mutual exclusion algorithms with CafeOBJ
218. Specification and prototyping of network protocols in rewriting logic
219. Specifying real-time systems in rewriting logic
220. Real-time Maude: A tool for simulating and analyzing real-time and hybrid systems
221. Specification of real-time and hybrid systems in rewriting logic
222. Specification and analysis of the AER/NCA active network protocol suite in real-time maude
223. An object-oriented algebraic steam-boiler control specification
224. Modal logic for rewriting theories
225. A Maude specification of an object oriented database model for telecommunication networks
226. Using reflection to specify transaction sequences in rewriting logic
227. A Maude specification of an object-oriented model for telecommunication networks
228. Prototyping combination of unification algorithms with the ELAN rule-based programming language
229. Handling relations over finite domains in the rule-based system ELAN
230. Case studies in the specification and analysis of protocols in Maude
231. Guaranteing coherent software systems when composing coordinated components
232. Bi-rewriting rewriting logic
233. Rewriting logic as a logic of special relations
234. Term rewriting in a logic of special relations
235. Models and languages for parallel computation
236. Rewriting logic and Elan: Prototyping tools for Petri nets with time
237. A timed rewriting logic semantics for SDL: A case study of the alternating bit protocol
238. A formal model for SDL specifications based on timed rewriting logic
239. CINNI - A generic calculus of explicit substitutions and its application to λ-, ς- and π-calculi
240. A rewriting semantics for algebraic nets
241. Pure type systems in rewriting logic
242. Representation and execution of Petri nets using rewriting logic as a uniform framework
243. Rewriting logic as a unifying framework for Petri nets
244. A proof-theoretic approach to the HOL-Nuprl connection with applications to proof translation
245. An algebraic semantics of reflective objects
246. An actor rewriting theory
247. Composable semantic models for actor theories
248. Interaction semantics for components of distributed systems
249. Towards a toolkit for actor system specification
250. Actor theories in rewriting logic
251. Comparing Meseguer's rewriting logic with the logic CRWL
252. Formally modeling UML and its evolution: A holistic approach
253. Improving system reliability via rigorous software modeling: The UML case
254. Term rewriting for sale
255. ASF+SDF parsing tools applied to ELAN
256. Executing E-LOTOS processes in Maude
257. Implementing CCS in Maude
258. The leader election protocol of IEEE 1394 in Maude
259. Rewriting: An effective model of concurrency
260. Input/output for ELAN
261. Adventures in sequent calculus modulo equations
262. Equational rules for rewriting logic
263. A core language for rewriting
264. A compiler for nondeterministic term rewriting systems
265. Specification and formal analysis of a PLAN algorithm in Maude
266. Towards a foundation of computational reflection based on abstract rewriting (preliminary result)
267. Towards declarative description of computational reflection
268. Programming in OBJ and Maude
269. A formal approach to object-oriented software engineering
270. A formal approach to object-oriented software engineering
271. Concurrent object-oriented specification in SPECTRUM