Results 1  10
of
16
Maude: Specification and Programming in Rewriting Logic
, 2001
"... Maude is a highlevel language and a highperformance 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 ..."
Abstract

Cited by 208 (64 self)
 Add to MetaCart
Maude is a highlevel language and a highperformance 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 userdefinable 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 objectoriented 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.
Reflection in membership equational logic, manysorted equational logic, horn logic with equality, and rewriting logic
 In Gadducci and Montanari [33
, 2002
"... We show that the generalized variant of rewriting logic where the underlying equational specifications are membership equational theories, and where the rules are conditional and can have equations, memberships and rewrites in the conditions is reflective. We also show that membership equational log ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
(Show Context)
We show that the generalized variant of rewriting logic where the underlying equational specifications are membership equational theories, and where the rules are conditional and can have equations, memberships and rewrites in the conditions is reflective. We also show that membership equational logic, manysorted equational logic, and Horn logic with equality are likewise reflective. These results provide logical foundations for reflective languages and tools based on these logics, and in particular for the Maude language itself. 1
Software Specification and Verification in Rewriting Logic
, 2003
"... One can distinguish two specification levels: a system specification level, in which the computational system of interest is specified; and a property specification level, in which the relevant properties are specified. These lectures present an approach to executable system specification based on e ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
One can distinguish two specification levels: a system specification level, in which the computational system of interest is specified; and a property specification level, in which the relevant properties are specified. These lectures present an approach to executable system specification based on equational logic for deterministic systems and on rewriting logic for concurrent systems that is seamlessly integrated with a property specification level using firstorder, inductive, and temporal logics. This integration is directly supported by formal verification tools in the formal environment of the Maude rewriting logic language. We show how this approach and the supporting tools can be applied to the specification and verification of a wide variety of programs, that can be either declarative or imperative, and either deterministic or concurrent.
A Meta Linear Logical Framework
 In 4th International Workshop on Logical Frameworks and MetaLanguages (LFM’04
, 2003
"... Over the years, logical framework research has produced various type theories designed primarily for the representation of deductive systems. Reasoning about these representations requires expressive special purpose meta logics, that are in general not part of the logical framework. ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Over the years, logical framework research has produced various type theories designed primarily for the representation of deductive systems. Reasoning about these representations requires expressive special purpose meta logics, that are in general not part of the logical framework.
Pure type systems in rewriting logic: Specifying typed higherorder languages in a firstorder logical framework
 In Essays in Memory of OleJohan Dahl, volume 2635 of LNCS
, 2004
"... ..."
(Show Context)
Developing dynamic security policies
 In Proceedings of the 2002 DARPA Active Networks Conference and Exposition (DANCE 2002
, 2002
"... In this paper we define and provide a general construction for a class of policies we call dynamic policies. In most existing systems, policies are implemented and enforced by changing the operational parameters of shared system objects. These policies do not account for the behavior of the entire s ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
In this paper we define and provide a general construction for a class of policies we call dynamic policies. In most existing systems, policies are implemented and enforced by changing the operational parameters of shared system objects. These policies do not account for the behavior of the entire system, and enforcing these policies can have unexpected interactive or concurrent behavior. We present a policy specification, implementation, and enforcement methodology based on formal models of interactive behavior and satisfiability of system properties. We show that changing the operational parameters of our policy implementation entities does not affect the behavioral guarantees specified by the properties. We demonstrate the construction of dynamic access control policies based on safety property specifications and describe an implementation of these policies in the Seraphim active network architecture. We present examples of reactive security systems that demonstrate the power and dynamism of our policy implementations. We also describe other types of dynamic policies for information flow and availability based on safety, liveness, fairness, and other properties. We believe that dynamic policies are important building blocks of reactive security solutions for active networks. 1.
µCalculus Model Checking in Maude
, 2004
"... In this paper, a rewrite theory for checking µcalculus properties is developed. We use the same framework proposed in [EMS02] and demonstrate how rewriting logic can be used as a unified formalism from model specification to verification algorithm implementation. Furthermore, since µcalculus is mo ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
In this paper, a rewrite theory for checking µcalculus properties is developed. We use the same framework proposed in [EMS02] and demonstrate how rewriting logic can be used as a unified formalism from model specification to verification algorithm implementation. Furthermore, since µcalculus is more expressive than LTL, this work can be seen as an extension to [EMS02] in theory. We also develop a CTL to µcalculus translator to help users write CTL specifications more easily. However, the corresponding LTL to µcalculus translator is missing. The LTL model checker in [EMS02] is still preferred in practice.
Automatic verification of a model checker in rewriting logic
, 2005
"... Abstract. In this paper, we use the reflection of rewriting logic to analyze a bounded local model checker for infinitestate systems formally. We introduce threevalued logic in a local model checking algorithm to formalize aborted verification. To improve its efficiency, several optimizations are ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper, we use the reflection of rewriting logic to analyze a bounded local model checker for infinitestate systems formally. We introduce threevalued logic in a local model checking algorithm to formalize aborted verification. To improve its efficiency, several optimizations are introduced in the algorithm. We show how to exploit the reflection of rewriting logic and model check our bounded local model checker in rewriting logic formally. 1
A rewriting decision procedure for DijkstraScholten’s syllogistic logic with complements. Revista Colombiana de Computación
, 2007
"... The formalist, however, prefers to manipulate his formulae, temporarily ignoring all interpretations they might admit, the rules for the permissible symbol manipulations being formulated in terms of those symbols: the formalist calculates with uninterpreted formulae. E.W. Dijkstra, “The notational c ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
The formalist, however, prefers to manipulate his formulae, temporarily ignoring all interpretations they might admit, the rules for the permissible symbol manipulations being formulated in terms of those symbols: the formalist calculates with uninterpreted formulae. E.W. Dijkstra, “The notational conventions I adopted, and why”
Automatic Verification of a Model Checker by Reflection
"... Abstract. Intuitively, reflection is the feature that can represent and reason metalevel entities at the object level. In this paper, we use a reflective language to implement a local model checker and analyze the implementation. The implementation is greatly simplified by reflection. Further, we s ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Intuitively, reflection is the feature that can represent and reason metalevel entities at the object level. In this paper, we use a reflective language to implement a local model checker and analyze the implementation. The implementation is greatly simplified by reflection. Further, we show the feature can be applied to verify the concise implementation rather easily. The simplicity of our approach suggests that reflection may be useful in the implementation and verification of other explicitstate model checking algorithms.