ABSTRACT
Advancements in network-aware computing has prompted the study of novel programming languages with advanced programming abstractions to support various forms of mobility and to coordinate and monitor the use of resources. This work addresses the issue of designing debuggers for network-aware programming languages. In our approach a debugger is viewed as being an extension of the underlying programming language with suitable debugging abstractions. We apply this idea to Cardelli and Gordon's Ambient Calculus [3]. The resulting debugger is designed to monitor and trace executions of mobile ambients by keeping track of causal informations about events of computations.
- 1.J. Baeten, J., Bergstra. Global Renaming Operators in Concrete Process Algebra. Info&Comp. 78 (3), 205-245, 1988.]] Google ScholarDigital Library
- 2.Bernstein, K. and Stark, E.: Operational semantics of a focussing debugger", MFPS'95, ENTCS (1),]]Google Scholar
- 3.L. Cardelli, A. Gordon. Mobile Ambients. Theoretical Computer Science, 240 (1) pp. 177-213, 2000.]] Google ScholarDigital Library
- 4.F. da Silva. Correctness proofs of compilers and debuggers: an approach based on structural operational semantics. PhD Thesis, University Edinburgh, LFCS, 1991.]]Google Scholar
- 5.P. Degano, C. Priami, L. Leth, B. Thomsen Causality for debugging mobile agents. Acta Informatica 36, 353-374, 1999,]]Google ScholarCross Ref
- 6.R. De Nicola, G. L. Ferrari, R. Pugliese. Klaim: Kernel Language for Agents Interaction and Mobility, Theoretical Computer Science, 238 (1-2) pp. 389-437, 2000.]] Google ScholarDigital Library
- 7.A. Kishon, P. Hudak, C. Consel. Monitoring semantics: a formal framework for specifying and reasoning about execution monitors. Proc. ACM SIGPLAN'91, Conf. on Progr. Lang. Design and Impl., 338-352, ACM Press 1991.]] Google ScholarDigital Library
- 8.C. Fournet, G. Gonthier, J.J L6vy, L. Maranget, D. R6my. A Calculus of Mobile Agents, LNCS pp. 406-421, Springer, 1996.]] Google ScholarDigital Library
- 9.M. Hennessy, J. Riely. Type-safe execution of mobile agents in anonymous networks. LNCS 1603, pp.95-115, 1999, Springer, 1999.]] Google ScholarDigital Library
- 10.P. Sewell, P. Wojciechowski, B. Pierce. Location-Independent Communication for Mobile Agents: a Two-Level Architecture. LNCS 1686, pp.l-31, Springer, 1999.]] Google ScholarDigital Library
- 11.J. Vitek, G. Castagua. Towards a Calculus of Secure Mobile Computations. LNCS 1686, pp. 44-77, Springer, 1999.]] Google ScholarDigital Library
Index Terms
A debugging calculus for mobile ambients
Recommendations
The Decidability of Model Checking Mobile Ambients
CSL '01: Proceedings of the 15th International Workshop on Computer Science LogicThe ambient calculus is a formalism for describing the mobility of both software and hardware. The ambient logic is a modal logic designed to specify properties of distributed and mobile computations programmed in the ambient calculus. In this paper we ...
The Calculus of Context-aware Ambients
We present the Calculus of Context-aware Ambients (CCA in short) for the modelling and verification of mobile systems that are context-aware. This process calculus is built upon the calculus of mobile ambients and introduces new constructs to enable ...
Probabilistic Mobile Ambients
The calculus of Mobile Ambients has been introduced for expressing mobility and mobile computation. In this paper we present a probabilistic version of Mobile Ambients by augmenting the syntax of the original Ambient Calculus with a (guarded) ...
Comments