Results 1 
6 of
6
Executable Tile Specifications for Process Calculi
, 1999
"... . Tile logic extends rewriting logic by taking into account sideeffects and rewriting synchronization. These aspects are very important when we model process calculi, because they allow us to express the dynamic interaction between processes and "the rest of the world". Since rewriting logic is the ..."
Abstract

Cited by 13 (10 self)
 Add to MetaCart
. Tile logic extends rewriting logic by taking into account sideeffects and rewriting synchronization. These aspects are very important when we model process calculi, because they allow us to express the dynamic interaction between processes and "the rest of the world". Since rewriting logic is the semantic basis of several language implementation efforts, an executable specification of tile systems can be obtained by mapping tile logic back into rewriting logic, in a conservative way. However, a correct rewriting implementation of tile logic requires the development of a metalayer to control rewritings, i.e., to discard computations that do not correspond to any deduction in tile logic. We show how such methodology can be applied to term tile systems that cover and extend a wideclass of SOS formats for the specification of process calculi. The wellknown casestudy of full CCS, where the term tile format is needed to deal with recursion (in the form of the replicator operator), is di...
A Calculus of Transformation

, 1994
"... This paper presents the concepts and the semantics of a transformationcalculus TC that is generic wrt. concrete object languages. Built upon an object language description given by theory in higherorder logics (see [Andr 86]), TC provides contextsensitive rules in which requirements on the conte ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
This paper presents the concepts and the semantics of a transformationcalculus TC that is generic wrt. concrete object languages. Built upon an object language description given by theory in higherorder logics (see [Andr 86]), TC provides contextsensitive rules in which requirements on the context of a redex can be imposed, and integrates a restricted form of extended rewriting. Furthermore, rules may be higherorder in order to represent tactical combinators and to model "parametric transformations". This work can be seen as a specification of transformation systems and a foundation for correctnessproofs of transformations.
Action and Change in Rewriting Logic
, 1996
"... Rewriting logic is proposed as a logic of concurrent action and change that solves the frame problem and that subsumes and unifies a number of previous logics of change, including linear logic and Horn logic with equality. Rewriting logic can represent action and change with great flexibility and ge ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
Rewriting logic is proposed as a logic of concurrent action and change that solves the frame problem and that subsumes and unifies a number of previous logics of change, including linear logic and Horn logic with equality. Rewriting logic can represent action and change with great flexibility and generality; this flexibility is illustrated by many examples, including examples that show how concurrent objectoriented systems are naturally represented. In addition, rewriting logic has a simple formalism, with only a few rules of deduction; it supports userdefinable logical connectives, which can be chosen to fit the problem at hand; it is intrinsically concurrent; and it is realizable in a wide spectrum logical language (Maude and its MaudeLog extension) supporting executable specification and programming. Contents 1 Introduction 2 1.1 What the frame problem (in our sense) is . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 What the frame problem (in our sense) is not . . . . . . ....
Learning based programming
, 2011
"... ... responded to the questionnaire, including varying levels of experience in ML and LBJ. They also applied LBJ on different tasks ranging in complexity. Simpler tasks tended to lead to a positive evaluation of LBJ, while those who required more advanced ML techniques, especially structured represen ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
... responded to the questionnaire, including varying levels of experience in ML and LBJ. They also applied LBJ on different tasks ranging in complexity. Simpler tasks tended to lead to a positive evaluation of LBJ, while those who required more advanced ML techniques, especially structured representations, found LBJ lacking. The case studies came to a similar conclusion while uncovering situations in which LBJ’s syntactic sugar could have encoded specifications more succinctly, as well as specific pieces of syntax that attempted to patch LBJ’s limitations. The results of our evaluation show that LBJ leaves something to be desired; in particular, it cannot naturally specify an arbitrary CCM. As such, we present our second offering in the LBP line: a general purpose programming language called the Constrained Conditional Model Processing language and designed from the ground up to support CCMs. We also present a formal semantics for CCMP specified in the language of rewriting logic and consider several interesting test cases. CCMP is a robust and flexible solution for structured learning techniques at both trainingtime and inferencetime.
Notes on PAlgebra (1): Process Structures
, 1995
"... We develop an elementary theory of process structure, a mathematical object which is intended to capture a basic aspect of concurrent processes in a simple way. It has two kinds of presentations: one underlies many extant process theories and another has a more geometric flavour. We prove these are ..."
Abstract
 Add to MetaCart
We develop an elementary theory of process structure, a mathematical object which is intended to capture a basic aspect of concurrent processes in a simple way. It has two kinds of presentations: one underlies many extant process theories and another has a more geometric flavour. We prove these are essentially equivalent. The theory forms a basis of Palgebra, a general semantic structure for concurrent processes. 1 Introduction The aim of the present notes is to develop an elementary theory of process structure, a mathematical object which is intended to capture a basic aspect of concurrent processes in a simple way. It has two kinds of presentations: one underlies many extant process theories and another has a more geometric flavour. We prove there are essentially equivalent. The theory forms a basis of Palgebra, a general semantic structure for concurrent processes, to be developed in the sequels to the present notes. While we leave discussions on the overall motivations underlyin...