Rewriting logic is a simple computational logic that can naturally express both concurrent
computation and logical deduction with great generality. This paper provides a gentle …

The theory and applications of rewriting logic have been vigorously developed by
researchers all over the world during the past eleven years. The attached bibliography …

This chapter describes some existing Maude-based tools that are available for download.
The first section describes tools concerned with analysis of either Maude specifications, or of …

We present the Tom language that extends Java with the purpose of providing high level
constructs inspired by the rewriting community. Tom furnishes a bridge between a general …

Nominal rewriting is based on the observation that if we add support for α-equivalence to
first-order syntax using the nominal-set approach, then systems with binding, including …

ELAN implements computational systems, a concept that combines two first class entities:
rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to …

The value of the b quark mass at the MZ scale defined in the MS renormalization scheme,
mb (MZ), was determined using 2.8 million hadronic Z decays collected during 1992-1994 …

We describe a metamodel for access control, designed to take into account the specific
requirements of distributed environments. We see a distributed system consisting of several …

Pure pattern calculus supports pattern-matching functions in which patterns are first-class
citizens that can be passed as parameters, evaluated and returned as results. This new …

Recently rule based languages focussed on the use of rewriting as a modeling tool which
results in making specifications executable. To extend the modeling capabilities of rule …