Applying a testing approach to the Calculus of Fair Ambients

References

• Boreale , M. and de Nicola , R. 1995 . Testing equivalence for mobile processes . Inform. Comput. , 120 : 279 – 303 .
   Google Scholar
• Cardelli , L. 1999 . “ Abstraction for mobile computation ” . In Proceedings of Secure Internet Programming 1999 , Vol. 1603 , 51 – 94 . Springer, Berlin . Lecture Notes in Computer Science
   Google Scholar
• Cardelli , L. and Gordon , A. 1999 . “ Types for mobile ambients ” . In Proceedings of POPL’99 , 79 – 92 . New York : ACM Press .
   Google Scholar
• Cardelli , L. and Gordon , A. 2000 . “ Anytime, anywhere: modal logics for mobile ambients ” . In Proceedings of POPL’00 , 365 – 377 . New York : ACM Press .
   Google Scholar
• Cardelli , L. and Gordon , A. 2000 . Mobile ambients . Theoret. Comput. Sci. , 240 : 177 – 213 .
   Google Scholar
• Cardelli , L. , Ghelli , G. and Gordon , A. 2002 . Types for the ambient calculus . Inform. Comput. , 177 : 60 – 194 .
   Google Scholar
• de Nicola , R. and Hennessy , M. 1984 . Testing equivalences for processes . Theoret. Comput. Sci. , 34 : 83 – 133 .
   Google Scholar
• Deng , Y. , van Glabbeek , R. , Hennessy , M. , Morgan , C. and Zhang , C. 2007 . “ Characterising testing preorders for finite probabilistic processes ” . In Proceedings of LICS’07 , 313 – 325 . Silver Spring, MD : IEEE Computer Society .
   Google Scholar
• Fu , Y. 2002 . Testing congruence for mobile processes . J. Comput. Sci. Technol. , 17 : 73 – 82 .
   Google Scholar
• Fu , Y. 2005 . On quasi open bisimulation . Theoret. Comput. Sci. , 338 : 96 – 126 .
   Google Scholar
• Fu , Y. 2007 . Fair ambients . Acta Informatica , 43 : 535 – 594 .
   Google Scholar
• Fu , Y. and Lu , H. 2009 . On the expressiveness of interaction . Working paper, Available at http://basics.sjtu.edu.cn/nyuxi/papers/expressiveness_of_interaction.pdf
   Google Scholar
• Gordon , A. and Cardelli , L. 2003 . Equational properties of mobile ambients . Math. Struct. Comput. Sci. , 13 : 371 – 408 .
   Google Scholar
• Guan , X. , Yang , Y. and You , J. 2001 . Typing evolving ambients . Inform. Process. Lett. , 80 : 265 – 270 .
   Google Scholar
• Kato , T. 2007 . An equivalence relation for the typed ambient calculus . IPSJ Digital Courier , 3 : 369 – 390 .
   Google Scholar
• Levi , F. and Sangiorgi , D. 2000 . “ Controlling interference in ambients ” . In Proceedings of POPL’00 , 352 – 364 . New York : ACM Press .
   Google Scholar
• Merro , M. and Hennessy , M. 2002 . “ Bisimulation congruences in safe ambients ” . In Proceedings of POPL’02 , 71 – 80 . ACM Press, New York .
   Google Scholar
• Merro , M. and Hennessy , M. 2006 . A bisimulation-based semantic theory of safe ambients . ACM Trans. Programm. Lang. Syst. , 28 : 290 – 330 .
   Google Scholar
• Merro , M. and Zappa Nardelli , F. 2003 . “ Bisimulation proof methods for mobile ambients ” . In Proceedings of ICALP’03 , Vol. 2179 , 584 – 598 . Berlin : Lecture Notes in Computer Science, Springer .
   Google Scholar
• Milner , R. 1990 . “ Functions as processes ” . In Tech. Rep , Vol. 1154 , Sophia, , Antipolis, France : INRIA .
   Google Scholar
• Milner , R. , Parrow , J. and Walker , D. 1992 . A calculus of mobile processes (part i and part ii) . Inform. Comput. , 100 : 1 – 77 .
   Google Scholar
• Rathke , J. and Sobocinski , P. 2008 . Deriving structural labelled transitions for mobile ambients , Vol. 5201 , 462 – 476 . Berlin : Lecture Notes in Computer Science . Proceedings of CONCUR’08, Springer
   Google Scholar
• Sangiorgi , D. and Walker , D. 2001 . On barbed equivalence in π-calculus , Vol. 2154 , 292 – 304 . Berlin : Lecture Notes in Computer Science . Proceedings of CONCUR’01, Springer
   Google Scholar
• Teller , D. , Zimmer , P. and Hirschkoff , D. 2002 . Using ambients to control resources , Vol. 2421 , 288 – 303 . Berlin : Lecture Notes in Computer Science . Proceedings of CONCUR’02, Springer
   Google Scholar
• Vigliotti , M. and Phillips , I. 2002 . Barbs and congruences for safe mobile ambients . Electronic Notes in Theoretical Computer Science , 66 : 37 – 51 .
   Google Scholar