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.
Partially supported by MIUR Projects “Interpretazione Astratta, Type Systems e Analisi Control-Flow”, and “Modelli formali per la sicurezza”, the EU Contract IST-2001-32617 MyThs, and project “Matematica per le scienze e la tecnologia”, Università di Trieste.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Bodei, P. Degano, F. Nielson, and H. Riis Nielson. Static Analysis for the π-calculus with Applications to Security. Information and Computation, 165:68–92, 2001.
C. Bodei, P. Degano, F. Nielson, and H. Riis Nielson. Control Flow Analysis for the π-calculus. In D. Sangiorgi, R. de Simone, editors, Proc. of International Conference on Concurrency Theory (CONCUR), LNCS 1466, pages 84–98. Springer-Verlag, 1998.
C. Braghin, A. Cortesi, and R. Focardi. Security Boundaries in Mobile Ambients. Computer Languages, Elsevier, 28(1):101–127, Nov. 2002.
C. Braghin, A. Cortesi, and R. Focardi. Control Flow Analysis of Mobile Ambients with Security Boundaries. In B. Jacobs and A. Rensink, editors, Proc. of Fifth Int. Conf. on Formal Methods for Open Object-Based Distributed Systems, pages 197–212. Kluwer Academic Publisher, 2002.
C. Braghin, A. Cortesi, R. Focardi, and S. van Bakel. Boundary Inference for Enforcing Security Policies in Mobile Ambients. In Proc. of The 2nd IFIP International Conference on Theoretical Computer Science (TCS), Kluwer Academic Publisher, pages 383–395, 2002.
L. Cardelli and A.D. Gordon. Mobile Ambients. Theoretical Computer Science (TCS), 240(1):177–213, 2000.
W. Charatonik and J. Talbot. The Decidability of Model Checking Mobile Ambients. In L. Fribourg, editor, Proc. of Annual Conference of the European Association for Computer Science Logic (CSL), LNCS 2142, pages 339–354. Springer-Verlag, 2001.
W. Charatonik, S. Dal Zilio, A.D. Gordon, S. Mukhopadhyay, and J. Talbot. The Complexity of Model Checking Mobile Ambients. In F. Honsell, M. Miculan, eds., Prof. of Int. Conf. on Foundations of Software Science and Computation Structures (FoSSaCS), LNCS 2030, pp. 152–167. Springer, 2001.
W. F. Dowling and J. H. Gallier. Linear-Time Algorithms for Testing the Satisfi ability of Propositional Horn Formulae. Journal of Logic Programming, 3:267–284, 1984.
P. Degano, F. Levi, and C. Bodei. Safe Ambients: Control Flow Analysis and Security. In Jifeng He and Masahiko Sato, editors, Proc. of Advances in Computing Science-6th Asian Computing Science Conference, Penang, Malaysia (ASIAN), LNCS 1961, pp. 199–214. Springer, 2000.
R. R. Hansen, J. G. Jensen, F. Nielson, and H. Riis Nielson. Abstract Interpretation of Mobile Ambients. In A. Cortesi and G. File’, eds., Proc. of Static Analysis Symposium (SAS), LNCS 1694, pp. 134–148. Springer, 1999.
N.D. Jones and S.S. Muchnick. Complexity of flow analysis, inductive assertion synthesis, and a language due to Dijkstra. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 12, pages 380–393. Prentice-Hall, 1981.
W. Landi. Undecidability of static analysis. ACM Letters on Programming Languages and Systems, 1(4):323–337, December 1992.
D.A. McAllester. On the Complexity Analysis of Static Analyses. In A. Cortesi and G. File’, eds., Proc. of Static Analysis Symposium (SAS), LNCS 1694, pp. 312–329. Springer, 1999.
R. Muth and S. K. Debray. On the Complexity of Flow-Sensitive Dataflow Analyses. In Proc. of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 67–80. ACM Press, N.Y., U.S.A., January 2000.
F. Nielson, R. R. Hansen, and H. Riis Nielson. Abstract Interpretation of Mobile Ambients. Science of Computer Programming, Issue on Static Analysis edited by A. Cortesi and G. File’, to appear, 2003.
F. Nielson, H. Riis Nielson, C.L. Hankin. Principles of Program Analysis. Springer, 1999.
F. Nielson, H. Riis Nielson, R. R. Hansen, and J. G. Jensen. Validating Firewalls in Mobile Ambients. In J.C.M. Baeten, S. Mauw, editors, Proc. of International Conference on Concurrency Theory (CONCUR), LNCS 1664, pages 463–477. Springer-Verlag, 1999.
F. Nielson and H. Seidl. Control-flow Analysis in Cubic Time. In D. Sands, ed., Proc. of European Symposium On Programming (ESOP), LNCS 2028, pp. 252–268. Springer, 2001.
F. Nielson, H. Riis Nielson, and H. Seidl. Automatic Complexity Analysis. In D. Le Metayer, ed.,Proc. of European Symposium On Programming (ESOP), LNCS 2305, pp.243–261. Springer, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Braghin, C., Cortesi, A., Focardi, R., Luccio, F.L., Piazza, C. (2003). Complexity of Nesting Analysis in Mobile Ambients. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2003. Lecture Notes in Computer Science, vol 2575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36384-X_10
Download citation
DOI: https://doi.org/10.1007/3-540-36384-X_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00348-9
Online ISBN: 978-3-540-36384-2
eBook Packages: Springer Book Archive