Advertisement

A Parametric Model for the Analysis of Mobile Ambients

  • Dino Distefano
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3780)

Abstract

In this paper we propose a new parametric abstract finite model of Mobile Ambients able to express several properties on processes. The model can be used for the analysis of these properties by means of model checking techniques. The precision of the model can be increased by modifying certain numeric parameters increasingly avoiding thereby the occurrences of false counterexamples in the analysis.

Keywords

Model Check Canonical Form Pointer Structure Abstract Interpretation Model Check Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Braghin, C., Cortesi, A., Focardi, R.: Control flow analysis of mobile ambients with security boundaries. In: Jacobs, B., Rensink, A. (eds.) FMOODS 2002, pp. 197–212. Kluwer, Dordrecht (2002)Google Scholar
  2. 2.
    Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  3. 3.
    Cardelli, L., Gordon, A.D.: Anytime, anywhere: Modal logics for mobile ambients. In: POLP 2000, pp. 365–377. ACM Press, New York (2000)Google Scholar
  4. 4.
    Caires, L.: Behavioral and spatial observations in a logic for π-calculus. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 72–89. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Caires, L., Cardelli, L.: A spatial logic for concurrency (part I). Inf. and Comp. 186(2), 194–235 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Charatonik, W., Gordon, A.D., Talbot, J.-M.: Finite-control mobile ambients. In: Le Métayer, D. (ed.) ESOP 2002. LNCS, vol. 2305, pp. 295–313. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In: POPL 1977, pp. 238–252. ACM, New York (1977)CrossRefGoogle Scholar
  8. 8.
    Degano, P., Levi, F., Bodei, C.: Safe ambients: Control flow analysis and security. In: He, J., Sato, M. (eds.) ASIAN 2000. LNCS, vol. 1961, pp. 199–214. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  9. 9.
    Distefano, D.: On model checking the dynamics of object-based software: a foundational approach. PhD thesis, University of Twente (November 2003)Google Scholar
  10. 10.
    Distefano, D.: A parametric model for the analysis of mobile ambients. Full version with proofsGoogle Scholar
  11. 11.
    Distefano, D., Katoen, J.-P., Rensink, A.: Who is pointing when to whom? on the automated verification of linked list structures. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 250–262. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  12. 12.
    Distefano, D., Rensink, A., Katoen, J.-P.: Who is pointing when to whom: on model-checking pointer structures. Tech. Report TR-CTIT-03-12, University of Twente (2003)Google Scholar
  13. 13.
    Hansen, R.R., Jensen, J.G., Nielson, F., Nielson, H.R.: Abstract interpretation of mobile ambients. In: Cortesi, A., Filé, G. (eds.) SAS 1999. LNCS, vol. 1694, pp. 134–148. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  14. 14.
    Levi, F., Maffeis, S.: An abstract interpretation framework for analysing mobile ambients. In: Cousot, P. (ed.) SAS 2001. LNCS, vol. 2126, pp. 395–411. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  15. 15.
    Levi, F., Sangiorgi, D.: Controlling interference in ambients. In: POPL 2000, pp. 352–364. ACM Press, New York (2000)CrossRefGoogle Scholar
  16. 16.
    Lichtenstein, O., Pnueli, A.: Checking that finite state concurrent programs satisfy their linear specification. In: POPL 1985, pp. 97–107. ACM, New York (1985)CrossRefGoogle Scholar
  17. 17.
    Montanari, U., Pistore, M.: An introduction to history-dependent automata. In: Gordon, A., Pitts, A., Talcott, C. (eds.) HOOTS II. ENTCS, vol. 10. Elsevier Science Publishers, Amsterdam (1997)Google Scholar
  18. 18.
    Nielson, F., Nielson, H.R., Hansen, R.R., Jensen, J.G.: Validating farewalls in mobile ambients. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 463–477. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  19. 19.
    Pnueli, A.: The temporal logic of programs. In: Proceedings FOCS 1977, pp. 46–57. IEEE Computer Society Press, Los Alamitos (1977)Google Scholar
  20. 20.
    Sagiv, M., Reps, T., Wilhelm, R.: Solving shape-analysis problems in languages with destructive updating. TOPLAS 20(1), 1–50 (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Dino Distefano
    • 1
  1. 1.Department of Computer ScienceQueen Mary, University of London 

Personalised recommendations