Results 1  10
of
18
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 58 (15 self)
 Add to MetaCart
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 53 (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
Executable Structural Operational Semantics in Maude
, 2003
"... This paper describes in detail how to bridge the gap between theory and practice when implementing in Maude structural operational semantics described in rewriting logic, where transitions become rewrites and inference rules become conditional rewrite rules with rewrites in the conditions, as mad ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
This paper describes in detail how to bridge the gap between theory and practice when implementing in Maude structural operational semantics described in rewriting logic, where transitions become rewrites and inference rules become conditional rewrite rules with rewrites in the conditions, as made possible by the new features in Maude 2.0. We validate this technique using it in several case studies: a functional language Fpl (evaluation and computation semantics, including an abstract machine), imperative languages WhileL (evaluation and computation semantics) and GuardL with nondeterminism (computation semantics), Kahn's functional language MiniML (evaluation or natural semantics), Milner's CCS (with strong and weak transitions), and Full LOTOS (including ACT ONE data type specifications). In addition, on top of CCS we develop an implementation of the HennessyMilner modal logic for describing local capabilities of processes, and for LOTOS we build an entire tool where Full LOTOS specifications can be entered and executed (without user knowledge of the underlying implementation of the semantics). We also compare this method based on transitions as rewrites with another one based on transitions as judgements.
Implementing CCS in Maude 2
 Proceedings Fourth International Workshop on Rewriting Logic and its Applications, WRLA 2002
, 2002
"... This paper describes in detail how to bridge the gap between theory and practice in a new implementation of the CCS operational semantics in Maude, where transitions become rewrites and inference rules become conditional rewrite rules with rewrites in the conditions, as made possible by the new feat ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
This paper describes in detail how to bridge the gap between theory and practice in a new implementation of the CCS operational semantics in Maude, where transitions become rewrites and inference rules become conditional rewrite rules with rewrites in the conditions, as made possible by the new features in Maude 2.0. We implement both the usual transition semantics and the weak transition semantics where internal actions are not observed, and on top of them we also implement the HennessyMilner modal logic for describing processes. We compare this implementation with a previous one where transitions become judgements and inference rules become rewrites, and also comment on extensions to the LOTOS language.
LOTOS Symbolic Semantics in Maude
 Dpto. Sistemas Informáticos y Programación, Universidad Complutense de
, 2002
"... We present a formal tool where LOTOS specifications without restrictions in their data types can be executed. The reflective feature of rewriting logic and the metalanguage capabilities of Maude make it possible to implement the whole tool in the same semantic framework, and have allowed us to imple ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We present a formal tool where LOTOS specifications without restrictions in their data types can be executed. The reflective feature of rewriting logic and the metalanguage capabilities of Maude make it possible to implement the whole tool in the same semantic framework, and have allowed us to implement the LOTOS semantics and to build an entire environment with parsing, pretty printing, and input/output processing of LOTOS specifications.
A tool for Full LOTOS in Maude
 Dpto. Sistemas Informáticos y Programación, Universidad Complutense de
, 2002
"... We describe a formal tool based on a symbolic semantics for Full LOTOS, where specifications without restrictions in their data types can be executed. The reflective feature of rewriting logic and the metalanguage capabilities of Maude make it possible to implement the whole tool in the same semanti ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We describe a formal tool based on a symbolic semantics for Full LOTOS, where specifications without restrictions in their data types can be executed. The reflective feature of rewriting logic and the metalanguage capabilities of Maude make it possible to implement the whole tool in the same semantic framework, and have allowed us to implement the LOTOS operational semantics, to integrate it with ACT ONE specifications, and to build an entire environment with parsing, pretty printing, and input/output processing of LOTOS specifications. Our aim has been to implement a formal tool that can be used by everyone without knowledge of the concrete implementation, but where the semantics representation is at so high level that can be understood and modified by everyone that knows about operational semantics.
Reniers, Prototyping SOS metatheory in Maude
 PROCEEDINGS OF THE SECOND WORKSHOP ON STRUCTURAL OPERATIONAL SEMANTICS (SOS 2005), ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE
, 2005
"... We present a prototype implementation of SOS metatheory in the Maude term rewriting language. The prototype defines the basic concepts of SOS metatheory (e.g., transition formulae, deduction rules and transition system specifications) in Maude. Besides the basic definitions, we implement methods f ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
We present a prototype implementation of SOS metatheory in the Maude term rewriting language. The prototype defines the basic concepts of SOS metatheory (e.g., transition formulae, deduction rules and transition system specifications) in Maude. Besides the basic definitions, we implement methods for checking the premises of some SOS metatheorems (e.g., GSOS congruence metatheorem) in this framework. Furthermore, we define a generic strategy for animating programs and models for semantic specifications in our metalanguage. The general goal of this line of research is to develop a generalpurpose tool that assists language designers by checking useful properties about the language under definition and by providing a rapid prototyping environment for scrutinizing the actual behavior of programs according to the defined semantics.
Rewriting Logic based Approach for the Formalization of Critical Systems based on MultiAgent System
"... The agentoriented paradigm is an emerging technology, which has significant and growing interest, particularly through its ability to be used in the modeling of all types of systems and representation of knowledge. However, this potentiality should not hide the difficulties associated with them in ..."
Abstract
 Add to MetaCart
(Show Context)
The agentoriented paradigm is an emerging technology, which has significant and growing interest, particularly through its ability to be used in the modeling of all types of systems and representation of knowledge. However, this potentiality should not hide the difficulties associated with them in the design and verification, which may cause the scientific credibility of multiagent modeling field, especially for the case of embedded and critical systems. In this paper, we propose a new formal approach based on rewriting logic, in which we attempt to bridge the gap between agent based system analysis and its specification In addition, our approach includes a wellknown and effective verification technique, model checking, and allows independent of the used formalism to verify an important number of properties deemed relevant on critical system based on agent paradigm.
Towards the Formal Specification and Verification of Multiagent Based Systems
"... This article is directed primarily at the problem of developing a more reliable multiagent based systems, because the paradigm of multiagent systems, which offers an original way of modeling, is considered as an appropriate method that faces the problem of modeling, and it is present in the most o ..."
Abstract
 Add to MetaCart
(Show Context)
This article is directed primarily at the problem of developing a more reliable multiagent based systems, because the paradigm of multiagent systems, which offers an original way of modeling, is considered as an appropriate method that faces the problem of modeling, and it is present in the most of sectors: telecommunications, finance, Internet, energy, health, embedded systems... etc. Therefore, it is crucial to have rigorous, automatic and effective design and checking methods to ensure their development. The main objective of this paper is to present and discuss a new approach for the formal specification and verification of agent based modeling system. In addition, our approach is based on rewriting logic, includes a wellknown and effective verification technique, model checking, and allows independent of the used formalism to verify a large set of interesting properties deemed relevant on multiagent based system.