Results 1  10
of
69
The rewriting logic semantics project
 University of Illinois at UrbanaChampaign
, 2005
"... Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding their respective limitations and allowing succinct semantic definitions. The fact that a rewrite logic theory’s axioms incl ..."
Abstract

Cited by 59 (15 self)
 Add to MetaCart
(Show Context)
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding their respective limitations and allowing succinct semantic definitions. The fact that a rewrite logic theory’s axioms include both equations and rewrite rules provides a useful “abstraction dial ” to find the right balance between abstraction and computational 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. Key words: Semantics and analysis of programming languages, rewriting logic 1
Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools
 In Proceedings of the IJCAR 2004. LNCS
, 2004
"... Abstract. Formal semantic definitions of concurrent languages, when specified in a wellsuited semantic framework and supported by generic and efficient formal tools, can be the basis of powerful software analysis tools. Such tools can be obtained for free from the semantic definitions; in our exper ..."
Abstract

Cited by 52 (14 self)
 Add to MetaCart
(Show Context)
Abstract. Formal semantic definitions of concurrent languages, when specified in a wellsuited semantic framework and supported by generic and efficient formal tools, can be the basis of powerful software analysis tools. Such tools can be obtained for free from the semantic definitions; in our experience in just the few weeks required to define a language’s semantics even for large languages like Java. By combining, yet distinguishing, both equations and rules, rewriting logic semantic definitions unify both the semantic equations of equational semantics (in their higherorder denotational version or their firstorder algebraic counterpart) and the semantic rules of SOS. Several limitations of both SOS and equational semantics are thus overcome within this unified framework. By using a highperformance implementation of rewriting logic such as Maude, a language’s formal specification can be automatically transformed into an efficient interpreter. Furthermore, by using Maude’s breadth first search command, we also obtain for free a semidecision procedure for finding failures of safety properties; and by using Maude’s LTL model checker, we obtain, also for free, a decision procedure for LTL properties of finitestate programs. These possibilities, and the competitive performance of the analysis tools thus obtained, are illustrated by means of a concurrent Camllike language; similar experience with Java (source and JVM) programs is also summarized. 1
Equational abstractions
 of LNCS
, 2003
"... Abstract. Abstraction reduces the problem of whether an infinite state system satisfies version. The most common abstractions are quotients of the original system. We present a simple method of defining quotient abstractions by means of equations collapsing the set of states. Our method yields the m ..."
Abstract

Cited by 40 (14 self)
 Add to MetaCart
(Show Context)
Abstract. Abstraction reduces the problem of whether an infinite state system satisfies version. The most common abstractions are quotients of the original system. We present a simple method of defining quotient abstractions by means of equations collapsing the set of states. Our method yields the minimal quotient system together with a set of proof obligations that guarantee its executability and can be discharged with tools such as those in the Maude formal environment.
Specification and Analysis of the AER/NCA Active Network Protocol Suite in Realtime Maude
, 2006
"... This paper describes the application of the RealTime Maude tool and the Maude formal methodology to the specification and analysis of the AER/NCA suite of active network multicast protocol components. Because of the timesensitive and resourcesensitive behavior, the presence of probabilistic algor ..."
Abstract

Cited by 28 (18 self)
 Add to MetaCart
This paper describes the application of the RealTime Maude tool and the Maude formal methodology to the specification and analysis of the AER/NCA suite of active network multicast protocol components. Because of the timesensitive and resourcesensitive behavior, the presence of probabilistic algorithms, and the composability of its components, AER/NCA poses challenging new problems for its formal specification and analysis. RealTime Maude is a natural extension of the Maude rewriting logic language and tool for the specification and analysis of realtime objectbased distributed systems. It supports a wide spectrum of formal methods, including: executable specification; symbolic simulation; breadthfirst search for failures of safety properties in infinitestate systems; and linear temporal logic model checking of timebounded temporal logic formulas. These methods complement those offered by network simulators on the one hand, and timedautomatonbased tools and generalpurpose theorem provers on the other. Our experience shows that RealTime Maude is wellsuited to meet the AER/NCA modeling challenges, and that its methods have proved effective in uncovering subtle and important errors in the informal use case specification.
Specification and analysis of realtime systems using RealTime Maude
 Fundamental Approaches to Software Engineering (FASE 2004), volume 2984 of Lecture Notes in Computer Science
, 2004
"... ..."
(Show Context)
Analyzing rulebased behavioral semantics of visual modeling languages with maude
 IN: PROC. OF SLE 2008
, 2008
"... There is a growing need to explicitly represent the behavioral semantics of Modeling Languages in a precise way, something especially important in industrial environments in which simulation and verification are critical issues. Graph transformation provides one way to specify the semantics of Doma ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
(Show Context)
There is a growing need to explicitly represent the behavioral semantics of Modeling Languages in a precise way, something especially important in industrial environments in which simulation and verification are critical issues. Graph transformation provides one way to specify the semantics of Domain Specific Visual Languages (DSVLs), with the advantage of being intuitive and easy to use for the system designer. Even though its theory has been extensively developed during the last 30 years, it has some limitations concerning specific analysis capabilities. On the contrary, Maude is a rewriting logicbased language with very good formal analysis support, but which requires specialized knowledge. In this paper we show how a mapping between graph transformationbased specifications of DSVL semantics and Maude is possible. This allows performing simulation, reachability and modelchecking analysis on the models, using the tools and techniques that Maude provides.
Formal Modeling and Analysis of the OGDC Wireless Sensor Network Algorithm in Realtime Maude
, 2007
"... This paper describes the application of RealTime Maude to the formal specification, simulation, and further formal analysis of the sophisticated stateoftheart OGDC wireless sensor network algorithm. Wireless sensor networks in general, and the OGDC algorithm in particular, pose many challenges ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
(Show Context)
This paper describes the application of RealTime Maude to the formal specification, simulation, and further formal analysis of the sophisticated stateoftheart OGDC wireless sensor network algorithm. Wireless sensor networks in general, and the OGDC algorithm in particular, pose many challenges to their formal specification and analysis, including novel communication forms, treatment of geographic areas, timedependent and probabilistic features, and the need to analyze both correctness and performance. RealTime Maude extends the rewriting logic tool Maude to support formal specification and analysis of objectbased realtime systems. This paper explains how we formally specified OGDC in RealTime Maude, how we could simulate our specification to perform all the analyses done by the algorithm developers using the network simulation tool ns2, and how we could perform further formal analyses which are beyond the capabilities of simulation tools. A remarkable result is that our RealTime Maude simulations seem to provide a much more accurate estimate of the performance of OGDC than the ns2 simulations. To the best of our knowledge, this is the first time a formal tool has been applied to an advanced wireless sensor network algorithm.
Plan in Maude: Specifying an Active Network Programming Language
 Proc. 4th. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier
, 2002
"... PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative functional programming in an elegant way that allows for recursive, remote function calls, and it provides a clear mechanism f ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
(Show Context)
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative functional programming in an elegant way that allows for recursive, remote function calls, and it provides a clear mechanism for the interaction between host and mobile code. Techniques for specifying and reasoning about such languages are of growing importance. In this paper we describe our specification of PLAN in the rewriting logic language Maude. We show how techniques for specifying the operational semantics of imperative functional programs (syntaxbased semantics) and for formalizing variable binding constructs and mobile environments (CINNI calculus) are used in combination with the natural representation of concurrency and distribution provided by rewriting logic to develop a faithful description of the informal PLAN semantics. We also illustrate the widespectrum approach to formal modeling supported by Maude: executing PLAN programs; analyzing PLAN programs using search and modelchecking; proving properties of particular PLAN programs; and proving general properties of the PLAN language.
The Maude LTL Model Checker and its Implementation
 In Model Checking Software: Proc. 10 th Intl. SPIN Workshop
, 2003
"... A model checker typically supports two different levels of specification: (1) a system specification level, in which the concurrent system to be analyzed is formalized; and (2) a property specification level, in which the properties to be model checked  for example, temporal logic formulae  are ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
(Show Context)
A model checker typically supports two different levels of specification: (1) a system specification level, in which the concurrent system to be analyzed is formalized; and (2) a property specification level, in which the properties to be model checked  for example, temporal logic formulae  are specified. The Maude LTL model checker has been designed with the goal of combining a very expressive and general system specification language (Maude [1]) with an LTL model checking engine that benefits from some of the most recent advances in onthefly explicitstate model checking techniques. Specifically, Maude specifications are executable logical theories in rewriting logic [2], a logic that is a flexible logical framework for expressing a very wide range of concurrency models and distributed systems [2]. A rewrite theory is a triple R = (&Sigma;, E, R), with (&Sigma;, E) an equational theory specifying a system's distributed state structure (for example, a multiset of processes and...