Maude's Internal Strategies

AbstractMaude is a reflective language supporting both rewriting logic and membership equational logic. Reflection is systematically exploited in Maude, endowing the language with powerful metaprogramming capabilities, including declarative strategies to guide the deduction process

Maude: specification and programming in rewriting logic

Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming in its sublanguage of functional modules and theories. The underlying equational logic chosen for Maude is membership equational logic, that has sorts, subsorts, operator overloading, and partiality definable by membership and equality conditions. Rewriting logic is reflective, in the sense of being able to express its own metalevel at the object level. Reflection is systematically exploited in Maude endowing the language with powerful metaprogramming capabilities, including both user-definable module operations and declarative strategies to guide the deduction process. This paper explains and illustrates with examples the main concepts of Maude's language design, including its underlying logic, functional, system and object-oriented modules, as well as parameterized modules, theories, and views. We also explain how Maude supports reflection, metaprogramming and internal strategies. The paper outlines the principles underlying the Maude system implementation, including its semicompilation techniques. We conclude with some remarks about applications, work on a formal environment for Maude, and a mobile language extension of Maude

Part 1, Series C, Number 25: Advertisements and Reviews

Advertisements and reviews for H.E.Maude's "Slavers in Paradise"

Software System Model Correctness using Graph Theory: A Review

The Unified Modeling Language UML is the de facto standard for object-oriented software model development The UML class diagram plays an essential role in design and specification of software systems The purpose of a class diagram is to display classes with their attributes and methods hierarchy generalization class relationships and associations general aggregation and composition between classes in one mode

Maude: specification and programming in rewriting logic

AbstractMaude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming in its sublanguage of functional modules and theories. The underlying equational logic chosen for Maude is membership equational logic, that has sorts, subsorts, operator overloading, and partiality definable by membership and equality conditions. Rewriting logic is reflective, in the sense of being able to express its own metalevel at the object level. Reflection is systematically exploited in Maude endowing the language with powerful metaprogramming capabilities, including both user-definable module operations and declarative strategies to guide the deduction process. This paper explains and illustrates with examples the main concepts of Maude's language design, including its underlying logic, functional, system and object-oriented modules, as well as parameterized modules, theories, and views. We also explain how Maude supports reflection, metaprogramming and internal strategies. The paper outlines the principles underlying the Maude system implementation, including its semicompilation techniques. We conclude with some remarks about applications, work on a formal environment for Maude, and a mobile language extension of Maude

Specification and Analysis of Priced Systems in Priced-Timed Maude

This thesis investigates the suitability of extending the rewriting-logic-based Maude framework, in particular Real-Time Maude, to support the formal modeling and analysis of untimed and timed priced systems. The first contribution of this thesis is to define priced and priced-timed rewrite theories, show the soundness of these definitions, and prove that priced-time rewrite theories contain as a proper subset the set of priced-timed automata (PTA). Since all priced systems that I have encountered have been real-time systems, I focus on priced real-time (priced-timed) systems. The second main contribution of the thesis is the development of a tool, Priced-Timed Maude, supporting the specification and analysis of useful subclasses of priced and priced-timed rewrite theories. In particular, Priced-Timed Maude supports the specification of the large and important class of ``flat'' object-oriented priced-timed systems, for which I have developed useful and intuitive specification techniques. This thesis then applies Priced-Timed Maude to three larger systems, two of which can be considered benchmarks for priced-timed systems and are often encountered in the literature, and one which has been inspired by a ``regular'' problem found in optimization literature. I have also modeled and analyzed one of these systems using the only well known formal tool for priced-timed systems that I have found, the PTA tool Uppaal CORA, and have compared the performance of these Priced-Timed Maude and Uppaal CORA specifications. Unsurprisingly, Uppaal CORA outperforms Priced-Timed Maude when analyzing this problem. This is natural, since the PTA model is quite restrictive. On the other hand, Priced-Timed Maude is more general and expressive, and lets us model more complex systems with advanced data types and communication features in an elegant and intuitive style. Furthermore, Priced-Timed Maude supports a wide range of formal analysis methods, including: rewriting for simulation, search for reachability analysis, linear temporal logic model checking, and finding cost- and time-optimal solutions

Learning in Goal Oriented Autonomous Systems

This report, prepared for the Computer Science Laboratory at SRI International, covers the development of a Learning component for PAGODA, a modular architecture for goal directed agents that explore an environment without need for constant commands from an operator. Two learning algorithms are presented and our algorithm implementations analyzed. The report highlights the changes made to PAGODA and the development challenges encountered. Additionally, several potential improvements to the PAGODA system are given