A model of runtime transformation for distributed systems based on directed acyclic graph model

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

This paper presents a formal model of runtime program transformation to optimize concurrent processes during executions based on a new representation of the scopes of names in distributed systems. We represent a site in a distributed system and the scopes of the local names in the site using a directed acyclic graph. It is possible to represent local names that their scope are not nested in a site in the model. Local names with overlapping scopes make possible to formalize folding transformation of process definitions for runtime program transformation. Computations in the system are represented with inferences on multisets of formulas of linear logic. We define rewriting system of directed acyclic graphs as the operational semantics of our model based on inference rules for linear logic. Each of the steps for runtime transformations are also represented using a rewriting for directed acyclic graphs.

Original languageEnglish
Pages (from-to)417-425
Number of pages9
JournalJournal of Systems Architecture
Volume50
Issue number7
DOIs
Publication statusPublished - Jul 2004

Fingerprint

Semantics

Keywords

  • Linear logic
  • Multiset rewriting
  • Program transformation
  • Theory of concurrency

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this

A model of runtime transformation for distributed systems based on directed acyclic graph model. / Murakami, Masaki.

In: Journal of Systems Architecture, Vol. 50, No. 7, 07.2004, p. 417-425.

Research output: Contribution to journalArticle

@article{1890a4189cc248bd8a5a05d9c41abf4e,
title = "A model of runtime transformation for distributed systems based on directed acyclic graph model",
abstract = "This paper presents a formal model of runtime program transformation to optimize concurrent processes during executions based on a new representation of the scopes of names in distributed systems. We represent a site in a distributed system and the scopes of the local names in the site using a directed acyclic graph. It is possible to represent local names that their scope are not nested in a site in the model. Local names with overlapping scopes make possible to formalize folding transformation of process definitions for runtime program transformation. Computations in the system are represented with inferences on multisets of formulas of linear logic. We define rewriting system of directed acyclic graphs as the operational semantics of our model based on inference rules for linear logic. Each of the steps for runtime transformations are also represented using a rewriting for directed acyclic graphs.",
keywords = "Linear logic, Multiset rewriting, Program transformation, Theory of concurrency",
author = "Masaki Murakami",
year = "2004",
month = "7",
doi = "10.1016/j.sysarc.2003.09.009",
language = "English",
volume = "50",
pages = "417--425",
journal = "Journal of Systems Architecture",
issn = "1383-7621",
publisher = "Elsevier",
number = "7",

}

TY - JOUR

T1 - A model of runtime transformation for distributed systems based on directed acyclic graph model

AU - Murakami, Masaki

PY - 2004/7

Y1 - 2004/7

N2 - This paper presents a formal model of runtime program transformation to optimize concurrent processes during executions based on a new representation of the scopes of names in distributed systems. We represent a site in a distributed system and the scopes of the local names in the site using a directed acyclic graph. It is possible to represent local names that their scope are not nested in a site in the model. Local names with overlapping scopes make possible to formalize folding transformation of process definitions for runtime program transformation. Computations in the system are represented with inferences on multisets of formulas of linear logic. We define rewriting system of directed acyclic graphs as the operational semantics of our model based on inference rules for linear logic. Each of the steps for runtime transformations are also represented using a rewriting for directed acyclic graphs.

AB - This paper presents a formal model of runtime program transformation to optimize concurrent processes during executions based on a new representation of the scopes of names in distributed systems. We represent a site in a distributed system and the scopes of the local names in the site using a directed acyclic graph. It is possible to represent local names that their scope are not nested in a site in the model. Local names with overlapping scopes make possible to formalize folding transformation of process definitions for runtime program transformation. Computations in the system are represented with inferences on multisets of formulas of linear logic. We define rewriting system of directed acyclic graphs as the operational semantics of our model based on inference rules for linear logic. Each of the steps for runtime transformations are also represented using a rewriting for directed acyclic graphs.

KW - Linear logic

KW - Multiset rewriting

KW - Program transformation

KW - Theory of concurrency

UR - http://www.scopus.com/inward/record.url?scp=2942547651&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=2942547651&partnerID=8YFLogxK

U2 - 10.1016/j.sysarc.2003.09.009

DO - 10.1016/j.sysarc.2003.09.009

M3 - Article

AN - SCOPUS:2942547651

VL - 50

SP - 417

EP - 425

JO - Journal of Systems Architecture

JF - Journal of Systems Architecture

SN - 1383-7621

IS - 7

ER -