This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Control-Flow Analysis for a Calculus of Concurrent Objects
July 2000 (vol. 26 no. 7)
pp. 617-634

Abstract—We present a set-based control flow analysis for an imperative, concurrent object calculus extending the Fisher-Honsell-Mitchell functional object-oriented calculus described in [1]. The analysis is shown to be sound with respect to a transition-system semantics.

[1] K. Fisher, F. Honsell, and J.C. Mitchell, “A Lambda Calculus of Objects and Method Specialization,” Nordic J. Computing, (formerly BIT), 1993.
[2] General Magic “Telescript Technology: Mobile Agents,” White paper, 1996.
[3] G. McGraw and E.W. Felten, Java Security. Wiley Computer Publishing, 1996.
[4] W. Clinger and E. Jonathan Rees, “The Revised Report on the Algorithmic Language Scheme,” ACM Lisp Pointers, vol. 4, no. 3, 1991.
[5] R. Milner,M. Tofte,, and R. Harper,The Definition of Standard ML.Cambridge, Mass.: MIT Press, 1990.
[6] D. Ungar and R. Smith, "SELF: The Power of Simplicity." LISP and Symbolic Computation, vol. 4, no. 3, pp. 187-205, July 1991.
[7] O. Shivers, “Control-flow Analysis of Higher-order Languages or Taming Lambda,” Ph. D. thesis, Carnegie-Mellon Univ., 1991.
[8] C. Flanagan and M. Felleisen, “Set-based Analysis For Full Scheme and Its Use in Soft-typing,” Technical Report TR95-253, Dept. of Computer Science, Rice Univ., 1995.
[9] N. Heintze, “Set Based Analysis of ML Programs,” Proc. ACM Symp. Lisp and Functional Programming, 1994.
[10] N. Heintze, “Set Based Program Analysis,” PhD thesis, Carnegie-Mellon Univ., 1992.
[11] J. Palsberg, “Closure Analysis in Constraint Form,” ACM TOPLAS, vol. 17, no. 1, pp. 47–62, 1995.
[12] J. Palsberg and M. Schwartzbach, “Object-Oriented Type Inference,” Proc. Conf. Object-Oriented Programming Systems, Languages, and Applications, pp. 146–161, Oct. 1991.
[13] U. Hölzle and D. Ungar, “Reconciling Responsiveness with Performance in Pure Object-Oriented Languages,” ACM Trans. Programming Languages and Systems, vol. 18, no. 4, pp. 355-400, July 1996.
[14] A. Yonezawa, ABCL: An Object-Oriented Concurrent System, MIT Press, 1990.
[15] L. Cardelli, “A Language with Distributed Scope,” Computing Systems, vol. 8, no. 1, pp. 27–59, 1995.
[16] G. Agha, ACTORS: A Model of Concurrent Computation in Distributed Systems, MIT Press, Cambridge, Mass., 1986.
[17] T.Y. Leung and R.R. Muntz, "Query Processing for Temporal Databases," Proc. IEEE Int'l Conf. Data Eng., 1990.
[18] B. Thomsen, L. Leth, and T.M. Kuo, “FACILE—From Toy to Tool,” ML with Concurrency: Design, Analysis, Implementation, and Application, F. Nielson, ed., Springer-Verlag, 1996.
[19] B.C. Pierce and D.N. Turner, “Pict: A Programming Language Based on the Pi-Calculus,” Technical Report CSCI 476, Computer Science Dept., Indiana Univ., 1997. To appear Proof, Language and Interaction: Essays in Honour of Robin Milner, Gordon Plotkin, Colin Stirling, and Mads Tofte, eds., MIT Press, 1998.
[20] H.R. Nielson and F. Nielson, "Higher-Order Concurrent Programs with Finite Communication Topology," Proc. 21st ACM Symp Principles of Programming Languages, pp. 84-97, Jan. 1994.
[21] C. Colby, “Analyzing the Communication Topology of Concurrent Programs,” Proc. ACM Symp. Partial Evaluation and Semantics-Based Program Manipulation, pp. 202–213, 1995.
[22] N. Kobayashi, M. Nakade, and A. Yonezawa, “Static Analysis of Comm. for Asynchronous Concurrent Programming Languages,” Proc. SAS, 1995.
[23] J. Plevyak, X. Zhang, and A. Chien, “Obtaining Sequential Efficiency for Concurrent Object-oriented Languages,” Proc. POPL '95, 1995.
[24] P. Di Blasio and K. Fisher, “A Calculus for Concurrent Objects,” Proc. CONCUR '96: Concurency Theory, vol. LNCS1119 pp. 655–670, Springer 1996.
[25] P. Di Blasio, “A Calculus for Concurrent Objects: Design and Control Flow Analysis,” PhD thesis, Universitàdi Roma, “La Sapienza,” 1997.
[26] H. Nielson and F. Nielson, “Infinitary Control Flow Analysis: A Collecting Semantics for Closure Analysis,” Proc. POPL '97, 1997.
[27] C. Flanagan, A. Sabry, B. Dubra, and M. Felleisen, “The Essence of Compiling with Continuation,” Proc. PLDI, pp. 237–247, 1993.
[28] S. Jagannathan and A. Wright, “Flow-directed Inlining,” Proc. PLDI '96, pp. 193–205, 1996.

Index Terms:
Concurrency, object-oriented, control-flow analysis, soundness, prototype-based.
Citation:
Paolo Di Blasio, Kathleen Fisher, Carolyn Talcott, "A Control-Flow Analysis for a Calculus of Concurrent Objects," IEEE Transactions on Software Engineering, vol. 26, no. 7, pp. 617-634, July 2000, doi:10.1109/32.859531
Usage of this product signifies your acceptance of the Terms of Use.