A Trully Concurrent Semantics for the K Framework Based on Graph Transformations

نویسندگان

  • Traian Florin
  • Grigore Ros
چکیده

This paper gives a truly concurrent semantics with sharing of resources for the K semantic framework, an executable (term-)rewritingbased 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.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Concurrent Semantics of Algebraic Graph Transformations

Graph transformation systems are widely recognized as a powerful formalism for the specification of concurrent and distributed systems. Therefore, the need emerges naturally of developing formal concurrent semantics for graph transformation systems allowing for a suitable description and analysis of their computational properties. The aim of this chapter is to review and compare various concurr...

متن کامل

Composition of Transformations: A Framework for Systems with Dynamic Topology

In graph-based systems there are many methods to compose (possibly different) graphs. However, none of these usual compositions are adequate to naturally express semantics of systems with dynamic topology, i.e., systems whose topology admits successive transformations through its computation. We constructed a categorical semantic domain for graph based systems with dynamic topology using a new ...

متن کامل

Concurrent derivations as single pushout graph grammar processes

Algebraic graph transformations visually support intuition, have a strong theoretical basis, and provide a formal, implementation independent basis for the description of discretely evolving computational systems and their formal and tractable analysis. Graph grammar models of concurrent systems (petri nets, actor systems) have inspired corresponding semantics developments. Recently this led to...

متن کامل

Towards Using Constructive Type Theory for Verifiable Modular Transformations

Model transformations have been studied for some time, typically using a semantics based on graph transformations. This has been very successful in defining, optimising and executing model transformations, but has been less useful for providing a firm semantic basis for modular, reusable transformations. We propose a novel rendering of transformation semantics in terms of constructive type theo...

متن کامل

A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs

A number of novel programming languages and libraries have been proposed that offer simpler-to-use models of concurrency than threads. It is challenging, however, to devise execution models that successfully realise their abstractions without forfeiting performance or introducing unintended behaviours. This is exemplified by Scoop—a concurrent object-oriented message-passing language—which has ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012