A new algorithm is introduced for analyzing possible nesting 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.
Complexity of nesting analysis in mobile ambients / C. Braghin, A. Cortesi, R. Focardi, F.L. Luccio, C. Piazza - In: Verification, model checking, and abstract interpretation : 4. International conference, VMCAI 2003 : New York, NY, USA, january 9–11, 2003 : proceedings / [a cura di] L.D. Zuck ... [et al.]. - Berlin : Springer, 2003. - ISBN 9783540003489. - pp. 86-101 (( Intervento presentato al 4. convegno International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI) tenutosi a New York nel 2003.
Complexity of nesting analysis in mobile ambients
C. BraghinPrimo
;
2003
Abstract
A new algorithm is introduced for analyzing possible nesting 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.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
