Skip to main content

An Improved Type-Inference Algorithm to Expose Parallelism in Object-Oriented Programs

  • Chapter

Abstract

The popularity of object-oriented (OO) programming has been on the rise. Unlike the procedural programming approach, OO programming provides a natural facility for modeling and decomposing a problem into self-contained entities called objects. The objects interact with each other through a message passing mechanism. At different program-points, the objects assume different implementation (or concrete) types, which are sets of classes or built-in types.

Sandeep Kumar and Dharma P. Agrawal are with Department of Electrical & Computer Engineering and supported by ARO under contract DAAH04-94-G-0306.

S.Purushothaman Iyer is with Department of Computer Science and supported in part by NSF under contract CCR-9404619.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agesen, O., Palsberg, J., and Schwartzbach, M. I., “Type Inference For SELF: Analysis of Objects With Dynamic and Multiple Inheritance,” Proc. of ECOOP’93, Kaiserslautern, Germany, July 1993, pp. 247–267.

    Google Scholar 

  2. Calder, B., Grunwald, D., and Zorn, B. “Quantifying Behavioral Differences Between C and C++ Programs,” Tech. Rep. CU-CS-698–94, Dept. of Computer Sci., Univ. of Colorado, Boulder, Jan 1994, pp. 1–28.

    Google Scholar 

  3. Cytron, R., et al., “Efficiently Computing Static Single Assignment Form and the Control Dependence Graph,” ACM TOPLAS, Vol. 13, No. 4, Oct 1991, pp. 451–490.

    Article  Google Scholar 

  4. Gautron, P. and Shepard, T., “Static Typing Without Explicit Types,” Technical Report, Dept. of Electrical and Computer Engg., Royal Military College of Canada, Ontario, Canada, 1994.

    Google Scholar 

  5. Oxhrj, N., Palsberg, J., and Schwartzbach, M. I., “Making Type Inference Practical,” Proc. of ECOOP, Springer-Verlag, LNCS 615, Utrecht, The Netherlands, July 1992.

    Google Scholar 

  6. Palsberg, J. and Schwartzbach, M. I., Object-Oriented Type Systems,John-Wiley & Sons Ltd., 1994.

    Google Scholar 

  7. Pande, H. and Ryder, B., “Static Type Determination for C++,” USENIX Sixth C++ Tech. Conf., Cambridge, MA, April 11–14, 1994, pp. 85–98.

    Google Scholar 

  8. Plevyak, J. and Chien, A. A., “Precise Concrete Type Inference of Object-Oriented Programs,” Proc. of OOPSLA, Portland, OR, Oct. 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media New York

About this chapter

Cite this chapter

Kumar, S., Agrawal, D.P., Iyer, S.P. (1996). An Improved Type-Inference Algorithm to Expose Parallelism in Object-Oriented Programs. In: Szymanski, B.K., Sinharoy, B. (eds) Languages, Compilers and Run-Time Systems for Scalable Computers. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2315-4_22

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-2315-4_22

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5979-1

  • Online ISBN: 978-1-4615-2315-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics