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 language | English |
|---|---|
| Pages (from-to) | 417-425 |
| Number of pages | 9 |
| Journal | Journal of Systems Architecture |
| Volume | 50 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - Jul 2004 |
| Event | Adaptable System/Software Architectures - Las Vegas, NV, United States Duration: Jun 25 2003 → Jun 25 2003 |
Keywords
- Linear logic
- Multiset rewriting
- Program transformation
- Theory of concurrency
ASJC Scopus subject areas
- Software
- Hardware and Architecture