A new algorithm is introduced for analyzing possible nestings in mobile ambient calculus. It improves both time and space complexities of the technique proposed by Nielson and Seidl. The improvements are achieved by enhancing the data structure representations, and by reducing the computation to the control flow analysis constraints that are effectively necessary to get to the least solution. These theoretical results are also supported by experimental tests run on a Java-based tool that implements a suite of algorithms for nesting analysis of mobile ambients.
|Titolo:||Nesting analysis of mobile ambients|
|Data di pubblicazione:||2004|
|Appare nelle tipologie:||2.1 Articolo su rivista |
File in questo prodotto:
|comlan2004.pdf||Documento in Post-print||Accesso chiuso-personale||Riservato|