Files in this item



application/pdfserbanuta-rosu-2010-tr.pdf (755kB)
(no description provided)PDF


Title:KRAM--Extended Report
Author(s):Șerbănuță, Traian Florin; Rosu, Grigore
graph rewriting
rewriting logic
rewriting logic semantics
Abstract:Term rewriting proved to be a simple, uniform and powerful computational paradigm. Rewrite rules independently match and apply anywhere, unconstrained by the context. Rewriting is particularly appealing for defining truly concurrent systems, since rewrite rules can apply in parallel. Unfortunately, there is an inherent impediment in using term rewriting for defining concurrent systems or programming languages: overlapping rewrite rules cannot proceed concurrently. This limitation enforces an interleaving semantics in situations where one may not want it. For example, two threads accessing different regions of memory need to interleave since the corresponding rewrite rules overlap on the memory subterm. Or two message receiving operations of two distributed agents need to interleave since the corresponding rewrite rules overlap on the message pool subterm. This paper presents the concurrent rewrite abstract machine (KRAM), a generalization of term rewriting in which rules explicitly state what can be concurrently shared with other rules, like in graph rewriting. A parallel rewrite relation is defined and proved sound, complete and serializable with respect to conventional rewriting. The KRAM serves as the computational infrastructure of K, an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined, making use of configurations, computations and rules. A series of examples are discussed, including a non-trivial higher-order multi-threaded distributed language; all examples were defined and executed using the K-Maude tool.
Issue Date:2010-09-22
Citation Info:@techreport{serbanuta-rosu-2010-tr, author = {Traian Florin {\c S}erb{\u a}nu{\c t}{\u a} and Grigore Ro{\c s}u }, title = { {KRAM}---Extended Report}, year = {2010}, month = {September}, number = {}, institution = {UIUC} }
Genre:Technical Report
Publication Status:unpublished
Peer Reviewed:not peer reviewed
Date Available in IDEALS:2010-09-22

This item appears in the following Collection(s)

Item Statistics