Results 1 -
2 of
2
Principles of Maude
, 1996
"... This paper introduces the basic concepts of the rewriting logic language Maude and discusses its implementation. Maude is a wide-spectrum language supporting formal specification, rapid prototyping, and parallel programming. Maude's rewriting logic paradigm includes the functional and object-oriente ..."
Abstract
-
Cited by 121 (28 self)
- Add to MetaCart
This paper introduces the basic concepts of the rewriting logic language Maude and discusses its implementation. Maude is a wide-spectrum language supporting formal specification, rapid prototyping, and parallel programming. Maude's rewriting logic paradigm includes the functional and object-oriented paradigms as sublanguages. The fact that rewriting logic is reflective leads to novel metaprogramming capabilities that can greatly increase software reusability and adaptability. Control of the rewriting computation is achieved through internal strategy languages defined inside the logic. Maude's rewrite engine is designed with the explicit goal of being highly extensible and of supporting rapid prototyping and formal methods applications, but its semi-compilation techniques allow it to meet those goals with good performance. 1 Introduction Maude is a logical language based on rewriting logic [16,23,19]. It is therefore related to other rewriting logic languages such as Cafe [10], ELAN [...
Specifying Real-Time Systems in Rewriting Logic
, 1996
"... This work investigates the suitability of rewriting logic as a semantic framework for modeling real-time and hybrid systems. We present a general method to specify and symbolically simulate such systems in rewriting logic and illustrate it with a well-known benchmark. We also show how a wide range o ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
This work investigates the suitability of rewriting logic as a semantic framework for modeling real-time and hybrid systems. We present a general method to specify and symbolically simulate such systems in rewriting logic and illustrate it with a well-known benchmark. We also show how a wide range of real-time and hybrid system models can be naturally expressed and are unified within our approach. The relationships with timed rewriting logic [9,10] are also investigated. 1 Introduction Rewriting logic is a flexible and expressive framework in which many different models of concurrent computation and many different types of systems can be naturally specified [13,16,12,14]. It seems therefore natural to investigate the question of how rewriting logic can be applied to the specification of realtime and hybrid systems. From the semantic point of view this offers the possibility of integrating real-time aspects with other features and models already supported by rewriting logic. The first ...

