Difference between revisions of "A Truly Concurrent Semantics for the K Framework Based on Graph Transformations"

From FSL
Jump to: navigation, search
m
m (ICGT'12)
Line 1: Line 1:
== ICGT'12 ==
 
 
<pub id='serbanuta-rosu-2012-icgt' template='PubDefaultWithAbstract'></pub>
 
<pub id='serbanuta-rosu-2012-icgt' template='PubDefaultWithAbstract'></pub>

Revision as of 20:31, 16 March 2013

Traian Florin Serbanuta and Grigore Rosu
ICGT'12, LNCS 7562, pp 294-310. 2012
Abstract. This paper gives a truly concurrent semantics with sharing of resources for the K semantic framework, an executable (term-)rewriting-based formalism for defining programming languages and calculi. Akin to graph rewriting rules, the K (rewrite) rules explicitly state what can be concurrently shared with other rules. The desired true concurrency is obtained by translating the K rules into a novel instance of term-graph rewriting with explicit sharing, and then using classical concurrency from the double-pushout (DPO) approach to graph rewriting. The resulting parallel term-rewriting relation is proved sound, complete, and serializable with respect to the jungle rewriting flavor of term-graph rewriting, and, therefore, also to term rewriting.
PDF, ICGT'12, Slides(PDF), BIB

Personal tools
Namespaces

Variants
Actions
Navigation