A Set-Constraint-based analysis of Actors

  • J-L. Colaço
  • M. Pantel
  • P. Sallé


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.


Actors concurrent objects type inference set constraints. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Agha, G.: 1986, Actors: A model of concurrent computation in distributed systems, MIT Press, Cambridge, Mass.Google Scholar
  2. Aiken, A. and Wimmers, E.: 1993, Type inclusion constraints and type inference, Proc. of the ACM Symp. on FPCA.Google Scholar
  3. Aiken, A., Wimmers, E. and Lakshman, T.: 1994, Soft typing with conditional types, Proc. of the 21st. ACM Symp. on PoPL.Google Scholar
  4. 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.Google Scholar
  5. Cartwright, R. and Fagan, M.: 1991, Soft typing, Proc. of the ACM Symp. on PLDI.Google Scholar
  6. 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.Google Scholar
  7. 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.Google Scholar
  8. 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.Google Scholar
  9. Fuh, Y.-C. and Mishra, P.: 1989, Polymorphic subtype inference, closing the theory-practice gap, Proc. of the Symp. on TAPSOFT.Google Scholar
  10. Hewit, C., Bishop, P. and Steiger, R.: 1973, An universal modular actor formalism for artificial intelligence, Proc. of the IJCAI’73.Google Scholar
  11. 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.Google Scholar
  12. 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.Google Scholar
  13. 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.Google Scholar
  14. 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.Google Scholar
  15. 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.Google Scholar
  16. Nielson, F. and Nielson, H.: 1993, From cml to process algebras, CONCUR’93, LNCS 715, pp. 493–508.Google Scholar
  17. 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.Google Scholar
  18. Pierce, B. and Sangiorgi, D.: 1995, Typing and subtyping for mobile processes, Mathematical Structures in Computer Science.Google Scholar
  19. 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.Google Scholar
  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.CrossRefGoogle Scholar
  21. Yonezawa, A.: 1990, ABCL: An Object-Oriented Concurrent System, MIT Press.Google Scholar

Copyright information

© IFIP International Federation for Information Processing 1997

Authors and Affiliations

  • J-L. Colaço
    • 1
  • M. Pantel
    • 1
  • P. Sallé
    • 1
  1. 1.LIMA/ENSEEIHT/IRITToulouseFrance

Personalised recommendations