Results 1  10
of
12
The Maude 2.0 system
 Rewriting Techniques and Applications, Proceedings of the 14th International Conference
, 2003
"... Abstract. This paper gives an overviewof the Maude 2.0 system. We emphasize the full generality with which rewriting logic and membership equational logic are supported, operational semantics issues, the new builtin modules, the more general Full Maude module algebra, the new METALEVEL module, the ..."
Abstract

Cited by 80 (17 self)
 Add to MetaCart
Abstract. This paper gives an overviewof the Maude 2.0 system. We emphasize the full generality with which rewriting logic and membership equational logic are supported, operational semantics issues, the new builtin modules, the more general Full Maude module algebra, the new METALEVEL module, the LTL model checker, and newimplementation techniques yielding substantial performance improvements in rewriting modulo. We also comment on Maude’s formal tool environment and on applications. 1
The Rewriting Logic Semantics Project
 SOS 2005 PRELIMINARY VERSION
, 2005
"... Rewriting logic is a flexible and expressive logical framework that unifies denotational semantics and SOS in a novel way, avoiding their respective limitations and allowing very succinct semantic definitions. The fact that a rewrite theory’s axioms include both equations and rewrite rules provides ..."
Abstract

Cited by 39 (11 self)
 Add to MetaCart
Rewriting logic is a flexible and expressive logical framework that unifies denotational semantics and SOS in a novel way, avoiding their respective limitations and allowing very succinct semantic definitions. The fact that a rewrite theory’s axioms include both equations and rewrite rules provides a very useful “abstraction knob” to find the right balance between abstraction and observability in semantic definitions. Such semantic definitions are directly executable as interpreters in a rewriting logic language such as Maude, whose generic formal tools can be used to endow those interpreters with powerful program analysis capabilities.
An Executable Specification of Asynchronous PiCalculus Semantics and May Testing in Maude 2.0
 in Maude 2.0. Proc. WRLA’02, ENTCS 71
, 2003
"... We describe an executable specification of the operational semantics of an asynchronous version of the #calculus in Maude by means of conditional rewrite rules with rewrites in the conditions. We also present an executable specification of the may testing equivalence on nonrecursive asynchronous # ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
We describe an executable specification of the operational semantics of an asynchronous version of the #calculus in Maude by means of conditional rewrite rules with rewrites in the conditions. We also present an executable specification of the may testing equivalence on nonrecursive asynchronous #calculus processes, using the Maude metalevel. Specifically, we describe our use of the metaSearch operation to both calculate the set of all finite traces of a nonrecursive process, and to compare the trace sets of two processes according to a preorder relation that characterizes may testing in asynchronous #calculus. Thus, in both the specification of the operational semantics and the may testing, we make heavy use of new features introduced in version 2.0 of the Maude language and system.
Implementing System BV of the Calculus of Structures in Maude
, 2004
"... System BV is an extension of multiplicative linear logic with a noncommutative selfdual operator. We first map derivations of system BV of the calculus of structures to rewritings in a term rewriting system modulo equality, and then express this rewriting system as a Maude system module. This r ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
System BV is an extension of multiplicative linear logic with a noncommutative selfdual operator. We first map derivations of system BV of the calculus of structures to rewritings in a term rewriting system modulo equality, and then express this rewriting system as a Maude system module. This results in an automated proof search implementation for this system, and provides a recipe for implementing existing calculus of structures systems for other logics. Our result is interesting from the view of applications, specially, where sequentiality is essential, e.g., planning and natural language processing. In particular, we argue that we can express plans as logical formulae by using the sequential operator of BV and reason on them in a purely logical way.
SOS formats and metatheory: 20 years after
, 2007
"... In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin, A structural approach to operational semantics, Technical ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin, A structural approach to operational semantics, Technical
Typed mobile ambients in Maude
 Proceedings of the 6th International Workshop on RuleBased Programming (RULE 2005), Electronic Notes in Theoretical Computer Science 147 (2006
, 2006
"... Abstract. Maude has revealed as a powerful tool for implementing different kinds of semantics so that quick prototypes are available for trying examples and proving properties. In this paper we show how to define in Maude two semantics for Cardelli’s Ambient Calculus. The first one is the operationa ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Abstract. Maude has revealed as a powerful tool for implementing different kinds of semantics so that quick prototypes are available for trying examples and proving properties. In this paper we show how to define in Maude two semantics for Cardelli’s Ambient Calculus. The first one is the operational (reduction) semantics which requires the definition of Maude strategies in order to avoid infinite loops. The second one is a type system defined by Cardelli to avoid communication errors. The correctness of that system was not formally proved. We enrich the operational semantics with error rules and prove that welltyped processes do not produce such errors. The type system is highly nondeterministic. We provide two different (equivalent) ways of implementing such nondeterminism in the rules. Keywords: Ambient calculus, operational semantics, type systems, Maude. 1
Coding Mobile Synchronizing Petri Nets into Rewriting Logic”, this paper is electronically
"... Mobile Synchronizing Petri Nets (MSPN’s) are a model for mobility and coordination based on coloured Petri Nets, in which systems are composed of a collection of (possibly mobile) hardware devices and mobile agents, both modelled homogenously. In this paper we approach their verification, for which ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Mobile Synchronizing Petri Nets (MSPN’s) are a model for mobility and coordination based on coloured Petri Nets, in which systems are composed of a collection of (possibly mobile) hardware devices and mobile agents, both modelled homogenously. In this paper we approach their verification, for which we have chosen to code MSPN’s into rewriting logic. In order to obtain a representation of MSPN systems by means of a rewrite theory, we develop a class of them, that we call νAbstract Petri nets (νAPN’s), which are easily representable in that framework. Moreover, the obtained representation provides a local mechanism for fresh name generation. Then we prove that, even if νAPN’s are a particular class of MSPN systems, they are strong enough to capture the behaviour of any MSPN system. We have chosen Maude to implement νAPN’s, as well as the translation from MSPN’s to νAPN’s, for which we make intensive use of its reflective features.
Formal Semantics and Analysis of Component Connectors in Reo
 FOCLASA 2005
, 2005
"... We present an operational semantics for a component composition language called Reo. Reo connectors exogenously compose and coordinate the interactions among individual components that comprise a complex system, into a coherent collaboration. The formal semantics we present here paves the way for ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We present an operational semantics for a component composition language called Reo. Reo connectors exogenously compose and coordinate the interactions among individual components that comprise a complex system, into a coherent collaboration. The formal semantics we present here paves the way for a rigorous study of the behavior of component composition mechanisms. To demonstrate the feasibility of such a rigorous approach, we give a faithful translation of Reo semantics into the Maude term rewriting language. This translation allows us to exploit the rewriting engine and the modelchecking module in the Maude toolset to symbolically run and modelcheck the behavior of Reo connectors.
Techniques for Executing and Reasoning about Specification Diagrams
, 2004
"... Specification Diagrams (SD) [19] are a graphical notation for specifying the message passing behavior of open distributed object systems. SDs facilitate ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Specification Diagrams (SD) [19] are a graphical notation for specifying the message passing behavior of open distributed object systems. SDs facilitate
Communicating Concurrent Objects in HiddenCCS
, 2004
"... In this paper we add valuepassing communication to hiddenCCS, a new formalism proposed in [2] for synchronizing concurrent objects. We use hidden algebra to specify objectoriented systems, and CCS process algebra to describe the coordination aspects. The new specification formalism extends the obj ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we add valuepassing communication to hiddenCCS, a new formalism proposed in [2] for synchronizing concurrent objects. We use hidden algebra to specify objectoriented systems, and CCS process algebra to describe the coordination aspects. The new specification formalism extends the object specification with synchronization and communication elements associated with methods and attributes of the objects, and use a CCS description of the interaction patterns. The operational semantics of hiddenCCS specifications is based on labeled transition systems which can be specified in rewriting logic. We use Maude as a platform for verification of the communicating concurrent objects specified in hiddenCCS. Triple Modular Redundancy is used as an example of a hiddenCCS specification and its verification in Maude.