|
Formal Methods in Computing (Most of the papers antecedent to 1995 are not included in the list) |
|||
| FRAMES NO FRAME | ||||
| Barbanera-deLiguoro:COMETA-03 (In proceedings) | |
| Author(s) | Franco Barbanera and Ugo de' Liguoro |
| Title | « Type Assignement for Mobile Objects » |
| In | Proc. of COMETA'03 |
| Series | ENTCS |
| Page(s) | 25-38 |
| Year | 2004 |
| Publisher | Elsevier |
| Abstract | |
| We address the problem of formal reasoning about mobile code. We consider an Ambient Calculus, where process syntax includes constructs for sequential programming. For the sake of concreteness, and because of practical relevance, we consider objects using message exchange to implement method invocation and overriding. The contribution of the paper is a type assignment system, obtained by combination of systems for MA and for the Sigma-calculus. We exploit in the mobility framework a typical feature of the intersection type discipline for object calculi, namely late typing of self. The proposed system is then checked against standard properties of related systems, establishing type invariance a completeness theorems. | |
Download the complete article:
| BibTeX code |
@inproceedings{Barbanera-deLiguoro:COMETA-03,
author = {Franco Barbanera and Ugo de' Liguoro},
series = {ENTCS},
booktitle = {{Proc. of COMETA'03}},
localfile = {http://www.di.unito.it/~deligu/papers/BdL03.pdf},
title = {{Type Assignement for Mobile Objects}},
abstract = {We address the problem of formal reasoning about mobile code. We
consider an Ambient Calculus, where process syntax includes
constructs for sequential programming. For the sake of
concreteness, and because of practical relevance, we consider
objects using message exchange to implement method invocation and
overriding. The contribution of the paper is a type assignment
system, obtained by combination of systems for MA and for the
Sigma-calculus. We exploit in the mobility framework a typical
feature of the intersection type discipline for object calculi,
namely late typing of self. The proposed system is then checked
against standard properties of related systems, establishing type
invariance a completeness theorems.},
tag = {{COMETA'03}},
publisher = {Elsevier},
pages = {25-38},
year = {2004},
}
|
Formal Methods in Computing (Most of the papers antecedent to 1995 are not included in the list) |
|||
| FRAMES NO FRAME | ||||
This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)
