Abstract
This paper presents a type inference system for a primitive actor calculus (Cap) based on set-constraints resolution. In contrast with concurrent objects, actors can change dynamically their interface (the set of messages they can handle). Therefore, the Cap calculus reduction rules can lead to orphan messages which will never be handled. The aim of the inference system is to detect statically many orphan messages and to produce information leading to the dynamic detection of the others. In this purpose, we define a flattening operation which abstracts the various behaviors of an actor. This static analysis is based on Aiken and Wimmers set-constraints resolution. It gives slightly better results than Vasconcelos or Yonezawa kinded types based analysis for concurrent objects.
Chapter PDF
Similar content being viewed by others
References
Agha, G.: 1986, Actors: A model of concurrent computation in distributed systems, MIT Press, Cambridge, Mass.
Aiken, A. and Wimmers, E.: 1993, Type inclusion constraints and type inference, Proc. of the ACM Symp. on FPCA.
Aiken, A., Wimmers, E. and Lakshman, T.: 1994, Soft typing with conditional types, Proc. of the 21st. ACM Symp. on PoPL.
Andreoli, J.-M., Pareschi, R. and T. Castagnetti: 1993, Abstract interpretation of linear logic programming, Proc. of the International Logic Programming Symposium, pp. 315–334.
Cartwright, R. and Fagan, M.: 1991, Soft typing, Proc. of the ACM Symp. on PLDI.
Colaço, J.-L., Pantel, M. and Sallé, P.: 1996, CAP: An actor dedicated process calculus, ECOOP’96 Workshop on Proof Theory of Concurrent Object-Oriented Programming.
Colaço, J.-L., Pantel, M. and Sallé, P.: 1997, Analyse de linéarité par typage dans un calcul d’ acteurs, Actes des Journées Francophones des Langages Applicatifs.
Colaço, J.-L., Pantel, M., Sallé, P. and Senteni, A.: 1996, Un calcul d’acteurs primitifs (CAP), Actes des Journées Francophones des Langages Applicatifs, pp. 25–43.
Fuh, Y.-C. and Mishra, P.: 1989, Polymorphic subtype inference, closing the theory-practice gap, Proc. of the Symp. on TAPSOFT.
Hewit, C., Bishop, P. and Steiger, R.: 1973, An universal modular actor formalism for artificial intelligence, Proc. of the IJCAI’73.
Honda, K. and Tokoro, M.: 1991, An object calculus for asynchronous communication, in P. America (ed.), Proceedings ECOOP ’81, LNCS 512, Springer-Verlag, Geneva, Switzerland, pp. 133–147.
Kobayashi, N., Pierce, B. C. and Turner, D. N.: 1996, Linearity and the pi-calculus, Proceedings of the ACM Symposium on Principles of Programming Languages.
Kobayashi, N. and Yonezawa, A.: 1994, Type-theoretic foundations for concurrent object-oriented programming, Proceedings of ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA’94), pp. 31–45.
Marcoux, A., Maurel, C. and Sallé, P.: 1988, A language for distributed applications, IEEE Workshop on Future Trends of Distributed Systems in the 90’s.
Milner, R.: 1991, The polyadic it-calculus: a tutorial, Technical Report ECS-LFCS91–180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK. Also in Logic and Algebra of Specification, ed. F. L. Bauer, W. Brauer and H. Schwichtenberg, Springer-Verlag, 1993.
Nielson, F. and Nielson, H.: 1993, From cml to process algebras, CONCUR’93, LNCS 715, pp. 493–508.
Pantel, M.: 1994, Représentation et Transformation: Un modèle de la réutilisabilité dans les langages fonctionnels à objets, PhD thesis, Institut National Polytechnique de Toulouse.
Pierce, B. and Sangiorgi, D.: 1995, Typing and subtyping for mobile processes, Mathematical Structures in Computer Science.
Puntigam, F.: 1996, Type for active objects based on trace semantics, Proc. of Formal Methods for Open Object-based Distributed Systems (FMOODS’96), pp. 5–20.
Vasconcelos, V. T. and Tokoro, M.: 1993, A typing system for a calculus of objects, Proceedings of the International Symposium on Object Technologies for Advanced Software, LNCS 742, Springer-Verlag, pp. 460–474.
Yonezawa, A.: 1990, ABCL: An Object-Oriented Concurrent System, MIT Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Colaço, JL., Pantel, M., Sallé, P. (1997). A Set-Constraint-based analysis of Actors. In: Bowman, H., Derrick, J. (eds) Formal Methods for Open Object-based Distributed Systems. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35261-9_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-35261-9_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2952-7
Online ISBN: 978-0-387-35261-9
eBook Packages: Springer Book Archive