Abstract
The need for formal methods for certifying the good behaviour of computer software is dramatically increasing with the growing complexity of the latter. Moreover, in the global computing framework one must face the additional issues of concurrency and mobility. In the recent years many new process algebras have been introduced in order to reason formally about these problems; the common pattern is to specify a type system which allows one to discriminate between “good” and “bad” processes. In this paper we focus on an incremental type system for a variation of the Ambient Calculus called M 3, i.e., Mobility types for Mobile processes in Mobile ambients and we formally prove its soundness in the proof assistant Coq.
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
Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)
Church, A.: A formulation of the simple theory of types. Journal of Symbolic Logic 5, 56–68 (1940)
Coppo, M., Dezani-Ciancaglini, M., Giovannetti, E., Salvo, I.: M3: Mobility types for mobile processes in mobile ambients. In: Proceedings of CATS’2003. ENTCS, vol. 78, Springer, Heidelberg (2003)
Despeyroux, J., Felty, A., Hirschowitz, A.: Higher-order syntax in Coq. In: Ayache, N. (ed.) CVRMed 1995. LNCS, vol. 905, Springer, Heidelberg (1995); Also appears as INRIA research report RR-2556 (April 1995)
Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. J. ACM 40(1), 143–184 (1993)
Honsell, F., Miculan, M., Scagnetto, I.: An axiomatic approach to metareasoning on systems in higher-order abstract syntax. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 963–978. Springer, Heidelberg (2001), http://www.dimi.uniud.it/~miculan/Papers/
Honsell, F., Miculan, M., Scagnetto, I.: π-calculus in (co)inductive type theory. Theoretical computer science (2), 239–285 (2001); First appeared as a talk at TYPES 1998 annual workshop
INRIA. The Coq Proof Assistant Reference Manual - Version 7.4. INRIA, Rocquencourt, France (February 2003), Available at ftp://ftp.inria.fr/INRIA/coq/V7.4/doc
Martin-Löf, P.: On the meaning of the logical constants and the justifications of the logic laws. Technical Report 2, Dipartimento di Matematica, Universit‘a di Siena (1985)
Miculan, M., Scagnetto, I.: Ambient calculus and its logic in the calculus of inductive constructions. In: Proceedings of LFM 2002. ENTCS, vol. 70.2, Elsevier, Amsterdam (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Honsell, F., Scagnetto, I. (2004). Mobility Types in Coq. In: Berardi, S., Coppo, M., Damiani, F. (eds) Types for Proofs and Programs. TYPES 2003. Lecture Notes in Computer Science, vol 3085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24849-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-24849-1_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22164-7
Online ISBN: 978-3-540-24849-1
eBook Packages: Springer Book Archive