Modular Control Flow Analysis for Libraries | SpringerLink
Skip to main content
Springer Nature Link
Log in

Modular Control Flow Analysis for Libraries

  • Conference paper
  • First Online:
Static Analysis (SAS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2477))

Included in the following conference series:

Abstract

One problem in analyzing object oriented languages is that the exact control flow graph is not known statically due to dynamic dispatching. However, this is needed in order to apply the large class of known interprocedural analysis. Control Flow Analysis in the object oriented setting aims at determining run-time types of variables, thus allowing to possibly targeted method implementations. We present a flow sensitive analysis that allows separate handling of libraries and thereby efficient analysis of whole programs.

This work has in part been supported by the Esprit LTR project #28198 ”JAVA and CoSy Technology for Embedded Systems”

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. O. Agesen. The Cartesian Product Algorithm: Simple and Precise Typing of Parametric Polymorphism. In Proceedings of the European Conference on Object-Oriented Programming, pages 2–26, 1995.

    Google Scholar 

  2. M. Alt, U. Aβmann and H. van Someren. Cosy Compiler Phase Embedding with the CoSy Compiler Model. In Proceedings of the Conference on Compiler Construction, 1994.

    Google Scholar 

  3. D. F. Bacon. Fast and Effective Optimization of Statically Typed Object-Oriented Languages. Technical Report CSD-98-1017, University of California, Berkeley, Oct. 1998.

    Google Scholar 

  4. R. Chatterjee, B. G. Ryder, and W. Landi. Relevant context inference. In Symposium on Principles of Programming Languages, pages 133–146, 1999.

    Google Scholar 

  5. J. Dean, D. Grove and C. Chambers. Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis. Technical Report 01-12-94, Washington University, Dec. 1994.

    Google Scholar 

  6. H. Dewes and C. W. Probst. Static Method Call in Java. In Proceedings of the JOSES Workshop, 2001.

    Google Scholar 

  7. M. Fähndrich, J. Foster, Z. Su, and A. Aiken. Partial online cycle elimination in inclusion constraint graphs. In Conference on Programming Language Design and Implementation, pages 85–96, 1998.

    Google Scholar 

  8. C. Flanagan and M. Felleisen. Componential set-based analysis. ACM Trans. Programming Languages and Systems, 21(2), pages 370–416, Mar. 1999.

    Google Scholar 

  9. D. Genius, U. Aβmann, P. Fritzson, H. Sips, R. Kurver, R. Wilhelm, H. Schepers and T. Rindborg. Java and CoSy Technology for Embedded Systems: the JOSES Project. In Proceedings of the Conference on Electronic Commerce, Multimedia, Embedded Systems and Technologies for Business Processes Stockholm, 1999.

    Google Scholar 

  10. R. T. Hood and K. Kennedy. A Programming Environment for Fortran. In Proceedings of the 18th Annual Hawaii International Conference on System Sciences, pages 625–637, 1985.

    Google Scholar 

  11. F. Martin. Generation of Program Analyzers. Ph.D. Thesis, Universität des Saar-landes, 1999.

    Google Scholar 

  12. F. Nielson, H. R. Nielson and C. L. Hankin. Principles of Program Analysis. Springer-Verlag, 1999.

    Google Scholar 

  13. C.W. Probst. Flow Sensitive Call Graph Construction For Java. In Proceedings of the JOSES Workshop, 2001.

    Google Scholar 

  14. C.W. Probst. Control Flow Analysis-An Overview. The JOSES Consortium, 1999.

    Google Scholar 

  15. T. Ritzau, M. Beemster, F. Liekweg, C.W. Probst. JOC-The JOSES Compiler Presented at The Embedded Systems Show, London, 2000.

    Google Scholar 

  16. A. Rountev and B. G. Ryder. Points-to and side-effect analyses for programs built with precompiled libraries. Technical Report 423, Rutgers University, Oct. 2000.

    Google Scholar 

  17. A. Rountev and B. G. Ryder. Practical points-to analysis for programs built with libraries. Technical Report 410, Rutgers University, Feb. 2000.

    Google Scholar 

  18. Z. Su, M. Fähndrich and A. Aiken. Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs. In Symposium on Principles of Programming Languages, pages 81–95, 2000.

    Google Scholar 

  19. V. Sundaresan, L. J. Hendren, C. Razafimahefa, R. Vall’ee-Rai, P. Lam, E. Gagnon and C. Godin. Practical virtual method call resolution for Java. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages and Application, pages 264–280, 2000.

    Google Scholar 

  20. F. Tip and J. Palsberg. Scalable propagation-based call graph construction algorithms. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages and Application, pages 281–293, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität des Saarlandes, FR. 6.2, 66111, Saarbrücken, Germany

    Christian W. Probst

Authors
  1. Christian W. Probst
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science Facultad de Informática, Technical University of Madrid, Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, Spain

    Manuel V. Hermenegildo  & Germán Puebla  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Probst, C.W. (2002). Modular Control Flow Analysis for Libraries. In: Hermenegildo, M.V., Puebla, G. (eds) Static Analysis. SAS 2002. Lecture Notes in Computer Science, vol 2477. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45789-5_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45789-5_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44235-6

  • Online ISBN: 978-3-540-45789-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation